Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.1.17* (Find $1\cdot 3 \cdot 5\cdots(p-2)$ modulo $p$)
Exercise 3.1.17* (Find $1\cdot 3 \cdot 5\cdots(p-2)$ modulo $p$)
Prove that if is a prime having the form , and if is the number of quadratic residues less that , then , and .
Hint. Denoting the first given product by , and by , prove that by using . Similarly, relate to the product of the quadratic residues modulo by replacing any nonresidue in by the quadratic residue , and use the preceding problem.
Answers
Proof. Let a prime of the form . Put
Then, using ,
because , and . This proves
Moreover,
So
Here , where
Therefore
and using (1) and (2),
Now, write the set of quadratic residues in , its complementary set in , which is the set of quadratic nonresidues in . Then
If is a quadratic nonresidue, then is a residue, because is a nonresidue modulo . Therefore is a quadratic residue, and .
If is the number of quadratic residues less that , there are nonresidues in , thus
The set of the quadratic residues modulo in is the union of the residues in , and the residues in , all of the form , where . Therefore
where by Problem 16, for . We obtain
Then (3) and (4) give
and (1) gives
□