Difference between revisions of "Quadratic residues"
ComplexZeta (talk | contribs) |
ComplexZeta (talk | contribs) m |
||
Line 1: | Line 1: | ||
− | Let <math>a<math> and <math>m</math> be [[integer]]s, with <math>m\neq 0</math>. We say that <math>a</math> is a '''quadratic residue''' [[modulo]] <math>m</math> if there is some number <math>n</math> so that <math>n^2-a</math> is [[divisible]] by <math>m</math>. | + | Let <math>a</math> and <math>m</math> be [[integer]]s, with <math>m\neq 0</math>. We say that <math>a</math> is a '''quadratic residue''' [[modulo]] <math>m</math> if there is some number <math>n</math> so that <math>n^2-a</math> is [[divisible]] by <math>m</math>. |
== Legendre Symbol == | == Legendre Symbol == |
Revision as of 11:21, 24 June 2006
Let and be integers, with . We say that is a quadratic residue modulo if there is some number so that is divisible by .
Legendre Symbol
Determining whether is a quadratic residue modulo is easiest if is a prime. In this case we write (Please fix this. It's too much like hard work for me right now.) The symbol is called the Legendre symbol.
Quadratic Reciprocity
Let and be distinct odd primes. Then . This is known as the Quadratic Reciprocity Theorem.
Jacobi Symbol
Now suppose that , as above, is not composite, and let . Then we write . This symbol is called the Jacobi symbol.
(I'm sure someone wants to write out all the fun properties of Legendre symbols. It just happens not to be me right now.)