2010 AMC 10B Problem 25
Let , and let be a polynomial with integer coefficients such that
, and
.
What is the smallest possible value of ?
Show solution without answering
Key insight
P(x) - a is zero at 1, 3, 5, 7, so it has the factor (x-1)(x-3)(x-5)(x-7). Plugging in 2, 4, 6, 8 forces a to be a multiple of 315.
Solution
This is a "smallest possible" question, so there are two halves: show that must be at least , then show that really works.
Step 1: pull out a factor. The polynomial equals at . By the factor theorem it has the factors , , and :
Here is another polynomial, and its coefficients are also whole numbers (positive, negative or zero). The reason: each factor starts with plain , so dividing by it with long division never creates a fraction.
Part 1: must be a multiple of .
- At we have , so the left side is . Work out the product of the four factors at each point:
| Equation | ||
|---|---|---|
- has whole-number coefficients, so , , , are whole numbers. The table then says is a multiple of , of and of .
- The smallest number that is a multiple of all three: , , , so we need . So is a multiple of .
- is odd, so the factor does not help; itself must be a multiple of . Since , .
Part 2: works.
6. With , the table tells us what must equal: , so
We need a polynomial with whole-number coefficients that hits these four values.
7. Build it in a form where each new term is zero at the earlier points:
Now find the numbers one at a time.
- : only survives, so .
- : , so .
- : , that is , so .
- : , that is , so .
8. All four numbers are whole numbers, so has whole-number coefficients, and then does too. It has at the odd points and at the even points.
So cannot be smaller than , and is possible.
The answer is .
Why this works
When a polynomial takes the same value at several points, subtract that value and factor: the new polynomial is zero at those points. Plugging in the other points then turns the conditions into "this number must be a multiple of that one", and the smallest number that meets all of them is the lower limit. For a "smallest possible" answer, also build an example that actually reaches it.
Alternative approach
If time is short, use Part 1 with the answer choices. Choice (A) fails: at , would have to be a multiple of , and it is not. Every other choice is a multiple of , so the smallest one that could work is . (Part 2 above confirms that it does.)
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
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 .
Review in the AoPS books
- Intermediate Algebra, Chapter 6: Polynomial Division (§6.2, §6.4)
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Algebra, Chapter 11: Special Factorizations
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.