Algebraic Representability of Prime Number Generators Does anyone happen to have at hand a short proof that demonstrates that there do (or do not) exist one or more algebraically representable prime number generating functions?
Try http://en.wikipedia.org/wiki/Prime_generating_function
P×p=24×x+1(p is prime no )(any prime no square when divded by 24 remainder is 1)