David Burton Homework

Abhinandan Saha

18th August 2020

1 Problem 1
Assuming that r is a primitive root of the odd prime p, establish the following
facts:
p−1
1. The congruence r 2 ≡ −1 (mod p) holds.

2. If r0 is any other primitive root of p then rr0 is not a primitive root of

p.

3. If integer r0 is such that rr0 ≡ 1 (mod p) then r0 is a primitive root

of p.

Ans:

1. As r is a primitive root of a prime p, hence ordp r = p − 1. Hence no

number lesser than p − 1 is congruent 1 mod p. Now taking root on
both sides of the congruence rp−1 ≡ 1 (mod p) we get,
√ √
rp−1 ≡ ± 1 (mod p)
p−1 √
⇒ r 2 ≡ ± 1 (mod p)
p−1
But 2 < p − 1, hence it cannot be congruent 1 mod p. So,
p−1
r 2 ≡ −1 (mod p)

1
2. As r0 is also a primitive root of p hence it follows the condition in the
last problem. Hence,
p−1
(r0 ) 2 ≡ −1 (mod p)

Therefore from the two equations we conclude that,

p−1 p−1
(rr0 ) 2 ≡ (−1)(−1) (mod p) ⇒ (rr0 ) 2 ≡ 1 (mod p)

As we see the ordp (rr0 ) < p − 1, hence rr0 is not a primitive root of p.

2
3. If the condition is true then as r is a primitive root of p, hence rr0 =
p−1
rp−1 ⇒ r0 = rp−2 . Now then order of r0 = rp−2 is gcd(p−1,p−2) = p − 1.
Hence it is a primitive root of p.

3
2 Problem 2
For a prime p > 3, prove that the primitive roots of p occur in incongruent
pairs r, r0 where rr0 ≡ 1 (mod p).

Ans:
Here gcd(r, p) = 1. As r is primitive root hence from previous problem we
know that r0 is also an primitive root of p, where r0 = rp−2 . Also due to r
being primitive root of p we know that all the number,

a, a2 , . . . , ap−1

are congruent in some order to the set of numbers, {a1 , a2 , . . . , ap−1 }

where these are the numbers lesser than p and co-prime to p. Hence we may
conclude that each occurring pair of r, r0 are incongruent mod p.

4
3 Problem 3
Give a different proof of the Theorem : ”The quadratic congruence
x2 + 1 ≡ 0 (mod p), where p is an odd prime, has a solution iff
p ≡ 1 (mod 4)” by showing that if r is a primitive root of the prime p ≡
p−1
1 (mod 4), then r 4 satisfies the quadratic congruence x2 + 1 ≡ 0 (mod p).

Ans:
If r is the primitive root of p then rp−1 ≡ 1 (mod p). From one of the
previous problems we can say that:
p−1
r 2 ≡ −1 (mod p)

This means that,

p−1
r 2 + 1 ≡ 0 (mod p)
p−1 p−1
Hence here it can be assumed that x2 = r 2 ⇒ x = ±r 4 . This solution
to the quadratic congruence is valid as p ≡ 1 (mod 4). Hence proved.

5
4 Problem 4
Use the fact that each prime p has a primitive root to give a different proof
of Wilson’s Theorem.

Ans:
If p has a primitive root r, then,

(p − 1)! ≡ r1+2+3+4+...+(p−1) (mod p)

Here rp−1 ≡ 1 (mod p). Hence we are left with p − 2 powers of r. Now from
the question we did before we know that for a prime p > 3, the primitive
roots of p occur in incongruent pairs r, r0 where rr0 ≡ 1 (mod p). Hence
p−1
those pairs get formed here, except for r 2 and ultimately,
p−1
r1+2+3+4+...+(p−1) ≡ r 2 (mod p)
p−1
Now from another problem before we saw that r 2 ≡ −1 (mod p), hence
we may conclude that,

(p − 1)! ≡ −1 (mod p)