a) so what happens if ? (use this same identity-changing a- to prove that n has to be prime)
b) note that now suppose that has an odd divisor and write
Hello, could anyone give me some hints to do these following questions? Any help will be greatly appreciated, thanks
a) Let a and n be integers greater than 1. Prove that is prime only if and n is prime.
b) Show that is prime only if n is a power of 2.