Art of Problem Solving

2024 AMC 8 Problems/Problem 7: Difference between revisions

B1022 (talk | contribs)
Lakme81 (talk | contribs)
Line 4: Line 4:


<math>\textbf{(A) } 21 \qquad \textbf{(B) } 37 \qquad \textbf{(C) } 43 \qquad \textbf{(D) } 44 \qquad \textbf{(E) } 259</math>
<math>\textbf{(A) } 21 \qquad \textbf{(B) } 37 \qquad \textbf{(C) } 43 \qquad \textbf{(D) } 44 \qquad \textbf{(E) } 259</math>
Note: This is not one of the AMC 8 2024 questions. Do not use this to cheat.


==Solution 1==
==Solution 1==

Revision as of 13:46, 22 January 2024

Problem

A person is playing one turn in a card-based game. They can play Card A for 1 point, Card B for 2 points, and Card C for 3 points. If order of the cards doesn't matter, how many possible ways are there to play one turn with 20 points considering that that there is an unlimited amount of each card?

$\textbf{(A) } 21 \qquad \textbf{(B) } 37 \qquad \textbf{(C) } 43 \qquad \textbf{(D) } 44 \qquad \textbf{(E) } 259$


Note: This is not one of the AMC 8 2024 questions. Do not use this to cheat.

Solution 1