2000 AIME II Problems/Problem 5: Difference between revisions
mNo edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Given eight distinguishable rings, let <math>n</math> be the number of possible five-ring arrangements on the four fingers (not the thumb) of one hand. The order of rings on each finger is significant, but it is not required that each finger have a ring. Find the leftmost three nonzero digits of <math>n</math>. | |||
== Solution == | == Solution == | ||
Revision as of 18:26, 11 November 2007
Problem
Given eight distinguishable rings, let
be the number of possible five-ring arrangements on the four fingers (not the thumb) of one hand. The order of rings on each finger is significant, but it is not required that each finger have a ring. Find the leftmost three nonzero digits of
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2000 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||