- 4.3k Downloads
In this chapter, we will consider the general question of whether an integer a has a square root mod (n), and if so, how many there are and how one can find them. One of the main applications of this is to the solution of quadratic congruences, but we will also deduce a proof that there are infinitely many primes p = 1 mod (4), and we will give a useful primality test for Fermat numbers.
KeywordsInteger Point Primitive Root Chinese Remainder Theorem Quadratic Residue Fermat Number
Unable to display preview. Download preview PDF.