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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!