Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1991 AIME Problems/Problem 3"

(→‎Solution)
(→‎Solution)
Line 13: Line 13:
 
</math>
 
</math>
  
−
Now, <math>\log(A_{k}^{})</math> keeps increasing with <math>k_{}^{}</math> as long as the arguments <math>\frac{(N-j+1)x}{j}>1</math> in each of the terms (recall that <math>\log y_{}^{} <0</math> if <math>0<y_{}^{}<1</math>). Therefore, the <math>k_{}^{}</math> that we are looking for must satisfy <math>\frac{(N-k+1)x}{k}>1</math>, that is <math>k<\frac{(N+1)x}{1+x}</math>.
+
Now, <math>\log(A_{k}^{})</math> keeps increasing with <math>k_{}^{}</math> as long as the arguments <math>\frac{(N-j+1)x}{j}>1</math> in each of the terms (recall that <math>\log y_{}^{} <0</math> if <math>0<y_{}^{}<1</math>). Therefore, the integer <math>k_{}^{}</math> that we are looking for must satisfy <math>\frac{(N-k+1)x}{k}>1</math>, that is <math>k<\frac{(N+1)x}{1+x}</math>.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=1991|num-b=2|num-a=4}}
 
{{AIME box|year=1991|num-b=2|num-a=4}}

Revision as of 20:19, 20 April 2007

Problem

Expanding $(1+0.2)^{1000}_{}$ by the binomial theorem and doing no further manipulation gives

${1000 \choose 0}(0.2)^0+{1000 \choose 1}(0.2)^1+{1000 \choose 2}(0.2)^2+\cdots+{1000 \choose 1000}(0.2)^{1000}$ $= A_0 + A_1 + A_2 + \cdots + A_{1000},$ where $A_k = {1000 \choose k}(0.2)^k$ for $k = 0,1,2,\ldots,1000$. For which $k_{}^{}$ is $A_k^{}$ the largest?

Solution

Let $0<x_{}^{}<1$. Then we may write $A_{k}^{}=\frac{N!}{k!(N-k)!}x^{k}=\frac{(N-k+1)!}{k!}x^{k}$. Taking logarithms in both sides of this last equation, and recalling that $\log(a_{}^{}b)=\log a + \log b$ (valid if $a_{}^{},b_{}^{}>0$), we have

$\log(A_{k})=\log\left[\frac{(N-k+1)!}{k!}x^{k}\right]=\sum_{j=1}^{k}\log\left[\frac{(N-j+1)x}{j}\right]\, .$

Now, $\log(A_{k}^{})$ keeps increasing with $k_{}^{}$ as long as the arguments $\frac{(N-j+1)x}{j}>1$ in each of the terms (recall that $\log y_{}^{} <0$ if $0<y_{}^{}<1$). Therefore, the integer $k_{}^{}$ that we are looking for must satisfy $\frac{(N-k+1)x}{k}>1$, that is $k<\frac{(N+1)x}{1+x}$.

See also

1991 AIME (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1991_AIME_Problems/Problem_3&oldid=14622"