Mathew is reserving R7 for k=1M-2M to n=120K.

I'd like to reserve S7 k<=1M.
But I want to test how this k-values work, so I'll reserve only from n=50,000 - 51,000.

Status report
 

Base=10 (Sierpinski + Riesel) tested till n=620000

R26
 

R26 tested n=400K-500K - Nothing found

Results emailed - Base released

Removed from recommended list

R7 from k=1M-2M
is complete

4 k's remain

1356018
1365816
1620198
1676096

Results have been emailed

[QUOTE=Rincewind;253746]I'd like to reserve S7 k<=1M.
But I want to test how this k-values work, so I'll reserve only from n=50,000 - 51,000.[/QUOTE]

Becaus the test went realy smooth I tested up to n=55,000 and found a prime

[code]
Primality testing 525244*7^54941+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 99.99%
525244*7^54941+1 is prime! (387.2672s+0.0058s)
[/code]

I'd like to reserve S7 k<= 1M up to n=100,000.

(A small off topic question: How can I calculate the digits of a prime I found?)

One equation is log[SUB]10[/SUB](k)+log[SUB]10[/SUB](b)*n

so for your prime it would be

log[SUB]10[/SUB](525244)+log[SUB]10[/SUB](7)*54941=46436.25

so ~46436 digits

[QUOTE=Mathew Steine;254407]One equation is log[SUB]10[/SUB](k)+log[SUB]10[/SUB](b)*n

so for your prime it would be

log[SUB]10[/SUB](525244)+log[SUB]10[/SUB](7)*54941=46436.25

so ~46436 digits[/QUOTE]

Close. It's actually int[log[SUB]10[/SUB](k)+log[SUB]10[/SUB](b)*n]+1. So 46437 digits.

Thank you for your answers.

I finished S7 für k< 1m up to n=100.000 and found 2 more primes

753472*7^60702+1
728212*7^70414+1

I'll continue with the remaining k (987144) and would like to reserve n = 200.000.

Range up to n=125k done
Tests continue

Status report
 

Base=10 (Sierpinski + Riesel) tested till n=630000