Jump to content

Talk:Pollard's p − 1 algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 63.214.2.66 (talk) at 01:31, 22 October 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

a^(p-1) = 1 mod (p) for a in U*(Z/nZ) is meaningless and is not the correct statement of fermat's little theorem.

I don't think you really understand the meaning of the notation. For starters mod is an equivalence relation on Z and

a^(p-1) = 1 mod (p) means

[a^(p-1) -1] / p = 0

But when you say that a is in U*(Z/nZ) then what does it mean to divide an element of U*(Z/nZ) by the integer p?

Fermat's little theorem does say that for all a!

a^(p-1) = 1 mod (p)

I don't know what you're trying to say ,but it's not fermat's little theorem and it's mathematically ungramatical.