Finding a square root of -1 mod p
Read OriginalThis technical article details the mathematical condition (p ≡ 1 mod 4) for the existence of a square root of -1 modulo an odd prime p. It explains the algorithm to find such a root using a quadratic non-residue c and provides a concrete Python implementation for the large prime p = 2²⁵⁵ - 19.
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
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes