Art of Problem Solving

2023 AMC 10B Problems/Problem 11: Difference between revisions

Nattyk608 (talk | contribs)
Duoduoluo (talk | contribs)
No edit summary
Line 1: Line 1:
==Problem==
==Problem==
Suzanne went to the bank and withdrew <math>\$800</math>. The teller gave her this amount using <math>\$20</math> bills, <math>\$50</math> bills, and <math>\$100</math> bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?
Suzanne went to the bank and withdrew <imath>\$800</imath>. The teller gave her this amount using <imath>\$20</imath> bills, <imath>\$50</imath> bills, and <imath>\$100</imath> bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?


<math>\textbf{(A) } 45 \qquad \textbf{(B) } 21 \qquad \text{(C) } 36 \qquad \text{(D) } 28 \qquad \text{(E) } 32</math>
<imath>\textbf{(A) } 45 \qquad \textbf{(B) } 21 \qquad \text{(C) } 36 \qquad \text{(D) } 28 \qquad \text{(E) } 32</imath>


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


We let the number of <math>\$20</math>, <math>\$50</math>, and <math>\$100</math> bills be <math>a,b,</math> and <math>c,</math> respectively.  
We let the number of <imath>\$20</imath>, <imath>\$50</imath>, and <imath>\$100</imath> bills be <imath>a,b,</imath> and <imath>c,</imath> respectively.  


We are given that <math>20a+50b+100c=800.</math> Dividing both sides by <math>10</math>, we see that <math>2a+5b+10c=80.</math>  
We are given that <imath>20a+50b+100c=800.</imath> Dividing both sides by <imath>10</imath>, we see that <imath>2a+5b+10c=80.</imath>  


We divide both sides of this equation by <math>5</math>: <math>\dfrac25a+b+2c=16.</math> Since <math>b+2c</math> and <math>16</math> are integers, <math>\dfrac25a</math> must also be an integer, so <math>a</math> must be divisible by <math>5</math>. Let <math>a=5d,</math> where <math>d</math> is some positive integer.  
We divide both sides of this equation by <imath>5</imath>: <imath>\dfrac25a+b+2c=16.</imath> Since <imath>b+2c</imath> and <imath>16</imath> are integers, <imath>\dfrac25a</imath> must also be an integer, so <imath>a</imath> must be divisible by <imath>5</imath>. Let <imath>a=5d,</imath> where <imath>d</imath> is some positive integer.  


We can then write <math>2\cdot5d+5b+10c=80.</math> Dividing both sides by <math>5</math>, we have <math>2d+b+2c=16.</math> We divide by <math>2</math> here to get <math>d+\dfrac b2+c=8.</math> <math>d+c</math> and <math>8</math> are both integers, so <math>\dfrac b2</math> is also an integer. <math>b</math> must be divisible by <math>2</math>, so we let <math>b=2e</math>.  
We can then write <imath>2\cdot5d+5b+10c=80.</imath> Dividing both sides by <imath>5</imath>, we have <imath>2d+b+2c=16.</imath> We divide by <imath>2</imath> here to get <imath>d+\dfrac b2+c=8.</imath> <imath>d+c</imath> and <imath>8</imath> are both integers, so <imath>\dfrac b2</imath> is also an integer. <imath>b</imath> must be divisible by <imath>2</imath>, so we let <imath>b=2e</imath>.  


We now have <math>2d+2e+2c=16\implies d+e+c=8</math>. Every substitution we made is part of a bijection (i.e. our choices were one-to-one); thus, the problem is now reduced to counting how many ways we can have <math>d,e,</math> and <math>c</math> such that they add to <math>8</math>.  
We now have <imath>2d+2e+2c=16\implies d+e+c=8</imath>. Every substitution we made is part of a bijection (i.e. our choices were one-to-one); thus, the problem is now reduced to counting how many ways we can have <imath>d,e,</imath> and <imath>c</imath> such that they add to <imath>8</imath>.  


