Also: I upped the sieving range to 1.5 billion.

[QUOTE=3.14159;227680]@CRG: Can you make a quick script that asks NewPGen to sieve for a certain base-range?[/QUOTE]

Why don't you? I don't use these programs much -- I'm not interested in prime searching, in general.

[QUOTE=science_man_88;227682]if you check the primes in this sequence out until the exponent of the largest Mersenne prime confirmed you'll see they are all prime for which 2^s-1 is not prime.[/QUOTE]

So your theory is that if p = 2^k * (s+1) - 1, then 2^p - 1 is composite?

If so, next time [i]say it that way[/i] so we can understand you.

[QUOTE=CRGreathouse;227687]So your theory is that if p = 2^k * (s+1) - 1, then 2^p - 1 is composite?

If so, next time [i]say it that way[/i] so we can understand you.[/QUOTE]

considering I don't understand how the equation works out I can't express it in that manner.

[QUOTE=science_man_88;227688]considering I don't understand how the equation works out I can't express it in that manner.[/QUOTE]

OK, well look at my last two posts on the matter and calculate out some terms to tell me if that's what you mean. (I can't do anything further until I see if this is what you mean. I never can -- communication is hard enough in general, and you seem to never give me quite enough information.)

I see how the equation works now and I think you are accurate. so now you get what I mean ?

but more specific to s values I haven't found a way to predict them yet if I do I'll let you know. I know that's what you're afraid of.

[quote=3.14159;227683][code]Error occuring in PFGW at Mon Aug 30 10:54:47 2010
Expr = 3460*308^308+1
Detected in MAXERR>0.45 (round off check) in prp_using_gwnum
Iteration: 75/2557 ERROR: ROUND OFF 0.5>0.45
PFGW will automatically rerun the test with -a1[/code][/quote]
Do you by chance know if PFGW successfully reran the test with -a1 (next higher FFT length)? If so, then we're good; if not, we have a problem.

Max :max:

[QUOTE=Matt]Do you by chance know if PFGW successfully reran the test with -a1 (next higher FFT length)? If so, then we're good; if not, we have a problem.
[/QUOTE]

I tested it with WinPFGW. The tests do work, fortunately.

110503 = 2^3*(13812+1)-1
132049 = 2^1*(66024+1)-1
216091 = 2^2*(54022+1)-1
756839 = 2^3*(94604+1)-1
859433 = 2^1*(429716+1)-1
1257787 = 2^2*(314446+1)-1
1398269 = 2^1*(699134+1)-1
2976221 = 2^1*(1488110+1)-1
3021377 = 2^1*(1510688+1)-1
6972593 = 2^1*(3486296+1)-1
13466917 = 2^1*(6733458+1)-1

[QUOTE=CRGreathouse]110503 = 2^3*(13812+1)-1
132049 = 2^1*(66024+1)-1
216091 = 2^2*(54022+1)-1
756839 = 2^3*(94604+1)-1
859433 = 2^1*(429716+1)-1
1257787 = 2^2*(314446+1)-1
1398269 = 2^1*(699134+1)-1
2976221 = 2^1*(1488110+1)-1
3021377 = 2^1*(1510688+1)-1
6972593 = 2^1*(3486296+1)-1
13466917 = 2^1*(6733458+1)-1[/QUOTE]

Are these numbers prime? What's the intent here?

[QUOTE=3.14159;227695]Are these numbers prime? What's the intent here?[/QUOTE]

They're in reply to posts #1165 and #1172.