2019 AMC 12A Problems/Problem 13

Revision as of 16:12, 9 February 2019 by P groudon (talk | contribs) (Created page with "==Problem== How many ways are there to paint each of the integers <math>2, 3, \dots, 9</math> either red, green, or blue so that each number has a different color from each o...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

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

$\textbf{(A)}\ 144\qquad\textbf{(B)}\ 216\qquad\textbf{(C)}\ 256\qquad\textbf{(D)}\ 384\qquad\textbf{(E)}\ 432$

Solution

See Also

2019 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 12
Followed by
Problem 14
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png