Suppose f(n) is a polynomial such that f(n) is a prime number for all n ≥ 0. Show that f(n) = p for some prime p. [Hint: Proof by contradiction.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.