2021 April MIMC 10 Problems/Problem 13

Revision as of 16:20, 22 April 2021 by Cellsecret (talk | contribs) (Created page with "Given that Giant want to put <math>12</math> green identical balls into <math>3</math> different boxes such that each box contains at least two balls, and that no box can cont...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Given that Giant want to put $12$ green identical balls into $3$ different boxes such that each box contains at least two balls, and that no box can contain $7$ or more balls. Find the number of ways that Giant can accomplish this.

$\textbf{(A)} ~0 \qquad\textbf{(B)} ~6 \qquad\textbf{(C)} ~7 \qquad\textbf{(D)} ~8 \qquad\textbf{(E)} ~19$

Solution

To be Released on April 26th.