Skip to main content

2019 AMC 12A Problem 13

Problem 13 of 25IntermediateNumber TheoryCombinatoricsProblem-Solving Techniques

How many ways are there to paint each of the integers 2,2, 3,3, …,\ldots, 99 either red, green, or blue so that each number has a different color from each of its proper divisors?

Answer choices

Show solution

Solution

The primes 55 and 77 have no proper divisors here, giving 33 choices each. Along the chain 2→4→8,2 \to 4 \to 8, there are 3⋅2⋅1=63 \cdot 2 \cdot 1 = 6 colorings. Number 99 must differ from 3,3, giving 22 choices once 33 is set. Number 66 must differ from both 22 and 3.3. Summing over the colors of 22 and 33 (equal in 33 pairs, unequal in 66 pairs), the combined factor for 4,8,9,64, 8, 9, 6 totals 2⋅2⋅(3⋅2+6⋅1)=48.2 \cdot 2 \cdot (3 \cdot 2 + 6 \cdot 1) = 48. Multiplying by the 99 ways for 55 and 77 gives 48⋅9=432.48 \cdot 9 = 432. Thus, the correct answer is E.
AoPS wiki

Tagged: graph theory · divisibility · casework

More practice