We still have another constraint left, that each of <math>d,e,</math> and <math>c</math> must be at least <math>1</math>. For <math>n\in\{d,e,c\}</math>, let <math>n'=n-1.</math> We are now looking for how many ways we can have <math>d'+e'+c'=8-1-1-1=5.</math>  
We still have another constraint left, that each of <imath>d,e,</imath> and <imath>c</imath> must be at least <imath>1</imath>. For <imath>n\in\{d,e,c\}</imath>, let <imath>n'=n-1.</imath> We are now looking for how many ways we can have <imath>d'+e'+c'=8-1-1-1=5.</imath>  


We use a classic technique for solving these sorts of problems: stars and bars. We have <math>5</math> stars and <math>3</math> groups, which implies <math>2</math> bars. Thus, the total number of ways is <math>\dbinom{5+2}2=\dbinom72=21.</math>  
We use a classic technique for solving these sorts of problems: stars and bars. We have <imath>5</imath> stars and <imath>3</imath> groups, which implies <imath>2</imath> bars. Thus, the total number of ways is <imath>\dbinom{5+2}2=\dbinom72=21.</imath>  


~Technodoggo ~minor edits by lucaswujc
~Technodoggo ~minor edits by lucaswujc
Line 24: Line 24:
==Solution 2==
==Solution 2==


