Jump to content

Talk:Dixon's factorization method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fsswsb~enwiki (talk | contribs) at 20:43, 24 March 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Comment

I cannot see a real difference to the Quadratic Sieve, but thar does not really matter.

Question

I didn't understand this sentence: "This set of primes is called the factor base. Then, using the polynomial p(x) = x2 − n, many values of x are tested to see if p(x) factors completely over the factor base."

What is x? What is n? What does it mean to factor "over the factor base"?