Jump to content

Williams's p + 1 algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 66.122.63.192 (talk) at 19:32, 20 May 2005 (new page created to fulfill link on Integer_Factorization). 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)

An Integer Factorization algorithm invented by H.C. Williams that works well if the number N to be factored contains one or more prime factors p such that p+1 is smooth, i.e. p+1 contains only small factors. Uses Lucas Sequences.

Analogous to [[Pollard's p-1 algorithm].

See H.C. Williams, A p+1 method of factoring, Math. Comp., 39, 225-234 (1982)