Denote by <math>x</math>, <math>y</math>, <math>z</math> the amount of \$20 bills, \$50 bills and \$100 bills, respectively.
Denote by <imath>x</imath>, <imath>y</imath>, <imath>z</imath> the amount of \$20 bills, \$50 bills and \$100 bills, respectively.
Thus, we need to find the number of tuples <math>\left( x , y, z \right)</math> with <math>x, y, z \in \Bbb N</math> that satisfy
Thus, we need to find the number of tuples <imath>\left( x , y, z \right)</imath> with <imath>x, y, z \in \Bbb N</imath> that satisfy
<cmath>
<cmath>
\[
\[
Line 39: Line 39:
</cmath>
</cmath>


Second, we must have <math>5 |x</math>. Denote <math>x = 5 x'</math>.
Second, we must have <imath>5 |x</imath>. Denote <imath>x = 5 x'</imath>.
The above equation can be converted to
The above equation can be converted to
<cmath>
<cmath>
Line 47: Line 47:
</cmath>
</cmath>


Third, we must have <math>2 | y</math>. Denote <math>y = 2 y'</math>.
Third, we must have <imath>2 | y</imath>. Denote <imath>y = 2 y'</imath>.
The above equation can be converted to
The above equation can be converted to
<cmath>
<cmath>
Line 55: Line 55:
</cmath>
</cmath>


Denote <math>x'' = x' - 1</math>, <math>y'' = y' - 1</math> and <math>z'' = z - 1</math>.
Denote <imath>x'' = x' - 1</imath>, <imath>y'' = y' - 1</imath> and <imath>z'' = z - 1</imath>.
Thus, the above equation can be written as
Thus, the above equation can be written as
<cmath>
<cmath>
Line 63: Line 63:
</cmath>
</cmath>


Therefore, the number of non-negative integer solutions <math>\left( x'', y'', z'' \right)</math> is <math>\binom{5 + 3 - 1}{3 - 1} = \boxed{\textbf{(B) 21}}</math>.
Therefore, the number of non-negative integer solutions <imath>\left( x'', y'', z'' \right)</imath> is <imath>\binom{5 + 3 - 1}{3 - 1} = \boxed{\textbf{(B) 21}}</imath>.


~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)


== Solution 3 ==
== Solution 3 ==
To start, we simplify things by dividing everything by <math>10</math>, the resulting equation is <math>2x+5y+10z=80</math>, and since the problem states that we have at least one of each, we simplify this to <math>2x+5y+10z=63</math>. Note that since the total is odd, we need an odd number of <math>5</math> dollar bills. We proceed using casework.  
To start, we simplify things by dividing everything by <imath>10</imath>, the resulting equation is <imath>2x+5y+10z=80</imath>, and since the problem states that we have at least one of each, we simplify this to <imath>2x+5y+10z=63</imath>. Note that since the total is odd, we need an odd number of <imath>5</imath> dollar bills. We proceed using casework.  


Case 1: One <math>5</math> dollar bill
Case 1: One <imath>5</imath> dollar bill


<math>2x+10z=58</math>, we see that <math>10z</math> can be <math>0,10,20,30,40,50 </math>  or <math>6</math> ways
<imath>2x+10z=58</imath>, we see that <imath>10z</imath> can be <imath>0,10,20,30,40,50 </imath>  or <imath>6</imath> ways


Case 2: Three <math>5</math> dollar bills
Case 2: Three <imath>5</imath> dollar bills


<math>2x+10z=48</math>, like before we see that <math>10z</math> can be <math>0,10,20,30,40</math>, so <math>5</math> ways
<imath>2x+10z=48</imath>, like before we see that <imath>10z</imath> can be <imath>0,10,20,30,40</imath>, so <imath>5</imath> ways


Now we should start to see a pattern emerge, each case there is <math>1</math> less way to sum to <math>80</math>, so the answer is just <math>\frac{6(6+1)}{2}=\boxed{\textbf{(B)}~21}</math>.
Now we should start to see a pattern emerge, each case there is <imath>1</imath> less way to sum to <imath>80</imath>, so the answer is just <imath>\frac{6(6+1)}{2}=\boxed{\textbf{(B)}~21}</imath>.


~andyluo
~andyluo
Line 90: Line 90:
Now there are five left--so we use stars and bars.
Now there are five left--so we use stars and bars.


5 chunks, 3 categories or 2 bars. This gives us <math>\binom{5+2}{2}=\boxed{\textbf{(B) 21}}</math>
5 chunks, 3 categories or 2 bars. This gives us <imath>\binom{5+2}{2}=\boxed{\textbf{(B) 21}}</imath>


~not_slay
~not_slay
Line 96: Line 96:
== Solution 5 (generating functions) ==
== Solution 5 (generating functions) ==


The problem is equivalent to the number of ways to make <math>\$80</math> from <math>\$2</math> bills, <math>\$5</math> bills, and <math>\$10</math> bills. We can use generating functions to find the coefficient of <math>x^{80}</math>:
The problem is equivalent to the number of ways to make <imath>\$80</imath> from <imath>\$2</imath> bills, <imath>\$5</imath> bills, and <imath>\$10</imath> bills. We can use generating functions to find the coefficient of <imath>x^{80}</imath>:


The <math>\$2</math> bills provide <math>1+x^2+x^4+x^6 \cdots = \frac{1}{1-x^2},</math>
The <imath>\$2</imath> bills provide <imath>1+x^2+x^4+x^6 \cdots = \frac{1}{1-x^2},</imath>


The <math>\$5</math> bills provide <math>1+x^5+x^{10}+x^{15} \cdots = \frac{1}{1-x^5},</math>
The <imath>\$5</imath> bills provide <imath>1+x^5+x^{10}+x^{15} \cdots = \frac{1}{1-x^5},</imath>


The <math>\$10</math> bills provide <math>1+x^{10}+x^{20}+x^{30} \cdots = \frac{1}{1-x^{10}}.</math>
The <imath>\$10</imath> bills provide <imath>1+x^{10}+x^{20}+x^{30} \cdots = \frac{1}{1-x^{10}}.</imath>


Multiplying, we get <math>(1-x^{2})^{-1}(1-x^{5})^{-1}(1-x^{10})^{-1}.</math>
Multiplying, we get <imath>(1-x^{2})^{-1}(1-x^{5})^{-1}(1-x^{10})^{-1}.</imath>


== Solution 6 (easy logic) ==
== Solution 6 (easy logic) ==
Line 148: Line 148:


~SwordAxe (PM me if you have any questions! :))
~SwordAxe (PM me if you have any questions! :))
EDIT: use /$ for the dollar signs
EDIT: use /<imath> for the dollar signs
 
\documentclass{article}
\usepackage{amsmath, amssymb}
\usepackage{amsthm}
\usepackage{enumitem}
\usepackage{tcolorbox} % Package to box the final answer
\begin{document}
 
\section*{Solution 7}
 
Because the problem states that at least one of each type of bill must be used, we can subtract 20, 50, and 100 from 800, giving us 630. Let the new amount of </imath>\$20<imath> bills be </imath>x<imath>, </imath>\$50<imath> bills be </imath>y<imath>, and </imath>\$100<imath> bills be </imath>z<imath>. Notice that there must be more than one type of bill used, as 630 cannot be made from just 20, 50, or 100. Now, we can do the casework.
 
