olymmath

AMC 12 2003a Problem 20

  • Paper

How many 1515-letter arrangements of 55 A's, 55 B's, and 55 C's have no A's in the first 55 letters, no B's in the next 55 letters, and no C's in the last 55 letters?

(A) ∑k=05(5k)3(B) 35⋅25(C) 215(D) 15!(5!)3(E) 315\textrm{(A)}\ \sum_{k=0}^{5}\binom{5}{k}^{3} \textrm{(B)}\ 3^{5}\cdot 2^{5} \textrm{(C)}\ 2^{15} \textrm{(D)}\ \frac{15!}{(5!)^{3}} \textrm{(E)}\ 3^{15}

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

A

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc12/2003a/p20 · Tag WHPXKF1DSM · Edit this page on GitHub · Keys: j next, k previous