返回题库

AIME 2005 II · 第 1 题

AIME 2005 II — Problem 1

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

A game uses a deck of nn different cards, where nn is an integer and n6.n \geq 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.n.

Video Solution

https://youtu.be/IRyWOZQMTV8?t=150

~ pi_is_3.14

解析

Solution

The number of ways to draw six cards from nn is given by the binomial coefficient (n6)=n(n1)(n2)(n3)(n4)(n5)654321{n \choose 6} = \frac{n\cdot(n-1)\cdot(n-2)\cdot(n-3)\cdot(n-4)\cdot(n-5)}{6\cdot5\cdot4\cdot3\cdot2\cdot1}.

The number of ways to choose three cards from nn is (n3)=n(n1)(n2)321{n\choose 3} = \frac{n\cdot(n-1)\cdot(n-2)}{3\cdot2\cdot1}.

We are given that (n6)=6(n3){n\choose 6} = 6 {n \choose 3}, so n(n1)(n2)(n3)(n4)(n5)654321=6n(n1)(n2)321\frac{n\cdot(n-1)\cdot(n-2)\cdot(n-3)\cdot(n-4)\cdot(n-5)}{6\cdot5\cdot4\cdot3\cdot2\cdot1} = 6 \frac{n\cdot(n-1)\cdot(n-2)}{3\cdot2\cdot1}.

Cancelling like terms, we get (n3)(n4)(n5)=720(n - 3)(n - 4)(n - 5) = 720.

We must find a factorization of the left-hand side of this equation into three consecutive integers. Since 720 is close to 93=7299^3=729, we try 8, 9, and 10, which works, so n3=10n - 3 = 10 and n=013n = \boxed{013}.