Paul Leyland wrote:
On Mon, 2006-01-23 at 20:42, Bernardo Boncompagni wrote:
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}
Oh, just for the fun of it. No other reason. In reality, of course,
just to make fun of Brian in a harmless manner to point out he made a
silly mistake. I'm quite certain that he didn't mean what he said.
There are, of course, an infinite number of simple algorithms that
generate an infinite number of primes.
ISTR that there is a polynomial in 26 variables which, when the
various variables take on all integral values, generates only
primes (and 1, IIRC).
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
