- Indeed,not all is rotten in the kingdom of Denmark.

Jens,

What about a k=20 closest n^2+1 twin primes

( 624 (mod 2210) +0/2) + -210,0,10,20,30,40,80,90,100,310

Minimal distance for k=20 ----->520

Easier than finding a 11-CPAP I think.

10 days with a cyrix 230 Mhz prp-ing and still not found the minimal k=10 n^2*1 closest twin primes (n<1.1*10^11)

Least k=8 is probably n=192308194 +0/2 +0,10,20,30

Mike should help me.

---------------------------------

[Non-text portions of this message have been removed] - Robin Garcia wrote:

> Indeed,not all is rotten in the kingdom of Denmark.

I have not checked but if 520 is minimal then it should be allowed for k=20.

> Jens,

> What about a k=20 closest n^2+1 twin primes

> ( 624 (mod 2210) +0/2) + -210,0,10,20,30,40,80,90,100,310

> Minimal distance for k=20 ----->520

It seems _very_ hard.

http://hjem.get2net.dk/jka/math/simultprime.htm does not even have an entry

for k=19.

> Easier than finding a 11-CPAP I think.

Far easier than finding a CPAP-11, but most things are.

http://hjem.get2net.dk/jka/math/cpap.htm says:

"With current methods it may take trillions of cpu GHz years according to the

people who found the only known CPAP-10."

If somebody feels _extremely_ lucky, I have a CPAP-11 searcher.

I haven't made an estimate yet but does it really matter?

At least it would be likely to set the record for most optimistic prime search

ever :-)

A partial result with a non-consecutive AP-6 would be an allowed record by my

rules. That may actually happen in this universe, but if the k=6 record is

targeted then there are better ways.

> 10 days with a cyrix 230 Mhz prp-ing and still not found the minimal k=10

I don't know whether you are using individual trial factoring but true sieving

> n^2*1 closest twin primes (n<1.1*10^11)

> Least k=8 is probably n=192308194 +0/2 +0,10,20,30

>

> Mike should help me.

is definitely recommended here. I don't have time to write the sieve.

--

Jens Kruse Andersen