Christian Goetz wrote:
I searched the web for the starting numbers and found a japanese page with a
better description of the algorithm (http://web2.incl.ne.jp/yaoki/2seqp2.htm)
Problem:
[snip]
Prove for 'A (n) * B (n) +1' the fact that it becomes prime.
The English in this sentence is ambiguous. It could mean that
the sequence of numbers {A(n)*B(n)+1} contains infinitely
many primes.
Mike
--
p="p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
This message made from 100% recycled bits.
You have found the bank of Larn.
I can explain it for you, but I can't understand it for you.
I speak only for myself, and I am unanimous in that!
_______________________________________________
Prime mailing list
[email protected]
http://hogranch.com/mailman/listinfo/prime
