Difference between revisions of "2005 AIME II Problems/Problem 1"
Ragnarok23 (talk | contribs) |
(→Problem) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | + | A game uses a deck of <math> n </math> different cards, where <math> n </math> is an integer and <math> n \geq 6. </math> The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find <math> n. </math> | |
+ | |||
== Solution == | == Solution == | ||
== See Also == | == See Also == | ||
*[[2005 AIME II Problems]] | *[[2005 AIME II Problems]] |
Revision as of 23:16, 8 July 2006
Problem
A game uses a deck of different cards, where
is an integer and
The number of possible sets of 6 cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn. Find