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 p is a prime having the form 4 k + 3 , and if m is the number of quadratic residues less that p 2 , then 1 3 5 ( p 2 ) ( 1 ) m + k + 1 ( mod p ) , and 2 4 6 ( p 1 ) ( 1 ) m + k ( mod p ) .

Hint. Denoting the first given product by P , and ( 2 k + 1 ) ! by Q , prove that p ( 1 ) k Q ( mod p ) by using 2 j ( p 2 j ) ( mod p ) . Similarly, relate Q to the product of the quadratic residues modulo p by replacing any nonresidue n in Q by the quadratic residue n , and use the preceding problem.

Answers

Proof. Let p a prime of the form p = 4 k + 3 . Put

P = 1 3 5 ( p 2 ) , Q = ( p 1 2 ) ! = ( 2 k + 1 ) ! R = 2 4 6 ( p 1 ) .

Then, using 2 j ( p 2 j ) ( mod p ) ,

P = j = 1 ( p 1 ) 2 ( 2 j 1 ) j = 1 ( p 1 ) 2 [ ( p 2 j ) 1 ] ( 1 ) ( p 1 ) 2 j = 1 ( p 1 ) 2 ( p ( 2 j + 1 ) ) R ( mod p ) ,

because j = 1 ( p 1 ) 2 ( p ( 2 j + 1 ) ) = 2 4 6 ( p 1 ) = R , and ( 1 ) ( p 1 ) 2 = ( 1 ) 2 k + 1 = 1 . This proves

P R ( mod p ) . (1)

Moreover,

R = j = 1 ( p 1 ) 2 ( 2 j ) = 2 ( p 1 ) 2 j = 1 ( p 1 ) 2 j ( 2 p ) ( p 1 2 ) ! ( mod p )

So

R ( 2 p ) Q ( mod p ) . (2)

Here ( 2 p ) = 2 ( p 2 1 ) 2 , where

p 2 1 8 = ( 4 k + 3 ) 2 1 8 = 2 k 2 + 3 k + 1 k + 1 ( mod 2 ) .

Therefore

( 2 p ) = ( 1 ) k ,

and using (1) and (2),

P ( 1 ) k Q . (3)

Now, write U the set of quadratic residues in I = [ [ 1 , ( p 1 ) 2 ] ] , U ¯ its complementary set in I , which is the set of quadratic nonresidues in I . Then

Q = ( p 1 2 ) ! = j I j = j U j j U ¯ j .

If j U ¯ is a quadratic nonresidue, then j is a residue, because 1 is a nonresidue modulo p = 4 k + 3 . Therefore p j is a quadratic residue, and p j J = [ [ ( p + 1 ) 2 , p 1 ] ] .

If m is the number of quadratic residues less that p 2 , there are ( p 1 ) 2 m nonresidues in I , thus

Q ( 1 ) p 1 2 m j U j j U ¯ ( p j ) ( mod p ) .

The set R of the quadratic residues modulo p in [ [ 1 , p 1 ] ] is the union of the residues in I = [ [ 1 , ( p 1 ) 2 ] ] , and the residues in J = [ [ ( p + 1 ) 2 , p 1 ] ] , all of the form p j , where j U ¯ . Therefore

j U j j U ¯ ( p j ) = j R j ,

where j R j 1 ( mod p ) by Problem 16, for p = 4 k + 3 . We obtain

Q ( 1 ) p 1 2 ( 1 ) m = ( 1 ) m + 1 ( mod p ) . (4)

Then (3) and (4) give

P = 1 3 5 ( p 2 ) ( 1 ) m + k + 1 ( mod p ) ,

and (1) gives

R = 2 4 6 ( p 1 ) ( 1 ) m + k ( mod p ) .

User profile picture
2024-10-19 15:52
Comments