Proof for non constant polynomial function

In summary, there is no proof that shows the non-existence of non-constant prime generating polynomial functions. However, it was noted in a previous discussion that Euler's function N^2 + N + 41 fits this criteria. If the definition of a non-constant prime generating polynomial is limited to specific values or sequences, then there is no proof for this. However, the general proof for non-existence of polynomials generating primes for all n still applies, regardless of the presence of a constant term. It is possible that a variation of this proof may also work for polynomials with rational coefficients.
  • #1
khotsofalang
21
0
is there any proof to show the non-existence of non-constant prime generating polynomial functions?
 
Physics news on Phys.org
  • #2
khotsofalang said:
is there any proof to show the non-existence of non-constant prime generating polynomial functions?
You got to be more specific about what you mean by a non-constant prime generating polynomial. If it is what I believe you mean, then this was noted in an earlier thread re Euler's function N^2 + N + 41. If you mean N takes only specific values such as "n = prime" or some sequence other than 1,2,3... then there is no such proof. If you omit the constant 41 then of course each integer will be composit for n > 1, however, the basic proof for non existence of polynominals in general (no polynomial with integer coefficients will generate a prime for all n since if P(1) = a prime "p" then P(1 + t*p) will always be divisible by p) will work whether there is or is not a constant in the polynomial such as 41.

Edit:I believe that a variation of the proof will work for polynomials with rational coefficients also.
 
Last edited:

FAQ: Proof for non constant polynomial function

How do you prove that a polynomial function is not constant?

One way to prove that a polynomial function is not constant is by showing that the degree of the polynomial is greater than 0. If the degree is 0, then the function is a constant.

Can you use the Intermediate Value Theorem to prove that a polynomial function is not constant?

Yes, the Intermediate Value Theorem can be used to prove that a polynomial function is not constant. If the polynomial has at least one real root, then it must have at least one point where the function takes on a value between the values at the two roots. This means that the function is not constant.

Is there a way to prove that a polynomial function is not constant without using calculus?

Yes, there are a few ways to prove that a polynomial function is not constant without using calculus. These include using the Fundamental Theorem of Algebra, the Rational Root Theorem, and the Descartes' Rule of Signs.

Can a constant term in a polynomial function affect its non-constant nature?

Yes, a non-zero constant term can affect the non-constant nature of a polynomial function. For example, the function f(x) = x + 1 is not constant, even though it has a constant term of 1. However, a constant term of 0 would result in a constant function.

Are there any special cases where a polynomial function may appear to be non-constant, but is actually constant?

Yes, there are a couple of special cases where a polynomial function may appear to be non-constant, but is actually constant. One example is a polynomial with no real roots, such as f(x) = x^2 + 1. Another example is a polynomial with multiple roots, such as f(x) = (x-1)^2. In these cases, although the function is not constant, it only takes on one value for all inputs.

Back
Top