Let , and let be a polynomial with integer coefficients such that
, and
.
What is the smallest possible value of ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Factor P(x)-a = (x-1)(x-3)(x-5)(x-7)Q(x); evaluating at 2, 4, 6, 8 forces 15, 9, 15, 105 to divide 2a, so 315 divides a.
Solution
Since has roots , the factor theorem gives
for some polynomial with integer coefficients (dividing by a monic integer polynomial keeps integer coefficients).
Plug in the even points, where , so the left side is :
- : , so .
- : , so .
- : , so .
- : , so .
Hence divides , and since is odd, . So .
To see is attainable we need an integer polynomial with , , , . Write and solve in order: ; gives ; gives ; gives . All integers, so such a exists.
The answer is .
Why this works
Equal values at several points are a signal to subtract that value and factor by the factor theorem; the remaining factor is still an integer polynomial. Evaluating at the other points converts the condition into divisibility by small products, and the lcm of those products is the natural lower bound. A minimum needs both halves: the bound and a construction.
Alternative approach
Bound only: choice (A) fails because requires and . The remaining choices are all multiples of , so the smallest candidate consistent with the divisibility conditions is (B); the existence check above confirms it.
The trap
Stopping at the lower bound and forgetting to confirm that an integer polynomial Q actually exists for a = 315, or using the product 15*9*15*105 instead of the lcm.
Common mistakes
- Stopping at the lower bound and forgetting to confirm that an integer polynomial Q actually exists for a = 315, or using the product 15915*105 instead of the lcm.
- Forgetting the factor of in at the even points, or concluding means .
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Bound the quantity above/below or estimate to pin it down