![]() |
![]() |
#1 |
Mar 2019
USA
2E16 Posts |
![]()
I was clicking around the site and found the "Largest 100 Factors Found" page interesting:
https://www.gpu72.com/reports/largest_factors/ Is that up-to-date? If so, does it update automatically or is it something Chris updates manually? I only ask because the largest as of this writing is: 734277451864747167510502805298930545450478445879 I found a factor today of exponent 105032111: 499400852887245323683941126088449355702834653807158087 Unless of course, I am completely reading that wrong, which is entirely possible. It is all just so fascinating, and I have such a small grasp of it. |
![]() |
![]() |
![]() |
#2 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
2×3×1,567 Posts |
![]() Quote:
BTW, it's a complete fluke that I'm at the top of the list. There are many others putting in far more P-1 efforts than myself; I just got lucky there. |
|
![]() |
![]() |
![]() |
#3 | |
Sep 2002
Database er0rr
2·5·353 Posts |
![]() Quote:
Code:
? factor(499400852887245323683941126088449355702834653807158087 ) [ 290582744822559701357207 1] [1718618403140893608084889221841 1] Last fiddled with by paulunderwood on 2020-11-17 at 05:50 |
|
![]() |
![]() |
![]() |
#4 |
Romulan Interpreter
Jun 2011
Thailand
24·571 Posts |
![]()
Adding to it, that list only contains factors which are prime and were discovered for assignments taken with GPU-72 (if that's not understood).
To see a list with ever largest factors found, with the method used to find them, see mersenne.ca list. Last fiddled with by LaurV on 2020-11-17 at 09:45 Reason: s/lost/list/ geez man, fatty fingers! |
![]() |
![]() |
![]() |
#5 |
Mar 2019
USA
2×23 Posts |
![]()
Thanks so much for the responses. That is what I was expecting.
Me: See really long number, longer than the other numbers, think I'm onto something... Reality: Nah. Not really. |
![]() |
![]() |
![]() |
#6 |
Feb 2008
Bray, Ireland
2×3×19 Posts |
![]()
Wow, those bit levels are way higher than anything that can be (reasonably) done on TF. Those top factors are all from P-1?
Last fiddled with by ZFR on 2020-11-24 at 15:28 |
![]() |
![]() |
![]() |
#7 |
If I May
"Chris Halsall"
Sep 2002
Barbados
2×3×1,567 Posts |
![]() |
![]() |
![]() |
![]() |
#8 |
Feb 2008
Bray, Ireland
2·3·19 Posts |
![]()
And unlike TF, P-1 is better done on CPU than GPU, right?
So if I want to devote one of my CPU workers to P-1 instead of PRPs, I can just get a list from GPU72, copy it under that worker in mprime's worktodo, and that's it? B1 and B2 will be chosen automatically by mprime? |
![]() |
![]() |
![]() |
#9 |
If I May
"Chris Halsall"
Sep 2002
Barbados
2·3·1,567 Posts |
![]()
There's some excellent GPU P-1 software available now. But Prime95/mprime (CPU) is by far the easiest to work with.
Contemporaneous P-1 work is available from both Primenet and GPU72. Know that GPU72 is currently working at higher ranges (105M) than Primenet (101M) for P-1 assignments. And so the work takes slightly more compute (and, thus, time). Last fiddled with by chalsall on 2020-11-24 at 20:30 Reason: s/Contemerious/Contemporaneous/; # Smelling mistake. |
![]() |
![]() |
![]() |
#10 |
Feb 2008
Bray, Ireland
1628 Posts |
![]()
Thanks. Going to grab some from GPU72 when the next PRP finishes next week. Let's see if I can get my name on that top 100 page.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Largest k*2^n-1 Primes Found In 2019 | Thomas11 | Riesel Prime Search | 2 | 2020-01-01 05:32 |
Largest k*2^n-1 Primes Found In 2015 | Kosmaj | Riesel Prime Search | 0 | 2016-01-01 13:45 |
Largest k*2^n-1 Primes Found in 2013 | Kosmaj | Riesel Prime Search | 3 | 2014-12-12 07:14 |
formula for largest prime found | debasish | Miscellaneous Math | 20 | 2007-09-28 03:48 |
Largest prime found yet by 15k search | TTn | 15k Search | 1 | 2004-05-11 03:04 |