AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
Personal tools

Mock AIME 1 2007-2008 Problems/Problem 2

From AoPSWiki

Problem

The expansion of (x+1)^n has 3 consecutive terms with coefficients in the ratio 1:2:3 that can be written in the form {n\choose k} : {n\choose k+1} : {n \choose k+2} Find the sum of all possible values of n+k.

Solution

By definition, {n\choose k} = \frac{n!}{k!(n-k)!}. The ratio of the first two terms give us that \begin{align*}\frac{1}{2} &= \frac{\frac{n!}{k!(n-k)!}}{\frac{n!}{(k+1)!(n-k-1)!}} = \frac{k+1}{n-k}\\ 2&=n-3k\end{al...The ratio of the second and third terms give us that \begin{align*}\frac{2}{3} &= \frac{\frac{n!}{(k+1)!(n-k-1)!}}{\frac{n!}{(k+2)!(n-k-2)!}} = \frac{k+2}{n-k-1}\\ 8&=2n-... This is a linear system of two equations with two unknowns, indicating that there is a unique solution. Solving by substitution or multiplying the top equation and subtracting, we find k = 4, n = 14. Thus, n+k=\boxed{018}.

See also

Mock AIME 1 2007-2008 (Problems, Source)
Preceded by
Problem 1 		Followed by
Problem 3
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/Mock_AIME_1_2007-2008_Problems/Problem_2"
Visit the AoPS Book Store.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us