AMC 10 · 2016 · #22

Grade 7 number-theory
lcmprime-factorizationexponents casework ↑ Prerequisites: lcmprime-factorization
📏 Long solution 💡 4 insights
Problem
Three pairwise least common multiples are given for three unknowns. Count the ordered triples.

Pick an answer.

(A)
15
(B)
16
(C)
24
(D)
27
(E)
64
How to solve
Strategy Identify Subproblems

An lcm condition on whole numbers is really three separate conditions hiding inside one, because lcm works prime by prime: the power of 2 in the answer depends only on the powers of 2 in the inputs, and likewise for 3 and 5. So tool #7 (Identify Subproblems) splits the hard count into three independent prime puzzles. Tool #4 (Introduce a Variable) names the exponent of each prime in x, y, z and turns each lcm into a clean 'the larger of two exponents equals this' statement. For each prime the allowed exponents form a tiny set, so tool #2 (Make a Systematic List) counts the valid exponent triples directly. The three counts multiply because the primes are chosen independently.

1STEP 1

Factor the three targets

All three targets factor into the same primes.

72 = 2³ · 3², 600 = 2³ · 3¹ · 5², 900 = 2² · 3² · 5²
2STEP 2

Turn each lcm into a max of exponents

Each condition is a maximum of exponents.

max(e_x,e_y), max(e_x,e_z), max(e_y,e_z) must match the target exponents for each prime
3STEP 3

Count the powers of 2

One prime allows 5 arrangements.

e_x=3; (e_y,e_z)∈{(2,0),(2,1),(2,2),(1,2),(0,2)}→ 5
4STEP 4

Count the powers of 3

The next allows 3.

e_y=2; (e_x,e_z)∈{(1,0),(0,1),(1,1)}→ 3
5STEP 5

Count the powers of 5

The last is forced completely.

e_x=0, e_y=0, e_z=2→ 1
6STEP 6

Multiply the independent counts

Multiplying gives 15, choice (A).

5 × 3 × 1 = 15 → (A)
Answer
15
The product 5×3×1=15 lands exactly on choice (A), and a sanity sweep over all exponent combinations (powers of 2 from 0 to 3, powers of 3 and 5 from 0 to 2) confirms exactly 15 triples satisfy all three lcm conditions. The constraints are tight: in every prime, one variable was forced to the top exponent, which is why no count blew up toward the larger choices like 27 or 64.
💡Key takeaway

Because lcm just takes the bigger exponent on each prime, split the problem into separate prime puzzles, count 5, 3, and 1 ways, then multiply to get 15.

  • Factor the three targets
  • Turn each lcm into a max of exponents
  • Count the powers of 2
  • Count the powers of 3
  • Count the powers of 5
  • Multiply the independent counts