mersenneforum.org Octoproths
 Register FAQ Search Today's Posts Mark Forums Read

2005-04-28, 09:20   #100
Dougy

Aug 2004
Melbourne, Australia

9816 Posts
Results

I've completed the list of the smallest octo's upto base n=101.
Attached Files
 octoproth.txt (9.1 KB, 133 views)

2005-04-29, 10:28   #101
axn

Jun 2003

7·709 Posts
n = 45 complete

Quote:
 Originally Posted by axn1 I am doing n=45 now.
Done with 45. Cleaning up n = 43 now. With that, n <= 45 will be complete.
Attached Files
 octo45.zip (14.5 KB, 139 views)

2005-04-29, 13:29   #102
axn

Jun 2003

7·709 Posts
n = 43 also done

n <= 45 is done!
Attached Files
 octo43.zip (4.3 KB, 132 views)

2005-05-05, 02:55   #103
Dougy

Aug 2004
Melbourne, Australia

23·19 Posts
Most Wanted: n=103

The smallest base without a known octo is now n=103. I've searched upto k=10018373025375 without success. But my computer isn't crash hot.

Who knows? It might be that there are no octoproths for this base. But it would be surprising.
Attached Files
 octoproth.txt (9.4 KB, 123 views)

 2005-05-09, 23:30 #104 Dougy     Aug 2004 Melbourne, Australia 2308 Posts n=103 This one took a long time for me to find. I believe it is the smallest for its base. k=12981967839555 n=103 New most wanted: n=104 k>1260985269075
 2005-05-10, 02:13 #105 jasong     "Jason Goatcher" Mar 2005 3·7·167 Posts I'm going to try 105. Thanks
2005-05-10, 18:59   #106
jasong

"Jason Goatcher"
Mar 2005

3×7×167 Posts

Quote:
 Originally Posted by jasong I'm going to try 105. Thanks
Guys, I apologize for being an idiot, but I'm stumped and I think I'd have to search for a long LONG time to get something that even remotely resembles what we're doing.

I've sieved the obvious first 4 combinations to 1.7 billion, but the second step stumps me. I've tried copying and pasting the ABC code to the beginning of the file with no changes and it simply started sieving the same old way(Well I did change the number to 3). I tried put the ABC code AFTER the "code" line. No dice. Lastly, and the output I got a split second before the Microsoft requesting information makes me think I'm on the right track, was to delete the "code" at the beginning of the file and JUST put in the ABC code. Apparently I'm on the right track, although a split second after it printed the number of digits it was about to sieve it errored out(Microsoft message).

Here're my specs:

Windows XP SP 2
1.75 =GHz Sempron 256K L2 cache
cmov(yes),sse(yes),sse2(no)<--I think this could be the problem.

I going to start sieving the old file again until I get a response.

 2005-05-10, 20:07 #107 smh     "Sander" Oct 2002 52.345322,5.52471 29·41 Posts The ABC code is for prp-ing with PFGW, NOT for sieving with newpgen. You'll be much better of with the program provided in this thread (octo). It ellimenates a lot more candidates because it sieves on all forms.
2005-05-10, 22:11   #108
jasong

"Jason Goatcher"
Mar 2005

3×7×167 Posts

Guys, I'm not totally sure I'm doing this right. Here's what I did:

I sieved n=105 k=1 to 100 billion. I sieved to p=1.7 billion for k*2^n(+/-)1 and k*2^(n+1)(+/-)1. So far so good.

Then I ran Winpfgw and entered the name of the sieve file in the white area. After some trial and error I managed to get it down to "quiet mode" and ran it that way.

These are the first two lines of my sieve file:
Quote:
 ABC 2^$b+$a & 2^$b-$a & 2^($b+1)+$a & 2^($b+1)-$a 187185 105
And here's the output:
Quote:
 PFGW Version 20021101.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Recognized ABC Sieve file: ABC File ***WARNING! file n105.txt may have already been fully processed. Switching to Exponentiating using GMP 2^105+98918460795 is 3-PRP! (0.000000 seconds) Done.
So, does this mean there's no prime or did I screw up?

2005-05-25, 14:13   #109
Dougy

Aug 2004
Melbourne, Australia

2308 Posts
Help,... finally (:

Some newies... These are the smallest of their respective bases.

3951185992215 104
4999977005415 104
2543393622525 105

Most wanted: n=106 with k<100000000000 tested.

Sorry for the late reply, but I only just learned how to use WinPFGW. I use the following line - works fine on mine.

ABC 2^$b-$a & 2^$b+$a & 2^($b+1)-$a & 2^($b+1)+$a & $a*2^$b-1 & $a*2^$b+1 & $a*2^($b+1)-1 & $a*2^($b+1)+1

What you did looks right jasong. Once WinPFGW has found one of the terms composite, it won't test the rest. It will then move on to the next line of the input file. With output set to "screen normal" it will only display the PRPs. Set it to "screen verbose" if you want to see what's really going on.

So on your example 2^105+98918460795 was found PRP, and so WinPFGW tested 2^105-98918460795, but was found composite. In all the others, 2^105+k was found to be composite.

With the ABC I listed above, if you discover a PRP-octoproth WinPFGW will say the equivalent of

2^105-2543393622525
2^105+2543393622525
2^(105+1)-2543393622525
2^(105+1)+2543393622525
2543393622525*2^105-1
2543393622525*2^105+1
2543393622525*2^(105+1)-1
2543393622525*2^(105+1)+1
- Complete Set -

In this way, if WinPFGW is left for a long time, it's possible to search pfgw.log for the word "complete" to be sure you haven't missed any.
Attached Files
 octoproth.txt (9.6 KB, 129 views)

 2005-05-26, 12:56 #110 Dougy     Aug 2004 Melbourne, Australia 23×19 Posts New largest octoproth. New large octoproth, with 66 digits. Found using octo_deep and WinPFGW. 10615930805025 175 k*2^n+1 = 508402081901301196677322036120753040729104117251188427628688179201 Took my comp all day to find this one.

 Similar Threads Thread Thread Starter Forum Replies Last Post ValerieVonck Octoproth Search 100 2007-02-16 23:43 ValerieVonck Octoproth Search 0 2007-02-14 07:24 Greenbank Octoproth Search 15 2006-01-20 16:29 jasong Software 1 2005-05-10 20:08

All times are UTC. The time now is 08:27.

Fri May 14 08:27:26 UTC 2021 up 36 days, 3:08, 0 users, load averages: 2.28, 2.48, 2.12