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

- 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 - Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 ...
- Proofs and numbers - Solve the congruence 24x identical to 42 (mod 30) for x. ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- math - Which Statements of congruence are true and which are false and why? 177 ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- Math - Find all numbers $r$ for which the system of congruences: x == r mod 6 x...
- A number thoery question - Please help me! Thank you very much. Prove Fermat's ...
- matlab - Im trying to figure out how to write a program that finds prime factors...

More Related Questions