返回题库

AIME 1990 · 第 11 题

AIME 1990 — Problem 11

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Someone observed that 6!=89106! = 8 \cdot 9 \cdot 10. Find the largest positive integer nn^{}_{} for which n!n^{}_{}! can be expressed as the product of n3n - 3_{}^{} consecutive positive integers.

解析

Solution 1

The product of n3n - 3 consecutive integers can be written as (n3+a)!a!\frac{(n - 3 + a)!}{a!} for some integer aa. Thus, n!=(n3+a)!a!n! = \frac{(n - 3 + a)!}{a!}, from which it becomes evident that a3a \ge 3. Since (n3+a)!>n!(n - 3 + a)! > n!, we can rewrite this as n!(n+1)(n+2)(n3+a)a!=n!(n+1)(n+2)(n3+a)=a!\frac{n!(n+1)(n+2) \ldots (n-3+a)}{a!} = n! \Longrightarrow (n+1)(n+2) \ldots (n-3+a) = a!. For a=4a = 4, we get n+1=4!n + 1 = 4! so n=23n = 23. For greater values of aa, we need to find the product of a3a-3 consecutive integers that equals a!a!. nn can be approximated as a3a!^{a-3}\sqrt{a!}, which decreases as aa increases. Thus, n=23n = 23 is the greatest possible value to satisfy the given conditions.

Solution 2

Let the largest of the n3n-3 consecutive positive integers be kk. Clearly kk cannot be less than or equal to nn, else the product of n3n-3 consecutive positive integers will be less than n!n!.

Key observation: Now for nn to be maximum the smallest number (or starting number) of the n3n-3 consecutive positive integers must be minimum, implying that kk needs to be minimum. But the least k>nk > n is n+1n+1.

So the n3n-3 consecutive positive integers are 5,6,7,n+15, 6, 7…, n+1

So we have (n+1)!4!=n!\frac{(n+1)!}{4!} = n! n+1=24\Longrightarrow n+1 = 24 n=23\Longrightarrow n = 23

Generalization

Largest positive integer nn for which n!n! can be expressed as the product of nan-a consecutive positive integers is (a+1)!1(a+1)! - 1

For ex. largest nn such that product of n6n-6 consecutive positive integers is equal to n!n! is 7!1=50397!-1 = 5039

Proof: Reasoning the same way as above, let the largest of the nan-a consecutive positive integers be kk. Clearly kk cannot be less than or equal to nn, else the product of nan-a consecutive positive integers will be less than n!n!.

Now, observe that for nn to be maximum the smallest number (or starting number) of the nan-a consecutive positive integers must be minimum, implying that kk needs to be minimum. But the least k>nk > n is n+1n+1.

So the nan-a consecutive positive integers are a+2,a+3,n+1a+2, a+3, … n+1

So we have (n+1)!(a+1)!=n!\frac{(n+1)!}{(a+1)!} = n! n+1=(a+1)!\Longrightarrow n+1 = (a+1)! n=(a+1)!1\Longrightarrow n = (a+1)! -1

Kris17Kris17

Video Solution!!!

https://www.youtube.com/watch?v=H-ZmsYjF-xE