Homework Help: Proofs and numbers

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

No one has answered this question yet.

Answer this Question

Related Questions

math - A certain football league has the following scoring system: - each field ...
discrete math - If p is prime prove that p^1/2 (root p) is irrational. ...
MATH - Let’s agree to say that a positive integer is prime-like if it is ...
math - Let’s agree to say that a positive integer is prime-like if it is ...
Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
Math - What are the positive integers between 1 and 100 that are only divisible ...
discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
IB HL Math - I need to that if there is better way to prove the following: I am ...
math - The Florida Lottery is made up of the numbers 1-49. My mother has ...
math - The Florida Lottery is made up of the numbers 1-49. My mother has ...

For Further Reading

First Name:
School Subject:
Answer: