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
-
0No (non-constant) polynomial with integer coefficients yields prime numbers for all integer arguments. – 2012-12-07
1 Answers
8
If your function is $f(n)=3n^{2}-3n+13$ by putting $n=13$ you will have $f(n)=13(39-3+1)$ that is not prime, even without thinking! why you ask it?
-
2@AmirHoseinSadeghiManesh: Like $y$our approach. +1 – 2012-12-15