\subsection*{Case 1: Uses \$20 and \$50}
\begin{align*}
20x + 50y &= 630 \\
2x+5y &= 63
\end{align*}
</imath>y<imath> can be </imath>1, 3, 5, 7, 9,<imath> or </imath>11 \implies 6<imath> Solutions
 
\subsection*{Case 2: \$50 and \$100}
Impossible, cannot make 630
 
\subsection*{Case 3: \$20 and \$100}
Impossible, cannot make 630
 
\subsection*{Case 4: \$20, \$50, and \$100}
\begin{align*}
20x + 50y + 100z &= 630 \\
2x + 5y + 10z &= 63
\end{align*}
 
\subsubsection*{Subcase 1: If </imath>z = 1<imath>}
\begin{align*}
2x + 5y &= 53
\end{align*}
</imath>y<imath> can be </imath>1,3,5,7,<imath> or </imath>9 \implies 5<imath> solutions
 
\subsubsection*{Subcase 2: If </imath>z = 2<imath>}
\begin{align*}
2x + 5y &= 43
\end{align*}
</imath>y<imath> can be </imath>1,3,5,<imath> or </imath>7 \implies 4<imath> solutions
 
As you probably guessed, the pattern continues, and when </imath>z<imath> is </imath>3, 4,<imath> and </imath>5<imath>, there are </imath>3, 2,<imath> and </imath>1<imath> solutions, respectively.
 
In total, for Case 4, there is </imath>5+4+3+2+1 = 15<imath> solutions.
 
Thus, in total, there are </imath>6+15 =$
\begin{tcolorbox}[colback=white!5!white, colframe=black!75!black, boxsep=5pt, arc=3pt, auto outer arc, left skip=1cm, right skip=1cm]
\centering
\textbf{21} solutions
\end{tcolorbox}
 
\end{document}
 


==Video Solution 1 by OmegaLearn==
==Video Solution 1 by OmegaLearn==

Revision as of 21:39, 11 November 2025

Problem

Suzanne went to the bank and withdrew $\$800$. The teller gave her this amount using $\$20$ bills, $\$50$ bills, and $\$100$ bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?

$\textbf{(A) } 45 \qquad \textbf{(B) } 21 \qquad \text{(C) } 36 \qquad \text{(D) } 28 \qquad \text{(E) } 32$

Solution 1

We let the number of $\$20$, $\$50$, and $\$100$ bills be $a,b,$ and $c,$ respectively.

We are given that $20a+50b+100c=800.$ Dividing both sides by $10$, we see that $2a+5b+10c=80.$

We divide both sides of this equation by $5$: $\dfrac25a+b+2c=16.$ Since $b+2c$ and $16$ are integers, $\dfrac25a$ must also be an integer, so $a$ must be divisible by $5$. Let $a=5d,$ where $d$ is some positive integer.

We can then write $2\cdot5d+5b+10c=80.$ Dividing both sides by $5$, we have $2d+b+2c=16.$ We divide by $2$ here to get $d+\dfrac b2+c=8.$ $d+c$ and $8$ are both integers, so $\dfrac b2$ is also an integer. $b$ must be divisible by $2$, so we let $b=2e$.

We now have $2d+2e+2c=16\implies d+e+c=8$. Every substitution we made is part of a bijection (i.e. our choices were one-to-one); thus, the problem is now reduced to counting how many ways we can have $d,e,$ and $c$ such that they add to $8$.

We still have another constraint left, that each of $d,e,$ and $c$ must be at least $1$. For $n\in\{d,e,c\}$, let $n'=n-1.$ We are now looking for how many ways we can have $d'+e'+c'=8-1-1-1=5.$

We use a classic technique for solving these sorts of problems: stars and bars. We have $5$ stars and $3$ groups, which implies $2$ bars. Thus, the total number of ways is $\dbinom{5+2}2=\dbinom72=21.$

~Technodoggo ~minor edits by lucaswujc

Solution 2

