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

1984 AIME Problems/Problem 4

From AoPSWiki

Problem

Let \displaystyle S be a list of positive integers - not necessarily distinct - in which the number \displaystyle 68 appears. The arithmetic mean of the numbers in \displaystyle S is \displaystyle 56. However, if \displaystyle 68 is removed, the arithmetic mean of the numbers is \displaystyle 55. What's the largest number that can appear in \displaystyle S?

Solution

Suppose S has n members other than 68, and the sum of these members is s. Then we're given that \frac{s + 68}{n + 1} = 56 and \frac{s}{n} = 55. Multiplying to clear denominators, we have s + 68 = 56n + 56 and s = 55n so 68 = n + 56, n = 12 and s = 12\cdot 55 = 660. Because the sum and number of the elements of S are fixed, if we want to maximize the largest number in S, we should take all but one member of S to be as small as possible. Since all members of S are positive integers, the smallest possible value of a member is 1. Thus the largest possible element is 660 - 11 = \boxed{649}.

See also

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