Chapter 9. Quadratic Congruences

Previous Chapter

Next Chapter

This chapter studies the solution of quadratic congruences tex2html_wrap_inline196 for prime p, and tex2html_wrap_inline200 . The basic properties of quadratic congruences modulo primes, including the study of the Legendre symbol, are developed in the first section. These lead to Euler's criterion for solvability of the congruence. An efficient algorithm is discussed for the solution of the congruence. The general congruence tex2html_wrap_inline200 is solved using these techniques and the Chinese Remainder Theorem.