Posted by **yin** on Wednesday, November 28, 2012 at 10:53am.

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

## Answer this Question

## Related Questions

- Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
- Math (Proof) - Prove that if ab = ac (mod n) and a is relatively prime to n, ...
- Discrete Math - Let a, b, c, and d be integers, and let n be a positive integer...
- math - A certain football league has the following scoring system: - each field ...
- Math (Complex Numbers) - Let N be the sum of all prime powers that can be ...
- MATH - Let’s agree to say that a positive integer is prime-like if it is not ...
- math - Let’s agree to say that a positive integer is prime-like if it is not ...
- discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
- Proofs and numbers - Solve the congruence 24x identical to 42 (mod 30) for x. ...
- A number thoery question - Please help me! Thank you very much. Prove Fermat's ...