![]() |
![]() |
#1 |
"Jason Goatcher"
Mar 2005
3×7×167 Posts |
![]()
Obviously, sieving for Mersenne numbers works great, but what about the more general equation? Is anyone working on that? Is it even worth it for a programmer to bother?
|
![]() |
![]() |
![]() |
#2 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
37×163 Posts |
![]()
Look in the prime search projects section of the forum. Lots of them search this form.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Purpose Built rig? | pool party | GPU Computing | 37 | 2017-06-01 04:16 |
General factoring algorithms not using sieving | mickfrancis | Factoring | 21 | 2016-02-22 19:38 |
S9 and general sieving discussion | Lennart | Conjectures 'R Us | 31 | 2014-09-14 15:14 |
Simplest general purpose CPU? | nibble4bits | Puzzles | 8 | 2008-06-05 11:32 |
Purpose of p-1 factoring | drew | Marin's Mersenne-aries | 2 | 2005-06-29 15:00 |