Sieving drive for k=1005-2000 n=200K-500K

[gd_barnes]

P=8800G-10000G is complete. no primes found

many possible primes were eliminated though!

[IronBits]

Scrub a dub dub :thumbs:

[IronBits]

sieve 1005-2000-200K-500K done, factors emailed to Gary.

[em99010pepe]

Originally Posted by IronBits

sieve 1005-2000-200K-500K done, factors emailed to Gary.

Now you can test your Core i7 on IB9000.

[Mini-Geek]

Originally Posted by gd_barnes

P=8800G-10000G is complete. no primes found

Naw, really?

[gd_barnes]

Originally Posted by Mini-Geek

Naw, really?

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 n-value like n=1.

[gd_barnes]

Re-reserving Nugget's range of P=8200G-8600G. 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

[Mini-Geek]

Originally Posted by gd_barnes

I say n>100K because srsieve will actually "announce" small primes on the screen if you sieve starting at an extremely low n-value like n=1.

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?

[henryzz]

Originally Posted by Mini-Geek

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?

almost right
it doesnt do square root for some reason although it would be very nice if it did

[gd_barnes]

Originally Posted by Mini-Geek

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?

Henry is correct. For example, if you are sieving and just happen to have k*2^n-1 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 twin-prime sieving at higher n-ranges. Also, it's far too slow.


Gary

[MyDogBuster]

4250G - 5850G Complete

Results emailed

I still owe you 4050G - 4250G Sometime tonight