|
2019-01-23, 07:31
|
#1 |
Dec 2011
After 1.58M nines:)
2×33×31 Posts |
Generalized Fermat sieva , TF, or P-1
https://primes.utm.edu/top20/page.php?id=12
I was refer to numbers you can find in link above. Tell me is any other "special tool" for those class of numbers: or I can use any "ordinary" programs already written, for TF and P-1 ( especially P-1) I can use Prime95, and there is sievaless for this kind of numbers ( and I know for that) Any other tool? Can I adjust mfacto ili something like that for searching factors? Thanks for answer Last fiddled with by pepi37 on 2019-01-23 at 07:52 |
|
|
|
2019-01-23, 08:40
|
#2 |
|
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
33×227 Posts |
I would suggest checking the already found primes for credited programs. GFNSvCUDA and AthGFNSv are worth trying.
|
|
|
|
|
2019-01-23, 12:26
|
#3 | |
|
Dec 2011
After 1.58M nines:)
2·33·31 Posts |
Quote:
|
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| New Generalized Fermat factors | Batalov | Factoring | 149 | 2017-02-20 12:06 |
| Generalized Fermat numbers (in our case primes) | pepi37 | Conjectures 'R Us | 4 | 2015-10-09 14:49 |
| Generalized Fermat factors - why? | siegert81 | Factoring | 1 | 2011-09-05 23:00 |
| Generalized Fermat Numbers | ET_ | Programming | 4 | 2008-06-23 07:59 |
| Generalized Fermat Prime Search? | pacionet | Lounge | 3 | 2006-01-25 15:40 |
