Reciprocity Theorem

If there exists a rational integer x such that, when n, p, and q are positive integers,

 x^n=q (mod p),

then q is the n-adic residue of p, i.e., q is an n-adic residue of p iff x^n=q (mod p) is solvable for x. Reciprocity theorems relate statements of the form "p is an n-adic residue of q" with reciprocal statements of the form "q is an n-adic residue of p."

The first case to be considered was n=2 (the quadratic reciprocity theorem), of which Gauss gave the first correct proof. Gauss also solved the case n=3 (cubic reciprocity theorem) using integers of the form a+brho, where rho is a root of x^2+x+1=0 and a, b are rational integers. Gauss stated the case n=4 (biquadratic reciprocity theorem) using the Gaussian integers.

Proof of n-adic reciprocity for prime n was given by Eisenstein in 1844-50 and by Kummer in 1850-61. In the 1920s, Artin formulated Artin's reciprocity theorem, a general reciprocity law for all orders.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.