Proofs and numbers
posted by yin .
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
Respond to this Question
Similar Questions

A number thoery question
Please help me! Thank you very much. Prove Fermat's Last theorem for n=3 : X^3 + Y^3 = Z^3 where X, Y, Z are rational integers, then X, Y, or Z is 0. Hint: * Show that if X^3 + Y^3 = Epsilon* Z^3, where X, Y, Z are quadratic integers … 
Discrete Math
Let a, b, c, and d be integers, and let n be a positive integer. Prove that if a is congruent to c mod n and b is congruent to d mod n, then (ab) is congruent to (cd) mod n 
math
Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7 … 
Math
Which Statements of congruence are true and which are false and why? 
math
Which Statements of congruence are true and which are false and why? 
Math
Which Statements of congruence are true and which are false and why? 
Proofs and numbers
Solve the congruence 24x identical to 42 (mod 30) for x. List all the solutions (if there are any). 
Math (Proof)
Prove that if ab = ac (mod n) and a is relatively prime to n, then b = c (mod n). Proof: a and n are relatively prime and from ab = ac(mod n), we have n(abac), so na(bc). Since (a,n)=1 (relatively prime), we get n(bc). hence … 
Math
Find all numbers $r$ for which the system of congruences: x == r mod 6 x == 9 mod 20 x == 4 mod 45 has a solution. 
matlab
Im trying to figure out how to write a program that finds prime factors of a number. I have the following but it only works for the number 12 for some reason. % this program will determine if an integer is prime and determine % its …