- #1
cragar
- 2,552
- 3
My teacher said that, No one knows of any quadratic polynomial that produces an infinite amount of primes. I was thinking could we use a polynomial like
[itex] x^2+1 [/itex] and then do a trick similar to Euclids proof of the infinite amount of primes
and assume their are only finitely many of them, But this probably won't work.
How else could we try to do this.
[itex] x^2+1 [/itex] and then do a trick similar to Euclids proof of the infinite amount of primes
and assume their are only finitely many of them, But this probably won't work.
How else could we try to do this.