Question: Let p be a prime and k a positive integer such that a k mod p=a mod p for all integers a. Prove that p
Let p be a prime and k a positive integer such that ak mod p=a mod p for all integers a. Prove that p - 1 divides k-1.
Please be clear. Do not use a proof that is incorrect with exponents. Thank you.
Be legible.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
