Fermat's little theorem states that

≡a mod p
If we divide both sides by a, then

≡1 mod p
=>

≡1 mod 17

≡1 mod 17
Rewrite

mod 17 as

mod 17
and apply Fermat's little theorem

mod 17
=>

mod 17
So we conclude that

≡1 mod 17
Answer:
b is the correct answer I am also not sure
Answer:
1/28
Step-by-step explanation:
Answer:
n =24
Step-by-step explanation:
pretend n is x its just a normal fraction lol