Finding a non-square mod p

· John Cook · Feb. 14, 2026, 10:09 p.m.
Computing Math Number theory mathematics Number theory algorithms Prime numbers
Summary
This blog post discusses the algorithm by Stan Wagon for expressing an odd prime p as a sum of two squares and the prerequisite of finding a non-square mod p, which is a number c that is not congruent to the square of any integer mod p.
Read full post on www.johndcook.com →
AUTHOR
Advertise
Sponsor diff.blog
Put your product in front of developers who read and write about their craft. One exclusive sponsor at a time.
Become a sponsor →