Denote by $x$, $y$, $z$ the amount of \$20 bills, \$50 bills and \$100 bills, respectively. Thus, we need to find the number of tuples $\left( x , y, z \right)$ with $x, y, z \in \Bbb N$ that satisfy \[ 20 x + 50 y + 100 z = 800.  \]

First, this equation can be simplified as \[ 2 x + 5 y + 10 z = 80. \]

Second, we must have $5 |x$. Denote $x = 5 x'$. The above equation can be converted to \[ 2 x' + y + 2 z = 16 . \]

Third, we must have $2 | y$. Denote $y = 2 y'$. The above equation can be converted to \[ x' + y' + z = 8 . \]

Denote $x'' = x' - 1$, $y'' = y' - 1$ and $z'' = z - 1$. Thus, the above equation can be written as \[ x'' + y'' + z'' = 5 . \]

Therefore, the number of non-negative integer solutions $\left( x'', y'', z'' \right)$ is $\binom{5 + 3 - 1}{3 - 1} = \boxed{\textbf{(B) 21}}$.

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Solution 3

To start, we simplify things by dividing everything by $10$, the resulting equation is $2x+5y+10z=80$, and since the problem states that we have at least one of each, we simplify this to $2x+5y+10z=63$. Note that since the total is odd, we need an odd number of $5$ dollar bills. We proceed using casework.

Case 1: One $5$ dollar bill

$2x+10z=58$, we see that $10z$ can be $0,10,20,30,40,50$ or $6$ ways

Case 2: Three $5$ dollar bills

$2x+10z=48$, like before we see that $10z$ can be $0,10,20,30,40$, so $5$ ways

Now we should start to see a pattern emerge, each case there is $1$ less way to sum to $80$, so the answer is just $\frac{6(6+1)}{2}=\boxed{\textbf{(B)}~21}$.

~andyluo

Solution 4

We notice that each \$100 can be split 3 ways: 5 \$20 dollar bills, 2 \$50 dollar bills, or 1 \$100 dollar bill.

There are 8 of these \$100 chunks in total--take away 3 as each split must be used at least once.

Now there are five left--so we use stars and bars.

5 chunks, 3 categories or 2 bars. This gives us $\binom{5+2}{2}=\boxed{\textbf{(B) 21}}$

~not_slay

Solution 5 (generating functions)

The problem is equivalent to the number of ways to make $\$80$ from $\$2$ bills, $\$5$ bills, and $\$10$ bills. We can use generating functions to find the coefficient of $x^{80}$:

The $\$2$ bills provide $1+x^2+x^4+x^6 \cdots = \frac{1}{1-x^2},$

The $\$5$ bills provide $1+x^5+x^{10}+x^{15} \cdots = \frac{1}{1-x^5},$

The $\$10$ bills provide $1+x^{10}+x^{20}+x^{30} \cdots = \frac{1}{1-x^{10}}.$

Multiplying, we get $(1-x^{2})^{-1}(1-x^{5})^{-1}(1-x^{10})^{-1}.$

Solution 6 (easy logic)

There aren't dollar signs because the $latex$ thinks they're latex symbols. If you find how to override this error, please edit this. There's no $latex$ here but feel free to add some! ~SwordAxe

We can see in the problem that the teller gave her at least one of $\$20$, $\$50$, and $\$100$. Therefore, she has 800 - 20 - 50 - 100 = 630 "left over".

Since all bills and 630 are multiples of 10, we can divide by ten. ==> Question becomes: How many different collections of 2, 5, and 10 could she get if her total was 63?

We notice that because 63 is odd, we need an odd amount of 5 bills. (2 and 10 are both even, and 63 is not a multiple of 5, so we need 2 and/or 10 bills. PM SwordAxe if you don't get this.)

We can do casework.

1: She gets one 5 (50) dollar bill. She has 58 (580) left.

 1) She is given only 2 dollar (20) bills => ONE COLLECTION (all 20 bills with one 50)
 2) She is given one 10 dollar (100) bill
      1. The rest of the money is given in 2 dollar(20) dollar bills. => ONE COLLECTION (one 100 and rest 20 with one 50)
      2. She is given another 10 dollar (100) bill
            I) The rest of the money is given in 2 dollar (20) dollar bills. => ONE COLLECTION (two 100, one 50, and rest 20)
            II) She is given another 10 dollar (100) bill
                   a) The rest of the money is given in 2 dollar (20) dollar bills. => ONE COLLECTION (three 100, one 50, and rest 20)
                   b) She is given another 10 dollar (100) bill.
                         1) The rest of the money is given in 2 dollar (20) dollar bills  => ONE COLLECTION (following same pattern)
                         2)  AND SO ON...

