Difference between revisions of "2016 AMC 8 Problems/Problem 17"

(Solution 1)
Line 1: Line 1:
 +
== Problem ==
 +
 
An ATM password at Fred's Bank is composed of four digits from <math>0</math> to <math>9</math>, with repeated digits allowable. If no password may begin with the sequence <math>9,1,1,</math> then how many passwords are possible?
 
An ATM password at Fred's Bank is composed of four digits from <math>0</math> to <math>9</math>, with repeated digits allowable. If no password may begin with the sequence <math>9,1,1,</math> then how many passwords are possible?
  
 
<math>\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999</math>
 
<math>\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999</math>
 +
 
==Solution 1==
 
==Solution 1==
 
For the first three digits, there are <math>10^3-1=999</math> combinations since <math>911</math> is not allowed. For the final digit, any of the <math>10</math> numbers are allowed. <math>999 \cdot 10 = 9990 \rightarrow \boxed{\textbf{(D)}\ 9990}</math>
 
For the first three digits, there are <math>10^3-1=999</math> combinations since <math>911</math> is not allowed. For the final digit, any of the <math>10</math> numbers are allowed. <math>999 \cdot 10 = 9990 \rightarrow \boxed{\textbf{(D)}\ 9990}</math>

Revision as of 02:39, 16 January 2021

Problem

An ATM password at Fred's Bank is composed of four digits from $0$ to $9$, with repeated digits allowable. If no password may begin with the sequence $9,1,1,$ then how many passwords are possible?

$\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999$

Solution 1

For the first three digits, there are $10^3-1=999$ combinations since $911$ is not allowed. For the final digit, any of the $10$ numbers are allowed. $999 \cdot 10 = 9990 \rightarrow \boxed{\textbf{(D)}\ 9990}$

Solution 2

Counting the prohibited cases, we find that there are 10 of them. This is because we start with 9,1,1 and we can have any of the 10 digits for the last digit. So our answer is $10^4-10=\boxed{\textbf{(D)}\ 9990}.$

2016 AMC 8 (ProblemsAnswer KeyResources)
Preceded by
Problem 16
Followed by
Problem 18
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 AJHSME/AMC 8 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png