Reserving R63 to n=25k (15-25k) (183.75M-187.25M) for BOINC

As I've told rebirther, there are (exactly) 160,000 k left to sieve. I've found that as k get larger that I don't need to sieve as deeply (~3e10). I think it is possible that I oversieved some of the first ranges I worked on. I should have an estimate later today as to how long it will take me to complete sieving those k to 3e10.

S93 tested to n=100k (50-100k)

12 primes found - 70 remain

16712*93^50534+1
17910*93^56392+1
18658*93^57219+1
14306*93^58632+1
18752*93^60545+1
19568*93^62463+1
8604*93^66022+1
7286*93^68324+1
15818*93^68946+1
9754*93^73359+1
1652*93^96929+1
12092*93^97182+1

Results emailed - Base released

I have a problem number for R63, with llr log, my double check produced the same:

[CODE]Starting N+1 prime test of 51956602*63^19370-1
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, a = 3

51956602*63^19370-1, bit: 50000 / 115806 [43.17%]. Time per bit: 0.086 ms.
51956602*63^19370-1, bit: 100000 / 115806 [86.35%]. Time per bit: 0.086 ms.

51956602*63^19370-1 may be prime. Starting Lucas sequence...
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 3

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.269 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.227 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
U((N+1)/7) is coprime to N!
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 3
Restarting Lucas sequence with P = 4
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 4

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.321 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.239 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 4
Restarting Lucas sequence with P = 7
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 7

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.325 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.234 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 7
Restarting Lucas sequence with P = 9
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 9

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.326 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.234 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 9
Restarting Lucas sequence with P = 10
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 10

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.318 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.226 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 10
Restarting Lucas sequence with P = 14
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 14

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.309 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.235 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 14
Restarting Lucas sequence with P = 15
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 15

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.306 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.244 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 15
Restarting Lucas sequence with P = 16
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 16

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.312 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.239 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 16
Restarting Lucas sequence with P = 17
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 17

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.317 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.232 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 17
Restarting Lucas sequence with P = 18
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 18

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.321 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.227 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 18
Restarting Lucas sequence with P = 19
Using zero-padded FMA3 FFT length 15K, Pass1=320, Pass2=48, P = 19

51956602*63^19370-1, bit: 50000 / 115800 [43.17%]. Time per bit: 0.314 ms.
51956602*63^19370-1, bit: 100000 / 115800 [86.35%]. Time per bit: 0.235 ms.

51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 19

Giving up after 11 restarts...
Time : 312.784 sec.
09:20:15 (102924): llr.exe exited; CPU time 305.215956[/CODE]

Any idea?

I don't know what is happening, but you might try pfgw on this number.

[QUOTE=Puzzle-Peter;404654]I don't know what is happening, but you might try pfgw on this number.[/QUOTE]

I have tried pfgw -d -q"51956602*63^19370-1" and got the pfgw.log (51956602*63^19370-1). So the number is prime?

As far as I know this is just a PRP test. try pfgw -l -tp -q"51956602*63^19370-1" and you should get some more meaningful output

EDIT
this is what I get in pfw.out (after removing the double quotes):
[quote]
Primality testing 51956602*63^19370-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 3+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 53.02%
51956602*63^19370-1 is prime! (46.0821s+0.0017s)
[/quote]plus there is a file called pfgw-prime.log

[QUOTE=Puzzle-Peter;404658]As far as I know this is just a PRP test. try pfgw -l -tp -q"51956602*63^19370-1" and you should get some more meaningful output

EDIT
this is what I get in pfw.out (after removing the double quotes):

plus there is a file called pfge-prime.log[/QUOTE]

Yes, confirmed, got the same. This must be a llr bug perhaps.

[QUOTE=rebirther;404660]Yes, confirmed, got the same. This must be a llr bug perhaps.[/QUOTE]

I'm not sure what happens, but I know from a base 3 riesel prime, that I had the same experience, only I believe that LLR gave up after 13 tests ending up as PRP. Looking forward to see what Jean believes the problem is. My PRP also came back as prime according to PFGW where LLR had to give up :smile:

R45 tested to n=250k (200-250k)

1 prime found - 7 remain

4210*45^235749-1

Results emailed - Base released

R46
 

hi,
here are the results for
R46; n=100000 - 150000
2 primes found - 10 k´s remain
7848*46^103180-1
7520*46^137207-1
results emailed
base released