2 --typos

# AWK - 129

The file fsoe-pairs.awk:

{n=2;N=1
for(;;){if(n in L){p=L[n];del L[n]}else{p=n
if(n-N==2)if(!--$0){print N", "n;exit}N=n}P=p+n++ while(P in L)P+=p;L[P]=p}}  Running it: $ awk -f fsoe-pairs.awk
1
3, 5
$awk -f fsoe-pairs.awk 2 5, 7$ awk -f fsoe-pairs.awk
10
107, 109


(1st line after command is input, the 2nd one is output)

This is based on an own prime generator algorithm I call "floating sieve of erastosthenes" (until I find it described elswhere) wichwhich only stores the needed part of the sieve and the already calculated primes.

# AWK - 129

The file fsoe-pairs.awk:

{n=2;N=1
for(;;){if(n in L){p=L[n];del L[n]}else{p=n
if(n-N==2)if(!--$0){print N", "n;exit}N=n}P=p+n++ while(P in L)P+=p;L[P]=p}}  Running it: $ awk -f fsoe-pairs.awk
1
3, 5
$awk -f fsoe-pairs.awk 2 5, 7$ awk -f fsoe-pairs.awk
10
107, 109


(1st line after command is input, the 2nd one is output)

This is based on an own prime generator algorithm I call "floating sieve of erastosthenes" (until I find it described elswhere) wich only stores the needed part of the sieve and the already calculated primes.

# AWK - 129

The file fsoe-pairs.awk:

{n=2;N=1
for(;;){if(n in L){p=L[n];del L[n]}else{p=n
if(n-N==2)if(!--$0){print N", "n;exit}N=n}P=p+n++ while(P in L)P+=p;L[P]=p}}  Running it: $ awk -f fsoe-pairs.awk
1
3, 5
$awk -f fsoe-pairs.awk 2 5, 7$ awk -f fsoe-pairs.awk
10
107, 109


(1st line after command is input, the 2nd one is output)

This is based on an own prime generator algorithm I call "floating sieve of erastosthenes" (until I find it described elswhere) which only stores the needed part of the sieve and the already calculated primes.

1

# AWK - 129

The file fsoe-pairs.awk:

{n=2;N=1
for(;;){if(n in L){p=L[n];del L[n]}else{p=n
if(n-N==2)if(!--$0){print N", "n;exit}N=n}P=p+n++ while(P in L)P+=p;L[P]=p}}  Running it: $ awk -f fsoe-pairs.awk
1
3, 5
$awk -f fsoe-pairs.awk 2 5, 7$ awk -f fsoe-pairs.awk
10
107, 109


(1st line after command is input, the 2nd one is output)

This is based on an own prime generator algorithm I call "floating sieve of erastosthenes" (until I find it described elswhere) wich only stores the needed part of the sieve and the already calculated primes.