New Reply

Prime congruence problem

 
Share Thread Thread Tools
Nov18-10, 10:05 PM   #1
 

Prime congruence problem


Question: Suppose p and q are distinct primes. Show that p^(q-1) + q^(p-1) is congruent to 1 modulo pq.

Answer: I know from Little Fermat Theorem that p^(q-1) is congruent to 1 modulo q and q^(p-1) is congruent to 1 modulo p, but I have no idea how to combine these two.
PhysOrg.com
PhysOrg
science news on PhysOrg.com

>> Ants and carnivorous plants conspire for mutualistic feeding
>> Forecast for Titan: Wild weather could be ahead
>> Researchers stitch defects into the world's thinnest semiconductor
Nov18-10, 11:52 PM   #2
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
You know from the CRT that there is only one residue class mod pq that gives you A mod p and B mod q. So if 1 mod pq gives 1 mod p and 1 mod q, then you're done.
New Reply
Thread Tools


Similar Threads for: Prime congruence problem
Thread Forum Replies
Prime congruence series formula Linear & Abstract Algebra 9
Congruence problem. Precalculus Mathematics Homework 10
Divisibility and Congruence problem Linear & Abstract Algebra 3
Congruence problem Calculus & Beyond Homework 6
congruence problem Linear & Abstract Algebra 19