Exercise 2.8.9 ($3$ is a primitive root of $17$)

Show that 3 8 1 ( mod 17 ) . Explain why this implies that 3 is a primitive root of 17 .

Answers

Proof. Since 3 4 = 9 2 = 81 = 4 × 17 + 13 4 ( mod 17 ) , 3 8 ( 4 ) 2 = 16 1 ( mod 17 ) , thus

3 8 1 ( mod 17 ) .

Let r be the order of 3 modulo 17 . Since 3 16 1 ( mod 17 ) , and 3 8 1 ( mod 17 ) , r 2 4 and r 2 3 , therefore r = 16 . So 3 is a primitive root modulo 17 . □

User profile picture
2024-09-11 12:01
Comments