![]() |
![]() |
#1 |
May 2003
12316 Posts |
![]()
While I'm on the topic, is anybody else working on any of Paschal Ochem's 500 digit roadblocks? If not, then I'll be willing to go ahead and finish them off. If anybody else is interested, just let me know and we can divide and conquer.
|
![]() |
![]() |
![]() |
#2 |
Sep 2008
Kansas
25·7·17 Posts |
![]()
I am no longer working in the t500.txt file.
I have several queued up to be worked from "A list of the most difficult composites for the proof of N > 10^2000."
Code:
9059 47 106105986521... 9157 47 157403461913... 7541 53 423021573075... 7549 53 447000133868... 9649 47 193299667109... 9677 47 220860967177... |
![]() |
![]() |
![]() |
#3 |
May 2003
3×97 Posts |
![]()
That's cool,Rich. Have you worked on anything in the t500 file since October?
|
![]() |
![]() |
![]() |
#4 |
Sep 2008
Kansas
1110111000002 Posts |
![]()
I did a few last week or so which were posted in the Gratuitous OPN factors thread. That's been it for nearly a year, I would guess.
Check FDB before working any number. I always post my results there first. |
![]() |
![]() |
![]() |
#5 |
I moo ablest echo power!
May 2013
22×463 Posts |
![]()
Is there any way to tell (or an assumption that can be made) how much ECM work has been done on a composite in the roadblock list? Don't want to waste a bunch of time doing ECM that's already been covered thoroughly.
|
![]() |
![]() |
![]() |
#6 |
Apr 2006
1528 Posts |
![]()
I do not keep track of the ECM work done. We can safely assume that the 37755 composites in t1600 have not been ECMed to the 40 digit level. You can work on a bunch of them, e.g. between lines 6200 and 6700, and get some factors.
|
![]() |
![]() |
![]() |
#7 |
I moo ablest echo power!
May 2013
22×463 Posts |
![]()
Thanks Pascal!
|
![]() |
![]() |
![]() |
#8 |
Sep 2008
Kansas
25·7·17 Posts |
![]()
Taking two more from "A list of the most difficult ..."
Code:
10597 46 14403099607... 13009 42 62846017262... |
![]() |
![]() |
![]() |
#9 |
Sep 2008
Kansas
25·7·17 Posts |
![]()
I'll queue these up next.
Should keep me busy for a while. Code:
1702903 22 121949012462... 22907 36 90965084897105... 499500151 18 3746633656... 23203 36 14441348835314... 23773 36 34597277246805... 23911 36 42612477375697... 12059023 22 61498815720... 24181 36 63839755395122... 24197 36 65378180537538... |
![]() |
![]() |
![]() |
#10 |
Sep 2008
Kansas
25×7×17 Posts |
![]()
Grabbing a few more.
Code:
12953 42 524310894478546... 1395523 28 1128850090956... 17257 42 896535992125814... 17737 42 283786321699231... 17807 42 334839168720218... 17989 42 513238300421923... 18149 42 744453124528549... |
![]() |
![]() |
![]() |
#11 |
Sep 2008
Kansas
25·7·17 Posts |
![]()
In the coming weeks/months I will continue working on all the numbers below C200 in the list of most difficult numbers.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Passive Pascal | Xyzzy | GPU Computing | 1 | 2017-05-17 20:22 |
Tesla P100 — 5.4 DP TeraFLOPS — Pascal | Mark Rose | GPU Computing | 52 | 2016-07-02 12:11 |
Nvidia Pascal, a third of DP | firejuggler | GPU Computing | 12 | 2016-02-23 06:55 |
Calculating perfect numbers in Pascal | Elhueno | Homework Help | 5 | 2008-06-12 16:37 |
Factorization attempt to a c163 - a new Odd Perfect Number roadblock | jchein1 | Factoring | 30 | 2005-05-30 14:43 |