2025 AMC 8 Problems/Problem 9

Revision as of 09:33, 23 February 2024 by Theumbrellaacademy (talk | contribs) (2025 AMC 8 Problem 9)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

There are $10$ matchsticks on the table. Percy takes $1$, $2$ or $3$ matchsticks each time. How many ways are there for him to take all the matchsticks?

$\textbf{(A)}\ 274 \qquad \textbf{(B)}\ 275 \qquad \textbf{(C)}\ 276 \qquad \textbf{(D)}\ 280 \qquad \textbf{(E)}\ 295$