Search:

How deep numbers under 1M should sieved ?

I wasn't originally aware that louie have tested range 2,5 M -> 3,0 million that deep.

square(2.5)=1.58
square(3)=1.73
So if we have unneededly...

I think that purpose is not double check sieving but sieve before double cheking.

The result is some doubling with previous sieving efforts, but because
current software works differently (I...

I gave just range like this :
---Sob.dat begins--
12
1
3000000
k=4847
k=5359
k=10223
k=19249
k=21181

I got instructions from Paul Jobling how to create SoB.dat using
SoBSieve.exe. I used version 1.06.
Here are instructions :

---klip---
However, there is a *much*
easier way to get SoBSieve to...

OK. I have that stuff at home. I will reply when I am there.

Nuutti

If you use my file you are going to do some duplicating but only partially.

Louie used Phil's sieving files when he added numbers to server
(in the first phase) and different k values have...

Can you mail those factors to (also)me. In the first phase I can keep
list about found factors.

Nuutti

I also plan to partizipate sieving until we reach 10T.

Sieving files 1<n<3,000,000 can be found here :
http://powersum.dnsq.org/doublesieve/

Nuutti

I have assumed that Louie have not sieved numbers in the range
n= 1<n<5,000,000 at all because these have checked by previous searchers and projects and only partially between n values 500,000 ->...

I have created file from scratch mainly because I had impression that numbers under n =1,000,000 have not sieved very high.
I know that numbers in the range 2,000,000 -> 3,000,000 have sieved very...

I have to admit that I don't know what Louis' database like these factors, but you can mail all factor to me. I will keep a a list about found factors for a while.

my e-mail is...

I made a small test run SoBSieve vs. NbeGon_010
and here are my results :
Test SoB.dat was a file for 1->3,000,000.
Range was 20G -> 20G+1,000,000.
Computer was PII 450.
Time to complete the...

I used old good 1.06 because it can create sob.dat file.
Sieving was slow. I don't know if newer clients are faster with low n values ?

I tested with SoBSieve 1.24 with p about 2,000 G and n...

I have done that sieving file from 1->3,000,000 and it is sieved up to 5G

The file is here :
http://powersum.dnsq.org/doublesieve/

Nuutti

Changing sieve range does not speed sieving a lot but sieving
from 3,000,000 will help us in double cheking.
When we will find a factor we will know for sure that number wasn't prime. Bacause...

I made speed test to prime 95 and got following things :
fft lengths are 1792K, 1536K, 1280K, 1024K, 892K, 768K, 640K, 512K, 448K, 384K, 320K, 256K
So this might give some picture about fft length...

Probably. I guess that fft size changes when number lenght doubles but it can be denser. It just requies more work to code
many different fft sizes.

Nuutti

P.S. Here is some infotmation what...

May be client has changed to longer fft lenght because
numbers are longer (?). I think that math code is hand written asm and there is several versions of the code and client choose
right one...

I don't know if this helps, but you can clear cache by edting windows registry.


Nuutti

I suspect that Louie is sometimes recycling that kind of numbers by hand. I am not sure but I suspect that based on the observations of the lower bound. Sometimes lower bond of all k values change a...

Is it possible to generate an input file for Sobsieve for the range:
n=1 -> n=3,000,000 million ?
or 1,000,000 -> 3,000,000 ?

I think that sieving that range we could reduce prp-work needed for...

OK. I think that there is one problem in our analysis.
I mean that our factor removal rate is affected by our
sieving range. We are now sieving 3-20 million and if we increase
this to 3-100...

OK. I do number crunching sometimes and I have found that vba is sometimes very useful. I have also used it primenumbers related projects like when I have to find 10,000 first primes :-)
and also...

to Nuri : You don't speak fluent Excel vba ?

Nuutti

Thanks !

Nuutti