Question

for n=(195) , by fermat,s theorom a^(n-2)

Answer 1

Answer:

it suffices to prove it mod 3,5,13 then use the CRT. Prove this modulo each prime. Either 3|a or 3∤a; in either case you should be able to prove a193−a≡0(mod3 195).