Monday, January 22, 2018

elementary number theory - CRT + Fermat's Little Theorem

I am seeking a proof for the following...


Suppose p and q are distinct primes. Show that pq1+qp11(mod pq) I gather from Fermat's Little Theorem the following: qp11(mod p)


and


pq11(mod q)


How can I use this knowledge to give a proof? I'm confident I can combine this with the Chinese Remainder Theorem, but I am stuck from here.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...