Tuesday
October 21, 2014

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

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Discrete Math - Theorem: For every integer n, if x and y are positive integers ...
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 ...
discrete math - If p is prime prove that p^1/2 (root p) is irrational. ...
math - Can someone help me with prime and composite numbers? Prime numbers are ...
math - Prove that a number 10^(3n+1) , where n is a positive integer, cannot be ...
Maths - Prove that a number 10^(3n+1) , where n is a positive integer, cannot be...

Search
Members