Thread: Octoproths
View Single Post
Old 2006-01-24, 21:51   #267
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

13×109 Posts
Default new octo program!

In this program now there is no limitation on k value. I've tried all three optimization flags ( among -O1, -O2, -O3 ) and -O1 was the fastest ( try this one ). Just to see that the program correctly identify large k values, I've tried:

C:\>octo_6_0 72 10000000T 10000010T
You can also find the k n values in results_octo.txt file ( These are 3-probable primes )
n=72, kmin=10000000T, kmax=10000010T, version=6.0, here T=10^12
Starting the sieve...
Using the first 8 primes to reduce the size of the sieve array
10000002989467112895 72
10000000479372125565 72
10000007742413127075 72
10000007506574893605 72
10000009359875458875 72
10000007773909145265 72
10000003164141619125 72
10000001353327652625 72
10000000828720374885 72
10000008277743037575 72
10000002428249499645 72
10000001785208783145 72
10000003434544089015 72
10000007626546970445 72
10000002610159188375 72
The sieving is complete.
Number of Prp tests=591004
Time=539 sec.

Correct! These k values are larger than 10^19 ( >2^60, previous limit ).
I've also modified some parts in the code.

See the attachment for the c code. Or download the exe for windows from: http://www.robertgerbicz.tar.hu/octo_6_0.exe
Attached Files
File Type: txt octo_6_0.txt (16.6 KB, 212 views)
R. Gerbicz is offline