2019 AMC 12A Problem 13
Problem 13 of 25IntermediateNumber TheoryCounting & Probability
How many ways are there to paint each of the integers 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 and have no proper divisors here, giving choices each.
Along the chain there are colorings. Number must differ from giving choices once is set.
Number must differ from both and Summing over the colors of and (equal in pairs, unequal in pairs), the combined factor for totals
Multiplying by the ways for and gives
Thus, the correct answer is E.