Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2004 AMC 8 Problems/Problem 2"

(→‎Solution)
(→‎Solution 2)
Line 7: Line 7:
 
Note that the four-digit number must start with either a <math>2</math> or a <math>4</math>. The four-digit numbers that start with <math>2</math> are <math>2400, 2040</math>, and <math>2004</math>. The four-digit numbers that start with <math>4</math> are <math>4200, 4020</math>, and <math>4002</math> which gives us a total of <math>\boxed{\textbf{(B)}\ 6}</math>.
 
Note that the four-digit number must start with either a <math>2</math> or a <math>4</math>. The four-digit numbers that start with <math>2</math> are <math>2400, 2040</math>, and <math>2004</math>. The four-digit numbers that start with <math>4</math> are <math>4200, 4020</math>, and <math>4002</math> which gives us a total of <math>\boxed{\textbf{(B)}\ 6}</math>.
 
== Solution 2 ==
 
== Solution 2 ==
−
There is only 2 choices for the first digit because you can't have 0 as the first digit because it wouldn't be a 4 digit number. Then there are 3 choices for the second and 2 for the third and 1 for the fourth. Then just like you would do for how many ways there are to arrange a word with two of the same letters, you do <math>\frac{2 \cdot 3 \cdot 2 \cdot1}{2!}</math>. Which is <math>\frac{12}{2}</math> which is simplified to <math>\boxed{\textbf{(B)}\ 6}</math>
+
So, we can solve this problem easily, just by calculating how many choices there are for each of the four digits.
 +
First off, we know there are only <math>2</math> choices for the first digit, because <math>0</math> isn't a valid choice, or the number would a 3-digit number, which is not what we want.  
 +
We have <math>3</math> choices for the second digit, since we already used up one of the digits, and <math>2</math> choices for the third, and finally just <math>1</math> choices for the fourth and final one.  
 +
Now we all <math>2+3+2+1</math>, which is <math>\boxed{\textbf{(B)}\ 6}</math>.
  
 
==See Also==
 
==See Also==
 
{{AMC8 box|year=2004|num-b=1|num-a=3}}
 
{{AMC8 box|year=2004|num-b=1|num-a=3}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 03:25, 24 July 2018

Problem

How many different four-digit numbers can be formed be rearranging the four digits in $2004$?

$\textbf{(A)}\ 4\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 81$

Solution 1

Note that the four-digit number must start with either a $2$ or a $4$. The four-digit numbers that start with $2$ are $2400, 2040$, and $2004$. The four-digit numbers that start with $4$ are $4200, 4020$, and $4002$ which gives us a total of $\boxed{\textbf{(B)}\ 6}$.

Solution 2

So, we can solve this problem easily, just by calculating how many choices there are for each of the four digits. First off, we know there are only $2$ choices for the first digit, because $0$ isn't a valid choice, or the number would a 3-digit number, which is not what we want. We have $3$ choices for the second digit, since we already used up one of the digits, and $2$ choices for the third, and finally just $1$ choices for the fourth and final one. Now we all $2+3+2+1$, which is $\boxed{\textbf{(B)}\ 6}$.

See Also

2004 AMC 8 (Problems • Answer Key • Resources)
Preceded by
Problem 1 		Followed by
Problem 3
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_AMC_8_Problems/Problem_2&oldid=96475"