mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > Octoproth Search

 
 
Thread Tools
Old 2005-12-31, 19:00   #122
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29×41 Posts
Default

Quote:
Originally Posted by fetofs
Is there some way to resume the sieve using octo?
just start where you left of.

If you start with:

octo_fast 50 1 1000000000

and ctrl-c at 667000000, the resume with:

octo_fast 50 667000000 1000000000

Quote:
Originally Posted by fetofs
BTW, what are those octo_deep and octo_fast you're talking about? I only saw one executable, octo.exe!?
Look for a download somewhere in this thread
smh is offline  
Old 2005-12-31, 19:08   #123
fetofs
 
fetofs's Avatar
 
Aug 2005
Brazil

36210 Posts
Default

Oops... I found out there were a lot of posts in the middle of page 1 that I skipped. Thans for the answer
fetofs is offline  
Old 2005-12-31, 20:00   #124
fetofs
 
fetofs's Avatar
 
Aug 2005
Brazil

2×181 Posts
Default

Quote:
Originally Posted by fetofs
Oops... I found out there were a lot of posts in the middle of page 1 that I skipped. Thans for the answer
Testing the program gave to me no octoproths for n=143 up to k=300000000045. Will work more on it.
fetofs is offline  
Old 2006-01-01, 00:09   #125
TTn
 

25×71 Posts
Default reservation

Is this the main place to reserve octo ranges?

I want to keep a current status at my web site, and a link to the ongoing progress. www.15k.us

Thanks again to Robert Smith for observing them!
 
Old 2006-01-01, 11:02   #126
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

22458 Posts
Default

Quote:
Originally Posted by fetofs
Testing the program gave to me no octoproths for n=143 up to k=300000000045. Will work more on it.
I've found an octoproth for N=143. 9334074009855

And i have done more work on all N<151

Last fiddled with by smh on 2006-01-01 at 11:03
smh is offline  
Old 2006-01-01, 13:48   #127
fetofs
 
fetofs's Avatar
 
Aug 2005
Brazil

2·181 Posts
Default

Quote:
Originally Posted by smh
I've found an octoproth for N=143. 9334074009855

And i have done more work on all N<151
We really need a reservation system... I don't know where to start for all n<151, or should I work on n>151? Are n>151 already done to certain amount?
fetofs is offline  
Old 2006-01-01, 17:12   #128
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

100101001012 Posts
Default

Quote:
Originally Posted by fetofs
We really need a reservation system... I don't know where to start for all n<151, or should I work on n>151? Are n>151 already done to certain amount?
I'm still working on all N < 151 (just found the first octoproth for 135).

Above 150 not much work has been done. See Dougy's last attachement.

TTn, it would be great if you can keep the current status online at your site.
smh is offline  
Old 2006-01-01, 17:36   #129
fetofs
 
fetofs's Avatar
 
Aug 2005
Brazil

2×181 Posts
Default

Quote:
Originally Posted by smh
I'm still working on all N < 151 (just found the first octoproth for 135).

Above 150 not much work has been done. See Dougy's last attachement.

TTn, it would be great if you can keep the current status online at your site.
So I'll reserve n=151 and n=202 (see the weight!)
fetofs is offline  
Old 2006-01-01, 23:13   #130
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

350710 Posts
Default

Can someone explain to me how to use the octo sieving program? The only thing I can figure from what I've read is that you guys are psychic and read the programmers mind.

Edit: and then 30 seconds later the answer is found :oops:

If I'm reading the text file correctly, I'd like to reserve n=187

Last fiddled with by jasong on 2006-01-01 at 23:17
jasong is offline  
Old 2006-01-02, 03:45   #131
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3·7·167 Posts
Default

Quote:
Originally Posted by jasong
Can someone explain to me how to use the octo sieving program? The only thing I can figure from what I've read is that you guys are psychic and read the programmers mind.

Edit: and then 30 seconds later the answer is found :oops:

If I'm reading the text file correctly, I'd like to reserve n=187
And now I'd like to unreserve it, I can't get pfgw to work with the file and LLR and PRP exhibit behaviors that are incredibly scary.

Don't worry about helping me out, I was just taking a break from Riesel Sieve and now I'm going back.

Funny thing is, before I knew how to use octosieve, I used NewPGen in the exact same fashion, and found some octoproths. Obviously, something's different this time around.

Oh, well.
jasong is offline  
Old 2006-01-03, 05:23   #132
nibble4bits
 
nibble4bits's Avatar
 
Nov 2005

2×7×13 Posts
Default

I've made a QBASIC program just to see how well I understood the Pascal code. It only checks one factor and one prime but it will be easy to add multiple factors and testing 8 conditions at once. I'll rewrite this for C once I'm sure my logic does the same basic math and I have good psuedocode and a good flowchart. This will provide us with multiple implementations for our 'recreational math' experiment=more eyes=better code.

The attached file should have it's extension changed to BAS for QBASIC.
Please tell me if I did something horribly wrong! This is my first version of that test.
Attached Files
File Type: txt M-R_PROB.txt (2.1 KB, 101 views)
nibble4bits is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Small Primes for Octoproths <= 155 ValerieVonck Octoproth Search 100 2007-02-16 23:43
Found Octoproths - Range Archive ValerieVonck Octoproth Search 0 2007-02-14 07:24
Number of octoproths per n Greenbank Octoproth Search 15 2006-01-20 16:29
Need help with NewPGen(octoproths) jasong Software 1 2005-05-10 20:08

All times are UTC. The time now is 07:22.

Fri May 14 07:22:12 UTC 2021 up 36 days, 2:03, 0 users, load averages: 1.59, 1.56, 1.70

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.