(3/7)
3 ≡ 3 and 7 ≡ 3 mod 4: (3/7) = −(7/3) = −(1/3) = −1
Both ≡ 3 mod 4, so flip sign.
For distinct odd primes and , . The two symbols are equal unless both primes are , in which case they are opposite.
This page is easier if you are comfortable with:
The symbol says whether is a square modulo , found with Euler's criterion. The law lets us flip to with a modulus that is smaller after reduction. Examples: , , both , so the product is : (squares mod 7 are 1, 2, 4) and , product .
For , (both ) the product is : (squares mod 13: 1, 3, 4, 9, 10, 12) and (squares mod 5: 1, 4), product . For , (both ): : , . The remainders mod 4 are as in squares modulo 4 and 8.
Quadratic reciprocity, Gauss's "golden theorem", gives a fast algorithm for deciding whether is solvable, together with the rules for and . It is used in primality testing and cryptography (Chinese remainder theorem, prime factors) and in the study of which primes are sums of two squares; see also linear congruences.
Quadratic reciprocity relates whether p is a square mod q with whether q is a square mod p.
The product is −1 exactly when both primes are 3 mod 4.
These examples are worked by hand, step by step, so you can compare your own working.
Find .
Find .
Find .
A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.
3 ≡ 3 and 7 ≡ 3 mod 4: (3/7) = −(7/3) = −(1/3) = −1
Both ≡ 3 mod 4, so flip sign.
5 ≡ 1 mod 4: (5/11) = (11/5) = (1/5) = 1
One ≡ 1 mod 4: no sign change.
second supplement: p ≡ ±1 mod 8 → +1
7 ≡ −1 mod 8.
= (−1)^((p−1)/2)
p = 7: −1.
For distinct odd primes p, q: (p/q)(q/p) = (−1)^((p−1)/2 · (q−1)/2). So (p/q) = (q/p) unless both are ≡ 3 mod 4, in which case (p/q) = −(q/p).
Evaluate (3/7).
Evaluate (5/11).
Evaluate (7/19).
Evaluate (−1/13).
(5/11) = −(11/5) ✗
flip only when both ≡ 3 mod 4 ✓
Check both residues.
(11/5) left as is ✗
(11/5) = (1/5) ✓
Reduce 11 mod 5.
(a/9) ✗
p must be an odd prime ✓
Use Jacobi symbols otherwise.
(2/p) = 1 for p ≡ 3 mod 8 ✗
(2/p) = −1 ✓
p ≡ ±3 mod 8 gives −1.
Try each one on paper, then open the answer. Use the solver above to see the full working.
4
4
1
6
3
1
Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.
Solve: …
(p/q)(q/p) = (−1)^(((p−1)/2)((q−1)/2)).
When both primes are ≡ 3 mod 4.
1 if p ≡ 1 mod 4, else −1.
1 if p ≡ ±1 mod 8.
Euler’s criterion.
More in Discrete maths and number theory and the formula sheets.