Wagon’s algorithm in Python
Read OriginalThis article provides a step-by-step implementation of Stan Wagon's algorithm in Python to find integer solutions for x² + y² = p, where p is a large odd prime. It covers finding a quadratic non-residue modulo p, computing a square root of -1 mod p, and applying a modified Euclidean algorithm with a precision-aware stopping condition using Python's isqrt. The tutorial includes complete code and demonstrates the solution for a 255-bit prime.
0 comments
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Quoting Thariq Shihipar
Simon Willison
•
2 votes
2
Container queries are rad AF!
Chris Ferdinandi
•
1 votes
3
Top picks — 2026 January
Paweł Grzybek
•
1 votes
4
In Praise of –dry-run
Henrik Warne
•
1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár
•
1 votes
6
Vibe coding your first iOS app
William Denniss
•
1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook
•
1 votes