Submissions: 242 * p(881)#[sup]2[/sup] + 1 (5868 digits)

Down to 37600 candidates..

[code]20:19:15 37600 k's remaining. p=7270485000731 divides k=1907653[/code]

Let's see the odds:

ln(2^594800) = 412283.9429970554700..

Divide by 2; 206141.9714985277350..

The sieve efficiency, so far, is 26.6049431984462713172..

Dividing yields, the odds: 1 in 7748. Seems decent to me. I'll go a bit further.

I should also organize some (personal) sieving params, for k * b[sup]n[/sup] + 1.

Level 1: ≤ 10[sup]6[/sup] (Small primes)
Level 2: 10[sup]6[/sup] to 10[sup]9[/sup] (Small primes)
Level 3: 10[sup]9[/sup] to 10[sup]12[/sup] (Mid-size primes)
Level 4: 10[sup]12[/sup] to 10[sup]13[/sup] (Large primes)
Level 5: ≥10[sup]13[/sup]. (Large primes, [B]only when b=2.[/B])

And; the k's seem to be getting eliminated rather quickly. Still in sub-minute times.

For a[sup]n[/sup] * q[sup]x[/sup] + 1 primes, where only one base is prime, the other base = 2 or any power of 2.

Submissions: 2[SUP]428[/SUP] * 109[SUP]996[/SUP] + 1 (2159 digits)

Current progress: (k * 2[sup]594800[/sup] + 1) [code]00:03:23 37323 k's remaining. p=9047970928903 divides k=2275735[/code]

[code]01:35:23 37216 k's remaining. p=9781967722003 divides k=2213971[/code]

Final report on progress, will continue tomorrow..

Personal record for second-kind Cunningham primes: 2641 * 1296[sup]198[/sup] + 1 and 5282 * 1296[sup]198[/sup] + 1 are both prime. (620 and 621 digits)

Nevermind; 1373 * 1296[sup]234[/sup] + 1 and 2746 * 1296[sup]234[/sup] + 1 are both prime, both at 732 digits.

So far, my odds are now at 1 in 7623, for finding any primes. I've currently sieved out all candidates with divisors of 1-13 digits.

I recently eliminated 1730415 * 2[sup]594800[/sup] + 1. It was divisible by 11978969437139.

I've recently reached 1 in 27 candidates to be eliminated.

Also; Does anyone know how to make a simple script for testing primality of any k*n + c expression over a range of k and n? Similar to what the original PrimeForm allows?

Also; I've saved myself about 2 days of testing time today.

[QUOTE=3.14159;230297]
Also; Does anyone know how to make a simple script for testing primality of any k*n + c expression over a range of k and n? Similar to what the original PrimeForm allows?[/QUOTE]

[CODE]Pisequence(kmin,kmax,nmin,nmax,c)=for(k=kmin,kmax,for(n=nmin,nmax,if(isprime(k*n+c),print(k"*"n"+"c))))[/CODE]

is this what you want ?

[QUOTE=science_man_88]is this what you want ?
[/QUOTE]

Not for PARI. I already have one, but thanks anyway.

I meant, for PFGW.

I intend to continue for the collection of primes for k * 1296[sup]n[/sup] + 1; k = 1 to 10k. I've almost collected every small prime for this range. (< 1000 digits.) I'm up to about 983 digits.

I used Proth.exe for it all. I intend to continue until it becomes slow to the point where it is useless.