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
Webinar Series – SQL Server Indexing
Koen Verbeeck
•
2 votes
2
Risks and Limitations of AI in the Life Sciences
Jeremy Howard
•
2 votes
3
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
2 votes
4
1M context is now generally available for Opus 4.6 and Sonnet 4.6
Simon Willison
•
1 votes
5
AI is my CMS
Chris Coyier
•
1 votes