TITLE: The Prime Polynomial : Generating Prime Numbers
QUESTION [8 upvotes]: First of all, i'll confess i'm no math geek. I'm from Stackoverflow, but this question seemed more apt here, so i decided to ask you guys :)
Now, i know noone has discovered (or ever will) a Polynomial that generates Prime Numbers. But i've read about Curve Fitting (or Polynomial Fitting) so i was wondering if there was a way, we could have a simple n-degree Polynomial that could generate the first 1000 (or X) primes accurately.
I don't need it to generate all the primes, maybe just upto 1 million, since we already have the data, can we deduce that polynomial?
How big will be the polynomial for it to be accurate? Could you give an example for the first 100 primes? Am i just plain naive? 
Thanks in Advance. :)

REPLY [9 votes]: From Mathworld
However, there exists a polynomial  in 10 variables with integer coefficients such that the set of primes equals the set of positive  values of this polynomial obtained as the variables run through all nonnegative integers, although it is really a set of Diophantine equations in disguise (Ribenboim 1991). Jones, Sato, Wada, and Wiens have also found a polynomial of degree 25 in 26 variables whose positive values are exactly the prime numbers (Flannery and Flannery 2000, p. 51).
Unfortunately, the primes do not come out in order, so this will not help for what you want.  But it is interesting.