20090114, 12:14  #100 
May 2007
Kansas; USA
2^{3}·1,301 Posts 
P=8800G10000G is complete. no primes found
many possible primes were eliminated though! 
20090114, 12:39  #101 
I ♥ BOINC!
Oct 2002
Glendale, AZ. (USA)
2131_{8} Posts 
Scrub a dub dub :thumbs:

20090114, 13:43  #102 
I ♥ BOINC!
Oct 2002
Glendale, AZ. (USA)
2131_{8} Posts 
sieve 10052000200K500K done, factors emailed to Gary.

20090114, 13:50  #103 
Sep 2004
2830_{10} Posts 

20090114, 14:33  #104 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts 

20090115, 05:27  #105 
May 2007
Kansas; USA
2^{3}·1,301 Posts 
I was wondering if anyone would catch that. Funny thing...I actually started to type that out of habit and then said what the heck am I doing? Then I just went with it. lol If anyone finds a prime n>100K while sieving, let me know. We'll award you a gold medal! I say n>100K because srsieve will actually "announce" small primes on the screen if you sieve starting at an extremely low nvalue like n=1. 
20090115, 06:14  #106 
May 2007
Kansas; USA
10100010101000_{2} Posts 
Rereserving Nugget's range of P=8200G8600G. We can't wait any longer for it. Perhaps he'll show up midway through and I'll be able to stop. I think a quad will slay it fast enough. If not, I'll put 2 on it.
Gary 
20090115, 16:31  #107 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
1000010101011_{2} Posts 
I assume this is just because it sieves past the square root of the number without finding anything, right? How long would it take (I know it'll be way, way past the realm of practicality, and probably possibility as well) to confirm via sieving only, with sr*sieve or NewPGen or something, (maybe include Prime95?) that a number with n>100K is prime?

20090115, 16:54  #108  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2·17·173 Posts 
Quote:
it doesnt do square root for some reason although it would be very nice if it did 

20090116, 01:25  #109  
May 2007
Kansas; USA
2^{3}×1,301 Posts 
Quote:
Henry is correct. For example, if you are sieving and just happen to have k*2^n1 calculate to a value of 101; srsieve will not display it as prime until it has sieved to P=101. This is OK as far as I'm concerned because srsieve will actually correctly leave the pair in the sieve. sr1sieve and sr2sieve either barf at such a low pair or improperly remove them. NewPGen is extremely bad about that; it actually removes them from the sieve without saying a word. For that reason, I never use NewPGen anymore except for twinprime sieving at higher nranges. Also, it's far too slow. Gary 

20090116, 08:32  #110 
May 2008
Wilmington, DE
101100100100_{2} Posts 
4250G  5850G Complete
Results emailed I still owe you 4050G  4250G Sometime tonight 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Team drive #10 k=14002000 n=500K1M  gd_barnes  No Prime Left Behind  61  20130130 16:08 
Team drive #9 k=10052000 n=50K350K  gd_barnes  No Prime Left Behind  236  20090625 10:04 
Sieving drive for k=10032000 n=500K1M  gd_barnes  No Prime Left Behind  160  20090510 00:50 
k=10051400 n=200K500K results fill in  gd_barnes  No Prime Left Behind  55  20090416 11:33 
Team drive #8 k=14002000 n=350K500K  gd_barnes  No Prime Left Behind  101  20090408 02:11 