User:Vinkmar

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by 207.134.56.151 (talk) at 20:41, 18 March 2007 (m363a4q7). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

m363a4q7

pq1+qp11(modpq)

But p and q are distinct primes, so for the above to be valid, the following two equations must hold:

pq1+qp11(modp) and pq1+qp11(modq)

Considering only the first of the two equations (the latter case is, for lack of a better term, symmetrical), we have:

pq10(modp) and qp11(modp).

The former is obviously true. The latter is proven using Fermat's Little Theorem, QED