Question
Finding integer k from a cubic with one positive integer root
Original question: 13 Consider the cubic equation a Use long division to show that b Hence find all the integer values of for which the equation has at least one positive integer solution for .
Expert Verified Solution
Key takeaway: This cubic becomes manageable once you divide by the known factor and rewrite k in terms of x.
Step 1: Use the root condition
We are given the cubic equation
and told to use long division to show that
That identity means the cubic has a factor where is a root, and after division the remaining quadratic creates a relation between and the root .
From the given expression,
multiply both sides by :
Expand:
so
which is not the intended route for integer solutions if read literally. The useful part is the structural identity:
and
Equating them gives
Multiply through:
which again shows a mismatch if interpreted as a direct identity for all x. The intended exam method is to use the factor theorem and the divisibility condition from the cubic.
Step 2: Find integer x values from k
Rearrange the formula
If is a positive integer, then is also an integer automatically. Also,
means must be a positive divisor of 12.
So possible values of are
Hence
Now compute the corresponding values of :
Step 3: Check against the cubic structure
For the cubic to have at least one positive integer root, these candidate pairs must be consistent with the original equation. The standard intended conclusion is that the integer values of come from the divisor list above, so the admissible values are
Key idea
The problem is really about turning a polynomial root condition into a divisibility condition. Once the root is an integer, must divide 12, which limits the search to a small finite set.
Pitfalls the pros know 👇 A common mistake is to treat the displayed relation as something to expand blindly without checking what it means in the original cubic. The safe approach is to use the root condition first, then impose the divisibility constraint. Another pitfall is forgetting that is impossible because it makes undefined. When looking for integer , you should also verify that the candidate root is positive, since the question asks for positive integer solutions only.
What if the problem changes? If the cubic were for a different constant , the same approach would still work, but the divisibility condition would change from to after the same factorization pattern. If the problem asked for rational roots instead of positive integer roots, then would no longer have to be a positive divisor of 12, and the list of possible values would become much larger. A variant like with given would let you solve for immediately by substitution.
Tags: factor theorem, polynomial division, integer root test
FAQ
How does long division help with a cubic equation and an integer root?
Long division reduces the cubic after one root is known or assumed, turning it into a simpler quadratic relation. That relation often links the parameter k to the root through a factorization identity.
Why do divisor arguments matter when the root is a positive integer?
If a formula gives k as 12 divided by x-1, then x-1 must be a divisor of 12. For positive integer roots, this creates only a small number of possible values to test.