Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Quadratic sieve
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===One large prime=== If, after dividing by all the factors less than ''A'', the remaining part of the number (the cofactor) is less than ''A''<sup>2</sup>, then this cofactor must be prime. In effect, it can be added to the factor base, by sorting the list of relations into order by cofactor. If ''y''(''a'') = 7β 11β 23β 137 and ''y''(''b'') = 3β 5β 7β 137, then ''y''(''a'')''y''(''b'') = 3β 5β 7<sup>2</sup>β 11β 23β 137<sup>2</sup>. This works by reducing the threshold of entries in the sieving array above which a full factorization is performed.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)