Problem:
A game uses a deck of n different cards, where n is an integer and nβ₯6. 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 n.
Solution:
The conditions of the problem imply that (6nβ)=6(3nβ), so 6!(nβ6)!n!β=6. 3!(nβ3)!n!β. Then (nβ6)!(nβ3)!β=6 !, so (nβ3)(nβ4)(nβ5)=720=10β
9β
8. Thus n=13 is a solution, and because (nβ3)(nβ4)(nβ5) is increasing for nβ₯5, conclude that 13β is the only solution for nβ₯5.
The problems on this page are the property of the MAA's American Mathematics Competitions