Primality testing 3745996192*3^439348-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 13, base 1+sqrt(13)
3745996192*3^439348-1 is prime! (1182.5824s+0.3063s)


LLR

D:\PGEN>llr64 -t4 -d -q"3745996192*3^439348-1"
Base prime factor(s) taken : 3
Resuming N+1 prime test of 3745996192*3^439348-1 at bit 20599 [2.95%]
Using zero-padded AVX FFT length 72K, Pass1=384, Pass2=192, 4 threads, a = 3
3745996192*3^439348-1 may be prime. Starting Lucas sequence...
Using zero-padded AVX FFT length 72K, Pass1=384, Pass2=192, 4 threads, P = 11
3745996192*3^439348-1 may be prime, trying to compute gcd's
3745996192*3^439348-1 may be prime, but N divides U((N+1)/3), P = 11
Restarting Lucas sequence with P = 15
Using zero-padded AVX FFT length 72K, Pass1=384, Pass2=192, 4 threads, P = 15
3745996192*3^439348-1 may be prime, trying to compute gcd's
U((N+1)/3) is coprime to N!
3745996192*3^439348-1 is prime! (209632 decimal digits, P = 15) Time : 677.190 sec.

Maybe it is time to use newer LLR (PFGW) version, or check your CPU-s :)

Running an Baillie-PSW Primality Test in order to check if pseodoprime or not. Might take a few hours.

[QUOTE=MisterBitcoin;470023]Running an Baillie-PSW Primality Test in order to check if pseodoprime or not. Might take a few hours.[/QUOTE]

LLR say it is prime, you are wasting time

3745996192*3^439348-1 is prime! (209632 decimal digits, P = 15) Time : 677.190 sec.

Updated PFGW

[CODE]Running N+1 test using discriminant 13, base 1+sqrt(13)
3745996192*3^439348-1 is prime! (6203.2616s+0.0181s)
[/CODE]

[QUOTE=MisterBitcoin;470023]Running an Baillie-PSW Primality Test in order to check if pseodoprime or not. Might take a few hours.[/QUOTE]

Looks like I failed the syntax. Can someone help?
Programm can be found [URL="http://www.trnicely.net/misc/bpsw.html"]here[/URL].

[QUOTE=MisterBitcoin;470068]Looks like I failed the syntax. Can someone help?
Programm can be found [URL="http://www.trnicely.net/misc/bpsw.html"]here[/URL].[/QUOTE]

I have checked with my CPU again and got the result from Pepi, so no pseudoprime or similar.

R3 tested to n=550k (525-550k) (0-2.147G)

28 primes found, 884 remain in this range

Results emailed, Base released

R3 tested to n=500k (350-500k) (2.147-4G)

284 primes found, 814 remain in this range

Results emailed, Base released

R3 range 63G-end reached N=250K.
There are 65k´s remain.
Attached is the first part of llr results, the second (way bigger) part was sended via Mail.
There is also an file attached with k´s remain on this range. I´m releasing this range.

[QUOTE=MisterBitcoin;470666]R3 range 63G-end reached N=250K.
There are 65k´s remain.
Attached is the first part of llr results, the second (way bigger) part was sended via Mail.
There is also an file attached with k´s remain on this range. I´m releasing this range.[/QUOTE]

In the future, please do the following for all bases:

1. Send me one file for each of the following:
Primes
Remaining
Results
(If files are > 1 GB, divide them up by k-value, preferrably k=1G chunks for base 3.)

2. Balance the k's remaining: That is take the remaining k's at the beginning of your range, subtract the [B]unique[/B] primes found, and make sure that it matches the k's remaining at the end of your range.

For this range, the primes files and the number of k's remaining is incorrect. This took me a while to balance because I had to merge all of the files and there were several errors:

Primes missing from the primes files:
63005744278*3^178028-1
63014422508*3^105198-1

k's that should not be in remaining file:
63043444714*3^n-1 (63043444714*3^151276-1 is prime)
63057760112*3^n-1 (63057760112*3^237072-1 is prime)

There were 49 primes found for k>63G and n=100K-250K and only 63 k's remaining at n=250K.

I'm asking for some close inspections on the files before posting them on these large bases. Thanks.

Reserving R3 to n=175k (150-175k) (6-10G) for BOINC