View Full Version : Count down to 999...
... for the number of k/n pairs at k=67607 and 9m < n< 10m
1143439251189941 | 67607*2^9009131+1
1 gone, 31 to go
459030938766785899 | 67607*2^9036611+1
2 gone, 30 to go
nuri what bounds are you using?? Also are you keeping your stage1 file???
Originally posted by vjs
nuri what bounds are you using??
B1=255000 B2= 4080000 I thought something around this would be sufficient, togeter with 3-4 factors from sieving up to 2^50.
Originally posted by vjs
Also are you keeping your stage1 file???
yes, but only after somewhere around 9040000. I was out of town for a month or so, and could not change before that.. ;)
Opps, may be I've set it wrong.. :blush:
Could you please confirm how to generate the save files? thx.
You are using prime95, right? The way I know is:
You use the line
Pminus1=k,2,n,1,B1,B1
Let it compute, take the save file of Stage1, store it somewhere else, run the line
Pminus1=k,2,n,1,B1,B2
and get the savefile of Stage2. If you only want the latter, you run the last line only.
So, I have still the Stage1-savefiles of the largest prime factoring effort, I'm back home and have enough mem, so I will run them now.
Yours H.
I see.... thx.
So, I need to manually do that stuff. I thought there was a way to do it through inserting some stuff to prime.ini etc... :blush: I guess that's why I couldn't do it..
On second though, may be I should change he strategy of attack...
Is this possible?
1- Run all k/n pairs with, say B1=100000 and keep the save files
Question: If I do that, will I have to store the save files somewhere else after each test, or can I just continue without manual intervention?
2a- Rerun the pairs with, say B1=200000 and keep the save files
Question: Will 1 + 2a take the same time as running at B1=200000 at once, or will it take longer?
2b- Rerun the pairs with, say B2=1000000 and keep the save files
Question: Will I be able to rerun k/n pairs with, say B1=200000 or B2=2000000, etc after that, without additional burden w.r.t. running B2=2000000 at the very beginning?
In short, what I have in mind is, if possible, first sweep through all pairs with smaller bounds, and increase the bounds gradually if there is not sufficient number of factors found, and repeat the process for the third time ect. up until all remaining 30 factors are found. This is feasible, of course, only if it is possible to build up on the save files more than once.
Let's try it out. (Though I don't think it works...) H.
It looks like it is possible to do it, with minimal additional CPU time cost. I'll report if I was mistaken and that's not the case.
I decided to do the first run with B1=100000 and B2=1000000, starting at n=9046211.
For lower n, I had B1=255000 and B2=4080000 and unfortunately no save files.
Nuri,
I wouldn't bother doing a stage1 then a larger stage1 etc. Just go with the largest stage1 you think it will require to get enough factors with say B2=10*B1.
If you don't get enough factors you could then try a larger B2 b2=20*B1.
I believe that if you simply run using Pminus1= you do get a temp file z**** or something like that. IF you finish a b1, b2=10*b1 and what to do a second b2 run the command is something like B2'-B2 where B2 is from the first run.
Example
Pminus1=....,1,B1,B2
Pminus1=....,1,B1,B2'-B2
Himmm, I didn't know the B2'-B2 stuff, thx.
I'm pretty sure it works for Prime95, it certainly does for ECM6.0 Give it a try for one test first.
I'm just thinking about another option, What about 15M<n<16M I think that range only has something like 1046 factors. Also it hasn't been touched by P-1 yet. Might be faster to bring that one below 1000. ALso we could declare all k=67947?? reserved for that range now? just a thought.
ANother point is that the 9M<n<10M range has actually been tested once already. Project wise it makes more sence to do the higher one.
Yeah, I know that... It does not make any sense project wise. Think of it as a kind of obsession... :p
Yup that's sort of what I figured in the first place. Remember there is also ecm but of course I'd do P-1 with fairly high bounds first.
I'd assume that all 15-digit factors have been found for these numbers p=1T (We are pratically there already)
So if you did want to run ecm it seems reasonable to start at no less than 20 and probably more likely 25 or B1 somewhere inbetween 25-30. I think this would depend more on the memory requirements for stage2.
digit B1 Curves
20 digits 11K 90
25 digits 50K 240
30 digits 250K 500
That seems like alot of curves... and certainly alot of work. Looking at ??Greenbanks?? page will give you some idea of how many factors you can expect to find with B1,B2 values. It seems like the optimal B1:B2 ratio was somewhere around 12 to 14. Also remember your only getting an additional 50% of the factors for doubleing the amount of work for any B1:B2 ratio.
Example
Case 1
B1=50K
B2=700K
Number of factors found X
Time required T
Case 2
B1=200K
B2= 2800K
Number of factors found 2X
Time required 4T
P-1 found a factor in stage #2, B1=100000, B2=1000000.
67607*2^9063851+1 has a factor: 3726912393954779
3 gone, 29 to go
Not bad you might want to start with a few of these first and see what happens
9110000 9150000 [passed by]
9209000 9350000 [passed by]
9380000 9400000 ? ? [passed by]
9680000 9700000 ? ? [passed by]
Thx for the idea vjs... I've also thought of running the untouched ranges first, but when I realized that running them only would not be sufficient to achieve the goal, I decided on a sweep all approach. This would also decrease the burden of keeping track of what I've done and what's next etc.
I've allocated two machines to the project.
One is a PC which is relatively faster on Stage 2, and the other one is a lap top which is relatively faster at Stage 1.
For B1=100000, B2=1000000
- PC finishes Stage 1 at around 11000 sec, whereas the laptop achieves 5500 sec
- PC finishes stage 2 at around 8500 sec, whereas the laptop has to spend 22000 sec.
So, no Stage 2 work at the laptop and minimal Stage 1 work at PC (only for the laptop top prepare enough Stage 1 save files to feed the PC).
Current work queues and thereafter.
- PC crunches B1=100000, B2=1000000 stuff for 9045000-9100000 (9000000-9045000 was already done with larger bounds with no save file, and I do not intend to go back there unless I can not drop below 1000 after a couple of sweep throughs for the remaining ranges). After 9100000, the PC will take over Stage 1 finished tests from the laptop in 100k chunks.
- Laptop crunches B1=B2=100000 for 9100000-10000000, which then will be fed to the PC queue in 100k chunks.
I have to spend some time on ETA of these queues to decide on what to do next.
It looks like, when the laptop finishes it's B1=100000 queue, it will get the save flies of the PC for B1=100000, B2=1000000 and crunch them to B1=200000, B2=1000000, and then pass them to the PC for B1=200000, B2=2000000, etc.
There will be a time when the PC will not be able to keep up with the laptop. As I mentioned above, I have to spend some time on ETA of the queues to decide the details of the action plan.
Nuri I was curious if you finished this sieve range???
860000-862000 Nuri (with 991-50M dat)
I guess you already though about the holes in reservations...
I guess I did... I was out of town for a couple of weeks and could not find the time to cross check reservations and sending finished ranges to factrange etc.
WEll if it's possible to doublecheck or send the factors again to factrange that would be cool in the mean time I'll mark it as complete.
Jason
I'll do so as soon as I visit my friend whose PC did the other half of that range.
MikeH
10-10-2005, 12:31 PM
Especially for the single k specialists I have created a set of pages like the all users page (http://www.aooq73.dsl.pipex.com/2005/ui/19999.htm), but for individual k.
k=4847 is http://www.aooq73.dsl.pipex.com/2005/ui/19998.htm
k=5359 is http://www.aooq73.dsl.pipex.com/2005/ui/19997.htm (http://www.aooq73.dsl.pipex.com/2005/ui/19998.htm) (prime, so not much this year!)
...
k=67607 is http://www.aooq73.dsl.pipex.com/2005/ui/19987.htm
Enjoy ;)
I like it Mike :D
The more info we have on factors for k's etc the more interesting it is.
I'm supprised by the limited numbers of factors for secondpass w.r.t. 67607.
I guess that k and 19249 are pretty light however...
Good work.
67607*2^9175347+1 has a factor: 398193466655495081803
398193466655495081803 | 67607*2^9175347+1
4 gone, 28 to go
P-1 found a factor in stage #1, B1=100000.
67607*2^9445707+1 has a factor: 2609790718264729
2609790718264729 | 67607*2^9445707+1
5 gone, 27 to go
P-1 found a factor in stage #1, B1=100000.
67607*2^9528651+1 has a factor: 49713463448254842283
49713463448254842283 | 67607*2^9528651+1
6 gone, 26 to go
P-1 found a factor in stage #1, B1=100000.
67607*2^9541251+1 has a factor: 74908262920873179613
74908262920873179613 | 67607*2^9541251+1
7 gone, 25 to go
P-1 found a factor in stage #1, B1=100000.
67607*2^9697707+1 has a factor: 110710470704730133
110710470704730133 | 67607*2^9697707+1
8 gone, 24 to go
Finally, a contribution from the sieve...
872.252T 67607 9426731 8.723 Fri 18-Nov-2005 145333.400 (1) minbari
9 gone, 23 to go
P-1 found a factor in stage #2, B1=100000, B2=1000000.
67607*2^9485451+1 has a factor: 76453102778865746489
76453102778865746489 | 67607*2^9485451+1
10 gone, 22 to go
P-1 found a factor in stage #2, B1=100000, B2=1000000.
67607*2^9504971+1 has a factor: 149184001413027233
149184001413027233 | 67607*2^9504971+1
11 gone, 21 to go
P-1 found a factor in stage #1, B1=100000.
67607*2^9835371+1 has a factor: 933294164025961
933294164025961 | 67607*2^9835371+1
1 of 1 verified in 0.03 secs.
0 of the results were new results and saved to the database.
This factor lies within Keroberts1's sieving range. I guess he's recently found and sumbitted it as well. I can not check it right now, as Mike's pages are currently offline.
Anyways, if so that would be the second contribution from the sieve and most importantly...
12 gone, 20 to go ;)
Himmm, it was found by garo on September 3rd. (http://www.aooq73.dsl.pipex.com/2005/ui/2772.htm). It's strange that this k/n pair was left in the queue.
285.072P 22699 9835390 296847.911 Sat 03-Sep-2005 2
3748.840T 10223 9823517 295280.835 Sat 03-Sep-2005 2
933.294T 67607 9835371 282130.517 Sat 03-Sep-2005 2
So, it's still 11 gone, 21 to go.. :(
Greenbank
11-24-2005, 05:36 AM
Just make sure you have the latest results.txt file
http://www.seventeenorbust.com/sieve/results.txt.bz2
I guess that single k/n pair simply slipped away during the first few weeks when I was out of town.
As what I'm focused on is the whole million range for a single k, thus it is possible to check whats going on thrgouh time.
At the beginning, I created the ini file and checked number of k/n pairs with the figure in Mike's page, they were the same.
And I kept checking for changes in remaining number of k/n pairs regularly so that it would be possible to track any new factors (as the 872.252T 67607 9426731 factor from minbari).
The problem, I suppose, is that I did not notice the single new factor when (or as) I was out of town within the first couple of weeks.
And, of course, I'll recreate the worktodo.ini with the latest results.txt file once I start the second tour (i.e., B1=200k etc.) within a week or so.
Greenbank
11-24-2005, 09:11 AM
Sure, not being around makes it kind of difficult :-)
This is where a network aware factorer (be it P-1 or ECM) would be useful. It would:
1) Allow you to reserve specific k,n pairs.
2) Provide progress updates to the server. You could then install it on various machines and use the server's website to see the progress of all of your machines.
3) When providing an update (say every 30 minutes) the server could say "Don't bother, just got a factor for it."
4) The server would keep a record of the B1/B2 bounds (for P-1) and B1/B2/#curves for ECM. This prevents duplicate work (for P-1) and also helps determine digit-level testing for ECM. If large storage is available then P-1 save files could even be stored for future bound extension.
And even better:-
5) It would allow you to point the client at the server (with no specific range assigned) and be given some work to do, a la PRP client.
However, as mentioned in the Sieving forum regarding a networked sieve client, the hard part is not having this idea. It's actually coding it, integrating it with the current site and actually finishing it to such a level that you are confident that there aren't any problems. (Even finishing it is difficult, so many projects like this start out with good intentions but then die a slow death).
I suppose the easiest start would be using the ecm server like elevensmooth...
pROBLEM is ecm6.0 isn't net ready if I recall and it's still not as good as prime95.
Perhaps it would be possible to use the code from ecm-client to obtain pairs and a script or something to run prime 95 on the numbers. We could easily setup the co-ordination to have the net client do one particular k or reserve ranges for it etc...
As in the above post all good intentions the only problem is the implementation.
Currently it's just as easy to reserve well in advance. IF your not going to be albe to touch a machine for a year... reserve 12M-12.1M and let it rip.
Greenbank
11-24-2005, 01:23 PM
The wrapper is exactly what I was thinking. However, I've got enough on my plate at the moment and I don't want to be distracted. :-)
Second contribution from the sieve... by dudlio
957.925T 67607 9106587 9.579 Sat 03-Dec-2005 148951.255 (1) dudlio
12 gone, 20 to go
P-1 found a factor in stage #2, B1=100000, B2=200000.
67607*2^9978507+1 has a factor: 213405559922726473
213405559922726473 | 67607*2^9978507+1
Himmm, this is the second k/n pair that simply slipped away during the first few weeks when I was out of town... :( First one was found on Sep 3rd and this one on Sep 20th.
I'll soon start the second pass (B1=200000, B2=2000000 stuff), for which I'll have to recreate the worktodo ini with the latest results file. Hope the same doesn't happen this round, as it becomes somewhat frustrating to see no progress despite a factor found. ;)
P-1 found a factor in stage #2, B1=100000, B2=1000000.
67607*2^9642771+1 has a factor: 13603274097427033
13603274097427033 | 67607*2^9642771+1
13 gone, 19 to go
Yuppiiieeeeee!!! Third contribution from the sieve.
965.674T 67607 9637811 9.657 Thu 15-Dec-2005 168185.468 (1) pixl97
14 gone, 18 to go
P-1 found a factor in stage #2, B1=100000, B2=1000000.
67607*2^9744147+1 has a factor: 1471452968028851
1471452968028851 | 67607*2^9744147+1
15 gone, 17 to go
So Nuri have you decide if your going to increase B1 or just B2 for a secondpass?
Yeah, I decided to skip 200k, 2m and go directly to 300k, 3m.
I think that will be sufficient... but if not, I'll increase only B2 from there on.
Finally, a factor after a month long drought..
P-1 found a factor in stage #1, B1=400000.
67607*2^9258651+1 has a factor: 52384027688192778661
52384027688192778661 | 67607*2^9258651+1
16 gone, 16 to go
Fourth contribution from the sieve...
1007.538T 67607 9587291 10.075 Mon 06-Feb-2006 173641.856 (1) sslazak
17 gone, 15 to go
P-1 found a factor in stage #2, B1=300000, B2=6000000.
67607*2^9072171+1 has a factor: 1807406899979743
1807406899979743 | 67607*2^9072171+1
18 gone, 14 to go
Fifth contribution from the sieve... which is really cool, as it gets harder and harder to add up even a single factor at the current P-1 levels
1099.237T 67607 9150867 10.992 Tue 21-Feb-2006 172590.575 (1) engracio
19 gone, 13 to go
P-1 found a factor in stage #2, B1=300000, B2=6000000.
67607*2^9823131+1 has a factor: 3977185318859202049
3977185318859202049 | 67607*2^9823131+1
20 gone, 12 to go
Looking good Nuri, congrats!!! Do you think you will bring the level below 1000 before we find a prime? I believe you will.
Thx.. :)
My guess is that it will take at least a year more to reach there... not to mention, of course, that my hopes are for an earlier meltdown.
Sixth contribution from the sieve..... :thumbs:
1021.060T 67607 9393611 10.211 Mon 20-Mar-2006 168934.279 (1) mattford
21 gone 11 to go.
oooh, that's me, what did I do?!
Is this a coincidence, or do they come in pairs... ;)
P-1 found a factor in stage #2, B1=300000, B2=6000000.
67607*2^9851931+1 has a factor: 7509426046902223253
7509426046902223253 | 67607*2^9851931+1
22 gone, 10 to go...
How is this going Nuri, it looks like your close to the end of B1=300K with B2=20xB1. It also looks like you decided to increase B1 to 400K?
Not suggesting you do it but...
7509426046902223253 | 67607*2^9851931+1
via p+1
7509426046902223254 = 2 x 3 ^ 2 x 829 x 8539 x 195967 x 300739
I was out for a few days...
In fact, I'm using 300k for roughly half and 400k for the other half.
Seventh contribution from the sieve...
1042.466T 67607 9931571 10.425 Fri 28-Apr-2006 192796.487 (1) Greenbank
23 gone, 9 to go
What can I expect more... :)
1067.039T 67607 9729531 10.670 Mon 22-May-2006 189393.570 (1) KAMCOBILL
24 gone, 8 to go
P-1 found a factor in stage #2, B1=400000, B2=8000000.
67607*2^9707211+1 has a factor: 1745051805561952501
1745051805561952501 | 67607*2^9707211+1
25 gone, 7 to go
P-1 found a factor in stage #2, B1=800000, B2=8000000.
67607*2^9352691+1 has a factor: 698019018033988923809
698019018033988923809 | 67607*2^9352691+1
26 gone, 6 to go... :rock:
P-1 found a factor in stage #2, B1=400000, B2=8000000.
67607*2^9724211+1 has a factor: 86470417672035953
86470417672035953 | 67607*2^9724211+1
27 gone, 5 to go :banana:
WOW Nuri excellent success as of late.
5 to go perhaps one more from the sieve???
Noticed you had to extend B1.
Yes, for some trial ranges.
Current targets are as follows:
#test Low n High n B1 B2 Status/ETA
49 9,000,000 9,045,000 255,000 4,080,000 done
27 9,045,000 9,070,000 300,000 9,000,000 done
77 9,070,000 9,150,000 300,000 6,000,000 done
49 9,150,000 9,200,000 400,000 8,000,000 17-06-06
47 9,200,000 9,250,000 400,000 6,400,000 29-09-06
49 9,250,000 9,300,000 400,000 8,000,000 30-06-06
59 9,300,000 9,350,000 400,000 8,000,000 5-07-06
33 9,350,000 9,380,000 800,000 8,000,000 21-06-06
307 9,380,000 9,675,000 400,000 8,000,000 17-11-06
19 9,675,000 9,700,000 400,000 8,000,000 25-07-06
36 9,700,000 9,735,000 400,000 8,000,000 done
10 9,735,000 9,750,000 400,000 9,000,000 22-06-06
50 9,750,000 9,801,000 300,000 9,000,000 done
195 9,801,000 10,000,000 300,000 6,000,000 1-08-06
With some luck (hopefully) I might not need to do them all.. :)
P-1 found a factor in stage #2, B1=800000, B2=8000000.
67607*2^9377091+1 has a factor: 3482992619384851
3482992619384851 | 67607*2^9377091+1
28 gone, 4 to go :harhar:
P-1 found a factor in stage #1, B1=300000.
67607*2^9956547+1 has a factor: 666451926865345567
666451926865345567 | 67607*2^9956547+1
29 gone, 3 to go :|party|:
Are you not afraid of loosing the sense of your live, your existence, when this challenge is over? What will you do next? H.
Hahahaaa, good point... :thumbs:
Still, it's not a that important task of my life anyway.
On the second question...
I'll probably spend some time on P-1 or old friend, sieving..
On the other hand, there's still eight more challanges between 1m and 9m on 67607... :rotfl:
The other question will you be :swear: if someone else submits the last one???
Haha... good point
May be, I should wait and submit last three together, hehe...
Kidding aside, no problem at all.
BTW, I decided to finish up remaining tests with lower bounds once I (hopefully) reach 999. Tests left;
B1= 300000, B2= 6m, 40 tests
B1= 400000, B2= 8m, 15 tests
B1= done to 400000, B2= 6400000, 32 tests
B1= done to 400000, B2= 8000000, 332 tests
Overall ETA: End of August.
1073.001T 67607 9169091 10.730 Fri 30-Jun-2006 169142.951 (1) mattford
So nuri to you have those other two hidding in the wings???
Let the challenge begin!!!
P-1 found a factor in stage #2, B1=400000, B2=8000000.
67607*2^9404171+1 has a factor: 87946211490252721
87946211490252721 | 67607*2^9404171+1
31 gone, 1 to go......
wow Nuri congrats, one to go. Did you think you would ever finish this?
Whta do you think you are going to do next.
Regular P-1
Sieve
15M<n16M for the same number?
Something else entirely?
[cheer]SIE-VING P-S-P SIE-VING P-S-P[\cheer]
Help us build a world where no P-1 is needed.
No, jokes aside, do what ever pleases you most. You seemed to have so much fun on your electricity-wasting quest, that it perhaps wasn't a waste after all.
Yours H.
wow Nuri congrats, one to go. Did you think you would ever finish this?
Whta do you think you are going to do next.
Thanks... to be hones, I never doubted.. :)
I'll probably run regular P-1 for a while, adding machines as they become available from this task.
[cheer]SIE-VING P-S-P SIE-VING P-S-P[\cheer]
Help us build a world where no P-1 is needed.
No, jokes aside, do what ever pleases you most. You seemed to have so much fun on your electricity-wasting quest, that it perhaps wasn't a waste after all.
Yours H.
Sieving PSP seems to be a valid alternative. Still, I'll stick to P-1 for the short term.
Mission accomplished...
P-1 found a factor in stage #2, B1=400000, B2=8000000.
67607*2^9345411+1 has a factor: 1929788594518471
1929788594518471 | 67607*2^9345411+1
Joe O
07-17-2006, 08:35 AM
Mission accomplished...
P-1 found a factor in stage #2, B1=400000, B2=8000000.
67607*2^9345411+1 has a factor: 1929788594518471
1929788594518471 | 67607*2^9345411+1
Congratulations!
Again congrats Nuri, looks like you simply extended B2 a relatively small factor compared to the others but quite the accomplishment.
Looks like you went over to normal P-1... were you going to rejoin some of the sieve fold???
Thanks.. Well, in fact I have not done it yet. I'll be moving to amsterdam within the next couple of months, so things are a bit hectic over here...
Powered by vBulletin® Version 4.2.4 Copyright © 2024 vBulletin Solutions, Inc. All rights reserved.