Fermat's last theorem #13
Draft
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- Created comprehensive README explaining Fermat's Last Theorem - Implemented Python verifier that demonstrates the theorem computationally - Verifies no solutions exist for n > 2 (consistent with the theorem) - Finds all Pythagorean triples (n=2) as known cases - Includes Docker support (Dockerfile + docker-compose.yml) - Added comprehensive test suite - All tests passing Note: This is an educational demonstration, not a mathematical proof. The actual proof by Andrew Wiles (1995) uses advanced mathematics and spans hundreds of pages. Co-authored-by: alfredo.edye <alfredo.edye@bitlogic.io>
Co-authored-by: alfredo.edye <alfredo.edye@bitlogic.io>
|
Cursor Agent can help with this pull request. Just |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Adds an educational Fermat's Last Theorem verifier to address a request to "solve" the theorem, providing a computational demonstration and explanation instead of a mathematical proof.
The original Linear issue AP-20 asked to "solve" Fermat's Last Theorem. Since this is a complex mathematical proof (not solvable by code), this PR provides an educational resource that explains the theorem, its history, and includes a Python program to computationally verify its properties for small integer values (e.g., finding Pythagorean triples for n=2 and showing no solutions for n>2 within a given range). This approach offers a practical and educational response to the request.
Linear Issue: AP-20