Let's say that we have a function $3n^2-3n+13$. How do I know if the function only yields prime number without exhausting all the possibilities by trial and error?
How do you know if a function only yields a certain kind of number?
1
$\begingroup$
discrete-mathematics
-
0It doesn't. Think of a clever choice of $n$ that kills primality. – 2012-12-07
-
0No (non-constant) polynomial with integer coefficients yields prime numbers for all integer arguments. – 2012-12-07