0
$\begingroup$

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?

  • 0
    I guess that wasn't precise. By 'algebraically representable' I meant: http://en.wikipedia.org/wiki/Algebraic_function2012-06-03

3 Answers 3

-1

P×p=24×x+1(p is prime no )(any prime no square when divded by 24 remainder is 1)

  • 1
    Could you elaborate? It is not clear to me what is meant here.2017-12-13
2

Try http://en.wikipedia.org/wiki/Prime_generating_function

  • 1
    @anon I'm not sure that can be called "algebraic."2012-06-01
1

You clarified that you meant, "Is there an algebraic function which generates the primes", that is, "Is there a fixed expression using only addition, subtraction, multiplication, division, and (fixed) root extraction which generates the primes?" The answer is no, because algebraic expressions cannot have the required growth rate, lacking anything that grows logarithmically, while $p_n\sim n\log n.$