Difference between revisions of "2007 AIME II Problems/Problem 1"
(→Problem) |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | A mathematcal oragna'sdvasfvaefa | |
== Solution == | == Solution == | ||
Revision as of 18:34, 26 July 2017
Problem
A mathematcal oragna'sdvasfvaefa
Solution
There are 7 different characters that can be picked, with 0 being the only number that can be repeated twice.
- If
appears 0 or 1 times amongst the sequence, there are 
sequences possible. - If appears twice in the sequence, there are
places to place the s. There are 
ways to place the remaining three characters. Totally, that gives us 
.
appears 0 or 1 times amongst the sequence, there are 
sequences possible.
places to place the 
ways to place the remaining three characters. Totally, that gives us 
.Thus, 
, and 
.
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 | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
