AMC 10 · 2007 · #25
Grade 6 number-theoryPick an answer.
AMC 10 2007 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
Two separate fractions are hard to judge, so first combine them into one fraction (9a²+14b²)/9ab; then "is an integer" simply means the bottom divides the top. Tool #7 (Identify Subproblems) splits that one divisibility question into smaller pieces: what must a divide, what must b divide, and how does the shared factor of 3 behave. The coprime rule turns each piece into a short divisor list, so a and b each have only a handful of possible values. Tool #2 (Make a Systematic List) then tests those few candidates, and Tool #3 (Eliminate Possibilities) throws out the ones that fail, leaving the exact count.
Combine into one fraction
Over the common bottom 9ab the sum is , so being a whole number just means 9ab divides 9a²+14b².
One fraction is easy to test for wholeness: the bottom just has to divide the top.
6.EE.A.2Identify SubproblemsWhat a must divide
The bottom's a must divide 9a²+14b²; it already divides 9a² and shares nothing with b, so a divides 14: a is 1, 2, 7, or 14.
Coprime numbers share nothing, so a factor of the bottom cannot hide inside b — it must live in the 14.
Numbers that share no common factor hide nothing in each other, so a divisor must live in the other part.
▸ Why?
Every number has exactly one prime recipe, so a prime missing from one cannot be supplied by it.
▸ Why?
Divisors come in pairs that multiply back to the number, so the candidates are a short, closed list.
What b must divide
Likewise b must divide 9a²+14b²; it already divides 14b² and shares nothing with a, so b divides 9: b is 1, 3, or 9.
The same coprime trick pins b to the divisors of the 9 it sits under.
6.NS.B.4Identify SubproblemsNarrow to a short candidate list
Divisor lists are necessary, not sufficient: the bottom still holds a 9 beside b, so test the three cases b = 1, 3, 9.
The candidates are few, so a short organised check will settle it.
4.OA.B.4Make A Systematic ListTest each value of b
b = 1 would need 9a to divide 14 — never; b = 9 needs 9 to divide a²+126, which fails — only b = 3 works, leaving .
The shared factor of 3 only lines up when b is exactly 3; too little (b=1) or too much (b=9) breaks it.
4.OA.B.4Eliminate PossibilitiesCount the surviving pairs
With b = 3 every allowed a works: (1,3), (2,3), (7,3), (14,3) — 4 pairs, choice (A).
One good value of b, four good values of a: multiply to four honest pairs.
4.OA.B.4Eliminate PossibilitiesGlue the fractions into one, then let the no-shared-factor rule force each letter onto a tiny divisor list — after that you only have a handful of cases to check.
- Combine into one fraction
- What a must divide
- What b must divide
- Narrow to a short candidate list
- Test each value of b
- Count the surviving pairs