Section 9.2 Gauss' Lemma
Theorem 9.2.1. Gauss' Lemma.
Let \(p\) be an odd prime and let \(\gcd(a, p) =1.\) If \(n\) denotes the number of integers in the set
whose remainders upon division by \(p\) exceed \(p/2,\) then
Proof.
Since \(\gcd(a, p) = 1,\) all of the \((p-1)/2\) integers of \(S\) are incongruent modulo \(p\) and none are zero. Let \(r_1,..., r_m\) be those remainders upon division by \(p\) that are between \(0\) and \(p/2 \hspace{2mm} (0\lt r_i \lt p/2)\) and \(s_1,..., s_n\) be those remainders upon division by \(p\) that are between \(p/2\) and \(p \hspace{2mm} (p/2 \lt s_i \lt p).\) Then \(m + n = (p-1)/2\) and the integers
are all positive and less that \(p/2.\)
To show these integers are all distinct, we only need to show that \(p-s_i\) is not equal to any \(r_j.\) So assume to the contrary that
for some \(i\) and \(j.\) Then there exists \(u, v \hspace{2mm} (1 \leq u, v\leq (p-1)/2)\) such that \(s_i \equiv ua\pmod{p}\) and \(r_j \equiv va\pmod{p}.\) So
which is impossible since \(1\leq u, v \leq (p- 1)/2.\)
So
and so the product of them is \(\left(\dfrac{p-1}{2}\right)!.\) Now since the product of the remainders is also congruent modulo \(p\) to the product of the elements of \(S,\) we have
so that since \(\gcd\left(\left[\dfrac{(p-1)}{2}\right]!, p\right) = 1\) we have
Some rearrangement and Euler's Criterion gives
so that we have