Difference between revisions of "1990 AIME Problems/Problem 11"
m (→Solution 2) |
m (→Generalization:) |
||
Line 20: | Line 20: | ||
== Generalization: == | == Generalization: == | ||
− | Largest positive integer n for which n! can be expressed as the product of | + | Largest positive integer <math>n</math> for which <math>n!</math> can be expressed as the product of <math>n-a</math> consecutive positive integers is <math>(a+1)! – 1</math> |
− | For ex. largest | + | For ex. largest 4n<math> such that product of </math>n-6<math> consecutive positive integers is equal to </math>n!<math> is </math>7!-1 = 5039<math> |
Proof: | Proof: | ||
− | Reasoning the same way as above, let the largest of the | + | Reasoning the same way as above, let the largest of the </math>n-a<math> consecutive positive integers be </math>k<math>. Clearly </math>k<math> cannot be less than or equal to </math>n<math>, else the product of </math>n-a<math> consecutive positive integers will be less than </math>n!<math>. |
− | Now, observe that for n to be maximum the smallest number (or starting number) of the | + | Now, observe that for </math>n<math> to be maximum the smallest number (or starting number) of the </math>n-a<math> consecutive positive integers must be minimum, implying that </math>k<math> needs to be minimum. But the least </math>k > n<math> is </math>n+1<math>. |
− | So the | + | So the </math>n-a<math> consecutive positive integers are </math>a+2, a+3, … n+1<math> |
− | So we have (n+1)! / (a+1)! = n! | + | So we have </math>\frac{(n+1)!}/{(a+1)!} = n!<math> |
− | + | </math>\Longrightarrow n+1 = (a+1)!<math> | |
− | + | </math>\Longrightarrow n = (a+1)! -1$ | |
Kris17 | Kris17 |
Revision as of 18:52, 15 March 2017
Problem
Someone observed that . Find the largest positive integer
for which
can be expressed as the product of
consecutive positive integers.
Solution 1
The product of consecutive integers can be written as
for some integer
. Thus,
, from which it becomes evident that
. Since
, we can rewrite this as
. For
, we get
so
. For greater values of
, we need to find the product of
consecutive integers that equals
.
can be approximated as
, which decreases as
increases. Thus,
is the greatest possible value to satisfy the given conditions.
Solution 2
Let the largest of the consecutive positive integers be
. Clearly
cannot be less than or equal to
, else the product of
consecutive positive integers will be less than
.
Key observation:
Now for to be maximum the smallest number (or starting number) of the
consecutive positive integers must be minimum, implying that
needs to be minimum. But the least
is
So the consecutive positive integers are
So we have
Kris17
Generalization:
Largest positive integer for which
can be expressed as the product of
consecutive positive integers is
For ex. largest 4nn-6
n!
7!-1 = 5039
n-a
k
k
n
n-a
n!$.
Now, observe that for$ (Error compiling LaTeX. Unknown error_msg)nn-a
k
k > n
n+1$.
So the$ (Error compiling LaTeX. Unknown error_msg)n-aa+2, a+3, … n+1
\frac{(n+1)!}/{(a+1)!} = n!$$ (Error compiling LaTeX. Unknown error_msg)\Longrightarrow n+1 = (a+1)!$$ (Error compiling LaTeX. Unknown error_msg)\Longrightarrow n = (a+1)! -1$
Kris17
See also
1990 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.