This looks very tedious, but draw a simple tree diagram, and you'll see that its very easy!

If she gets one 50, there are 6 ways If she gets three 50, there are 5 ways ... If she gets nine 50, there are 2 ways If she gets eleven 50, there is one way

We can add them all up, with a grand sum of 6+5+4+3+2+1 = 21.

Therefore, we get the answer (B) 21.

~SwordAxe (PM me if you have any questions! :)) EDIT: use /$for the dollar signs

\documentclass{article} \usepackage{amsmath, amssymb} \usepackage{amsthm} \usepackage{enumitem} \usepackage{tcolorbox} % Package to box the final answer \begin{document}

\section*{Solution 7}

Because the problem states that at least one of each type of bill must be used, we can subtract 20, 50, and 100 from 800, giving us 630. Let the new amount of$ (Error compiling LaTeX. Unknown error_msg)\$20$bills be$x$,$\$50$bills be$y$, and$\$100$bills be$z$. Notice that there must be more than one type of bill used, as 630 cannot be made from just 20, 50, or 100. Now, we can do the casework.

\subsection*{Case 1: Uses \$20 and \$50} \begin{align*} 20x + 50y &= 630 \\ 2x+5y &= 63 \end{align*}$ (Error compiling LaTeX. Unknown error_msg)y$can be$1, 3, 5, 7, 9,$or$11 \implies 6$Solutions

\subsection*{Case 2: \$50 and \$100} Impossible, cannot make 630

\subsection*{Case 3: \$20 and \$100} Impossible, cannot make 630

\subsection*{Case 4: \$20, \$50, and \$100} \begin{align*} 20x + 50y + 100z &= 630 \\ 2x + 5y + 10z &= 63 \end{align*}

\subsubsection*{Subcase 1: If$ (Error compiling LaTeX. Unknown error_msg)z = 1$} \begin{align*} 2x + 5y &= 53 \end{align*}$ (Error compiling LaTeX. Unknown error_msg)y$can be$1,3,5,7,$or$9 \implies 5$solutions

\subsubsection*{Subcase 2: If$ (Error compiling LaTeX. Unknown error_msg)z = 2$} \begin{align*} 2x + 5y &= 43 \end{align*}$ (Error compiling LaTeX. Unknown error_msg)y$can be$1,3,5,$or$7 \implies 4$solutions

As you probably guessed, the pattern continues, and when$ (Error compiling LaTeX. Unknown error_msg)z$is$3, 4,$and$5$, there are$3, 2,$and$1$solutions, respectively.

In total, for Case 4, there is$ (Error compiling LaTeX. Unknown error_msg)5+4+3+2+1 = 15$solutions.

Thus, in total, there are$ (Error compiling LaTeX. Unknown error_msg)6+15 =$ \begin{tcolorbox}[colback=white!5!white, colframe=black!75!black, boxsep=5pt, arc=3pt, auto outer arc, left skip=1cm, right skip=1cm] \centering \textbf{21} solutions \end{tcolorbox}

\end{document}


Video Solution 1 by OmegaLearn

https://youtu.be/UeX3eEwRS9I

Video Solution 2 by SpreadTheMathLove

https://www.youtube.com/watch?v=sfZRRsTimmE

Video Solution 3 by paixiao

https://youtu.be/EvA2Nlb7gi4?si=fVLG8gMTIC5XkEwP&t=89s This video link is invalid now.

Video Solution 4

https://youtu.be/D-ZvFBiZsaY

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Video Solution 5 by Lucas637

https://www.youtube.com/watch?v=kXLHjclTD44&t=27s

2023 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 10
Followed by
Problem 12
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 10 Problems and Solutions