guideofcasinos.com

Home

   Casino game
   List of casinos
   Sports book
   Baccarat
   Blackjack
   Numbers game
   Slot machine
   Straperlo
   Totalisator
   Video Lottery Terminal
   Video poker
   Golden Palace Poker
   Bet exchange
   Roulette
   Russian roulette
   Croupier
   Casino Night
   Casinos
   Lottery machine

Links

Sponsored Links
Find Quadratic reciprocity	Quadratic reciprocity Info	Search Jobs on Yahoo! HotJobs

Quadratic reciprocity

In mathematics, in number theory, the law of quadratic reciprocity connects the solvability of two related quadratic equations in modular arithmetic. As a consequence, it allows us to determine the solvability of any quadratic equation in modular arithmetic.

It was conjectured by Euler and Legendre and first satisfactorily proven by Gauss. Gauss called it the 'golden theorem' and was so fond of it that he went on to provide more than seven separate proofs over his lifetime.

Suppose p and q are two different odd primes, which means that p and q are congruent either to 1 or to 3 (mod 4). If at least one of them is congruent to 1 mod 4, then the congruence

$x^2\equiv p\ ({\rm mod}\ q)$

has a solution x if and only if the congruence

$y^2\equiv q\ ({\rm mod}\ p)$

has a solution y. (The two solutions will in general be different.) On the other hand, if both primes are congruent to 3 modulo 4, then the congruence

$x^2\equiv p\ ({\rm mod}\ q)$

has a solution x if and only if the congruence

$y^2\equiv q\ ({\rm mod}\ p)$

does not have a solution y.

Using the Legendre symbol

Using the Legendre symbol:

$\left(\frac{a}{p}\right)=\left\{\begin{matrix}1 & \mathrm{if}\ a\ \mathrm{is\ a\ square\ modulo\ }p, \\ 0 & \mathrm{if\ } p\ \mathrm{divides\ }a, \\ -1 & \mathrm{otherwise,}\end{matrix}\right.$

these statements may be summarized as

$\left(\frac{p}{q}\right) \left(\frac{q}{p}\right) = (-1)^{(p-1)(q-1)/4}.$

Since $(p - 1)(q - 1) / 4$ is even if either p or q is congruent to 1 mod 4, and odd only if both p and q are congruent to 3 mod 4, $\left(\frac{p}{q}\right) \left(\frac{q}{p}\right)$ is equal to 1 if either p or q is congruent to 1 mod 4, and is equal to –1 if both p and q are congruent to 3 mod 4.

For example taking p to be 11 and q to be 19, we can relate $\left(\frac{11}{19}\right)$ to $\left(\frac{19}{11}\right)$ , which is $\left(\frac{8}{11}\right)$ or $\left(\frac{-3}{11}\right)$ . To proceed further we may need to know supplementary laws for computing $\left(\frac{2}{q}\right)$ and $\left(\frac{-1}{q}\right)$ explicitly. For example,

$\left(\frac{-1}{q}\right) = (-1)^{(q-1)/2}.$

Using this we relate $\left(\frac{-3}{11}\right)$ to $\left(\frac{3}{11}\right)$ to $\left(\frac{11}{3}\right)$ to $\left(\frac{2}{3}\right)$ to $\left(\frac{-1}{3}\right)$ , and can complete the initial calculation.

Franz Lemmermeyer's book Reciprocity Laws: From Euler to Eisenstein, published in 2000, collects literature citations for 196 different published proofs for the quadratic reciprocity law.

There are cubic, quartic (biquadratic) and other higher reciprocity laws; but since two of the cube roots of 1 (root of unity) are not real, cubic reciprocity is outside the arithmetic of the rational numbers (and the same applies to higher laws).

The Gauss lemma reasons about the properties of quadratic residues and is involved in two of Gauss's proofs of quadratic reciprocity.

External links

Access denied for user 'root'@'localhost' (using password: NO)