mersenneforum.org embarking on the long journey
 Register FAQ Search Today's Posts Mark Forums Read

 2019-03-23, 15:59 #1 firejuggler     Apr 2010 Over the rainbow 2×7×173 Posts embarking on the long journey So I'll try in the coming month to try to find a fermat factor, specifically in k*2^347+1 and k*2^348+1. I'm using gfndsieve for my initial sieve. But i'm wondering if using Srsieve or sr2sieve might be faster after a while. Any one have experience on this? Last fiddled with by firejuggler on 2019-03-23 at 16:28
2019-03-23, 22:06   #2
rogue

"Mark"
Apr 2003
Between here and the

22·1,481 Posts

Quote:
 Originally Posted by firejuggler So I'll try in the coming month to try to find a fermat factor, specifically in k*2^347+1 and k*2^348+1. I'm using gfndsieve for my initial sieve. But i'm wondering if using Srsieve or sr2sieve might be faster after a while. Any one have experience on this?
gfndsieve will be many times faster than any of the srsieve programs for this type of number. To put it simply, gfndsieve is a fixed n sieve and srsieve is a fixed k sieve and solving for k when n is known is much easier than solving for n when k is known.

 2019-03-23, 23:13 #3 firejuggler     Apr 2010 Over the rainbow 2×7×173 Posts Ok, thank you rogue. I'll try to post update when and IF i get a result.
 2019-04-07, 00:06 #4 firejuggler     Apr 2010 Over the rainbow 2·7·173 Posts ok, progress update : ~470 Million number tested, 800-850 test/sec, no GF/GFN . 100e9-111e9 range tested with 2^347 and 2^348. Last fiddled with by firejuggler on 2019-04-07 at 00:06

 Similar Threads Thread Thread Starter Forum Replies Last Post ThomRuley Msieve 3 2013-11-30 04:52 davar55 Lounge 60 2013-07-30 20:26 grandpascorpion Programming 7 2009-10-04 12:13 panic Hardware 9 2009-09-11 05:11 schickel Lounge 2 2009-02-22 12:31

All times are UTC. The time now is 01:57.

Thu Oct 1 01:57:50 UTC 2020 up 20 days, 23:08, 1 user, load averages: 1.50, 1.54, 1.50