AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

2000 AIME I Problems/Problem 10

From AoPSWiki

Problem

A sequence of numbers x_{1},x_{2},x_{3},\ldots,x_{100} has the property that, for every integer k between 1 and 100, inclusive, the number x_{k} is k less than the sum of the other 99 numbers. Given that x_{50} = m/n, where m and n are relatively prime positive integers, find m + n.

Solution

Let the sum of all of the terms in the sequence be \mathbb{S}. Then for each integer k, x_k = \mathbb{S}-x_k-k \Longrightarrow \mathbb{S} - 2x_k = k. Summing this up for all k from 1, 2, \ldots, 100,

\begin{align*}100\mathbb{S}-2(x_1 + x_2 + \cdots + x_{100}) &= 1 + 2 + \cdots + 100\\100\mathbb{S} - 2\mathbb{S} &= \...

Now, substituting for x_{50}, we get 2x_{50}=\frac{2525}{49}-50=\frac{75}{49} \Longrightarrow x_{50}=\frac{75}{98}, and the answer is 75+98=\boxed{173}.

See also

2000 AIME I (ProblemsResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us