Exercise 3.1.18* (Cubic residues)

For any prime p and any integer a such that ( a , p ) = 1 , say that a is a cubic residue of p if x 3 a ( mod p ) has at least one solution. Prove that if p is of the form 3 k + 2 , then all integers in a reduced residue system modulo p are cubic residues, whereas if p is of the form 3 k + 1 , only one-third of the members of a reduced residue system are cubic residues.

Answers

Proof. Let p be a prime number.

  • Suppose that p 2 ( mod 3 ) . If a p = 1 , a p 1 1 ( mod 3 ) , and 3 2 p 1 , thus

    a a a p 1 a 2 p 1 ( a ( 2 p 1 ) 3 ) 3 ( mod p ) .

    If x = a ( 2 p 1 ) 3 , then a x 3 ( mod p ) , thus every a such that a p = 1 is a cubic residue modulo p .

  • Suppose now that p 1 ( mod 3 ) . Let a be an integer such that a p = 1 . By Theorem 2.37,

    x , a x 3 ( mod p ) a ( p 1 ) 3 1 ( mod p ) .

    Let g be a primitive root modulo p . Then a g t ( mod p ) for some integer t such that 0 t < p 1 . Since the order of g is p 1 ,

    a p 1 3 1 ( mod p ) g t p 1 3 1 ( mod p ) p 1 t p 1 3 3 t .

    Therefore, if γ = g 3 , the set of cubic residues modulo p is

    C = { 1 , g 3 , g 6 , , g p 4 } = { γ , γ 2 , , γ ( p 1 ) 3 } ,

    (where γ ( p 1 ) 3 1 ( mod 3 ) ), thus Card ( C ) = ( p 1 ) 3 .

    Exactly one-third of the members of a reduced residue system are cubic residues.

User profile picture
2024-10-20 07:59
Comments