Prove that a function has no integer roots

In summary, the function $f(x)=x^4-px^3-qx^2-rx-s$ has no integer root when $p, q, r, s \in \mathbb{N}$ and $p \ge q \ge r \ge s$. This is proven by considering three cases: when $n$ is positive, negative, or equal to zero, and showing that in each case, there cannot be an integer solution. Therefore, it is concluded that there are no integer solutions for this function.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Let $p, q, r, s \in \mathbb{N}$ such that $p \ge q \ge r \ge s$. Show that the function $f(x)=x^4-px^3-qx^2-rx-s$ has no integer root.
 
Last edited:
Mathematics news on Phys.org
  • #2
anemone said:
Let $p, q, r, s \in \mathbb{N}$ such that $p \ge q \ge r \ge s$. Show that the function $f(x)=x^4-px^3-qx^2-rx-s$ has no integer root.
[sp]Suppose that $n$ is an integer such that $f(n) = 0$. Then $n\ne0$, because $s\ne0$.

Suppose that $n>0$. Then the equation can be written $n^4 = pn^3+qn^2+rn+s$. We must have $p<n$, otherwise the right side would be greater than the left. Hence $p,q,r,s$ are all $\leqslant n-1$. Therefore $n^4 \leqslant (n-1)n^3 + (n-1)n^2 + (n-1)n + (n-1) = n^4-1.$ That is a contradiction, so there cannot be any positive solutions.

Suppose that $n<0$. Then the equation can be written $n^4 + p|n|^3 +r|n| = qn^2 + s$. But $n^4>0$, $p|n|\geqslant q$ and $r|n|\geqslant s$. So the left side of the equation is greater than the right, and again we have a contradiction.

Therefore there are no integer solutions.[/sp]
 

FAQ: Prove that a function has no integer roots

What is the definition of "integer roots"?

Integer roots refer to solutions of a function that are whole numbers, meaning they are positive or negative numbers with no decimal or fractional parts.

Can a function have both integer and non-integer roots?

Yes, a function can have both integer and non-integer roots. For example, the function f(x) = x^2 - 4 has integer roots of -2 and 2, but also has non-integer roots of ±2i.

How can you prove that a function has no integer roots?

One way to prove that a function has no integer roots is to use the Rational Root Theorem. This theorem states that if a polynomial function has integer roots, they must be factors of the constant term divided by the leading coefficient. By checking all possible factors using synthetic division, you can determine if any of them are roots of the function. If none of the possible factors are roots, then the function has no integer roots.

Are there other methods to prove that a function has no integer roots?

Yes, there are other methods to prove that a function has no integer roots. For example, you can use the Intermediate Value Theorem to show that the function does not cross the x-axis at any integer points, or you can use a graphing calculator to visually determine if the function has any integer roots.

What is the significance of proving that a function has no integer roots?

Proving that a function has no integer roots can help determine the behavior and properties of the function. It can also be useful in solving equations or inequalities involving the function, as it narrows down the possible solution set. Additionally, it can provide insight into the relationship between the function's coefficients and its roots.

Similar threads

Replies
2
Views
1K
Replies
1
Views
824
Replies
2
Views
851
Replies
1
Views
1K
Replies
2
Views
1K
Replies
1
Views
917
Replies
7
Views
2K
Replies
5
Views
1K
Back
Top