2000 AIME I Problem 10

Below is the professionally curated solution for Problem 10 of the 2000 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2000 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:system of equationssummation

Difficulty rating: 2330

10.

A sequence of numbers x1,x2,x3,,x100x_1, x_2, x_3, \ldots, x_{100} has the property that, for every integer kk between 11 and 100,100, inclusive, the number xkx_k is kk less than the sum of the other 9999 numbers. Given that x50=mn,x_{50} = \frac{m}{n}, where mm and nn are relatively prime positive integers, find m+n.m + n.

Solution:

Let S=x1+x2++x100.S = x_1 + x_2 + \cdots + x_{100}. The condition says xk=(Sxk)k,x_k = (S - x_k) - k, so xk=Sk2x_k = \frac{S - k}{2} for every k.k. Summing over k=1,,100,k = 1, \ldots, 100, S=100S(1+2++100)2=100S50502,S = \frac{100S - (1 + 2 + \cdots + 100)}{2} = \frac{100S - 5050}{2}, so 98S=505098S = 5050 and S=252549.S = \frac{2525}{49}.

Then x50=S502=2525245098=7598,x_{50} = \frac{S - 50}{2} = \frac{2525 - 2450}{98} = \frac{75}{98}, which is in lowest terms, so m+n=75+98=173.m + n = 75 + 98 = 173.

← Problem 9Full ExamProblem 11

Problem 10 in Other Years