Proofs and numbers
posted by yin on .
Prove the following theorem: Suppose p is a prime number, r, s are positive integers and x is an
arbitrary integer. Then we have x^r identical to x^s (mod p) whenever r is identical to s (mod 11).for x belongs to an integer