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 "2007 AIME II Problems/Problem 1"

(wik)
m (→‎Problem)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
−
A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in <math>2007</math>. No character may appear in a [[sequence]] more times than it appears among the four letters in AIME or the four digits in <math>2007</math>. A set of plates in which each possible sequence appears exactly once contains <math>N</math> license plates. Find <math>\frac{N}{10}</math>.
+
A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in <math>2007</math>. No character may appear in a [[sequence]] more times than it appears among the four letters in AIME or the four digits in <math>2007</math>. A set of plates in which each possible sequence appears exactly once contains <math>N</math> license plates. Find <math>\frac{N}{1000}</math>.
  
 
== Solution ==
 
== Solution ==

Revision as of 17:19, 13 December 2010

Problem

A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in $2007$. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in $2007$. A set of plates in which each possible sequence appears exactly once contains $N$ license plates. Find $\frac{N}{1000}$.

Solution

There are 7 different characters that can be picked, with 0 being the only number that can be repeated twice.

  • If $0$ appears 0 or 1 times amongst the sequence, there are $\frac{7!}{(7-5)!} = 2520$ sequences possible.
  • If $0$ appears twice in the sequence, there are ${5\choose2} = 10$ places to place the $0$s. There are $\frac{6!}{(6-3)!} = 120$ ways to place the remaining three characters. Totally, that gives us $10 \cdot 120 = 1200$.

Thus, $\displaystyle N = 2520 + 1200 = 3720$, and $\frac{N}{10} = 372$.

See also

2007 AIME II (Problems • Answer Key • Resources)
Preceded by
First Question 		Followed by
Problem 2
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_AIME_II_Problems/Problem_1&oldid=36160"