AMC 10 · 2014 · #19
Grade 8 algebranumber-theoryPick an answer.
Searching directly over k is hopeless: there are infinitely many rationals with |k| < 200, and for each one you would have to test whether a root happens to be an integer. So change focus (Tool #16): name the integer root instead (Tool #4) and let k be whatever that root forces it to be. The unknown then runs over integers, which can be listed. Two questions remain, and each has its own tool: how far can the integer root go before |k| reaches 200 (Tool #14, the boundary case), and does every root give a different k (needed before the list of roots may be counted as a list of k values, Tool #2).
Name the integer root
Naming the root gives the coefficient directly.
A root is just a number you can substitute without breaking the equation, and x=0 leaves the stray 12 behind.
6.EE.A.2Introduce A VariableFlip the search onto n
The search moves onto the root instead.
Picking the root first turns an unlimited hunt over fractions into a countable walk along the integers.
8.EE.C.7Change Focus Count The ComplementPush n to the boundary
The bound bites at a clean boundary.
The term 5n does all the growing while 12/n shrinks, so the cutoff sits where 5n alone reaches 200.
7.EE.B.4Extreme PrincipleMirror the negative roots
Negative roots mirror the positive ones.
The formula is odd, so the picture on the negative side is the positive side reflected through zero.
6.NS.C.7Look For A PatternCheck for repeated k values
No two roots give the same coefficient.
A collision would force two integers to multiply to a fraction, which integers cannot do.
A collision between two different roots would force whole numbers to multiply to a fraction, which they cannot.
▸ Why?
A product of whole numbers is a whole number, so a leftover fraction is impossible.
▸ Why?
So each root gives its own distinct value, and counting the roots counts the values exactly once each.
Tally the k values
The tally is 78, choice (E).
One input to one output, with no two inputs sharing an output, means counting inputs counts outputs.
8.F.A.1Make A Systematic ListDo not hunt for k — pick the integer root first, and k=-5n-12/n has no choice but to follow.
- Name the integer root
- Flip the search onto n
- Push n to the boundary
- Mirror the negative roots
- Check for repeated k values
- Tally the k values