Paul Leyland says:
The algorithm: "n:=1; repeat {n:=n+2; output n}" is, I hope you agree, a
simple algorithm and generates an infinite number of primes (indeed, all
of them bar 2)
And why do you want to exclude poor 2?
n:=1; repeat {n:=n+1; output n}
Bernardo Boncompagni
________________________________
"Wars not make one great"
Yoda
When's who
A timeline of history makers
http://whenswho.redgolpe.com
Factorization of
special form numbers
http://factors.redgolpe.com
________________________________
_______________________________________________
Prime mailing list
[email protected]
http://hogranch.com/mailman/listinfo/prime
