Difference between revisions of "1984 AIME Problems/Problem 4"
MRENTHUSIASM (talk | contribs) m |
MRENTHUSIASM (talk | contribs) |
||
Line 17: | Line 17: | ||
Subtracting the equations, we get <math>68=n+56,</math> from which <math>n=12</math> and <math>s=660.</math> | Subtracting the equations, we get <math>68=n+56,</math> from which <math>n=12</math> and <math>s=660.</math> | ||
− | The sum of the twelve remaining numbers is <math>660.</math> To maximize the largest number, we minimize the other eleven numbers: We can have eleven <math>1</math>s and one <math>660-11\cdot1=\boxed{649}.</math> | + | The sum of the twelve remaining numbers is <math>660.</math> To maximize the largest number, we minimize the other eleven numbers: |
+ | |||
+ | We can have eleven <math>1</math>s and one <math>660-11\cdot1=\boxed{649}.</math> | ||
~JBL (Solution) | ~JBL (Solution) | ||
~MRENTHUSIASM (Reconstruction) | ~MRENTHUSIASM (Reconstruction) | ||
+ | |||
+ | == Solution 2 (One Variable) == | ||
+ | Suppose that <math>S</math> has <math>n</math> numbers other than <math>68.</math> We have the following table: | ||
+ | <cmath>\begin{array}{c|c|c|c} | ||
+ | & & & \\ [-2.5ex] | ||
+ | & \textbf{Count} & \textbf{Arithmetic Mean} & \textbf{Sum} \\ | ||
+ | \hline | ||
+ | & & & \\ [-2.5ex] | ||
+ | \textbf{Initial} & n+1 & 56 & 56(n+1) \\ | ||
+ | \hline | ||
+ | & & & \\ [-2.5ex] | ||
+ | \textbf{Final} & n & 55 & 55n | ||
+ | \end{array}</cmath> | ||
+ | |||
+ | ~MRENTHUSIASM | ||
== See also == | == See also == |
Revision as of 23:49, 21 June 2021
Problem
Let be a list of positive integers - not necessarily distinct - in which the number appears. The arithmetic mean of the numbers in is . However, if is removed, the arithmetic mean of the numbers is . What's the largest number that can appear in ?
Solution 1 (Two Variables)
Suppose that has numbers other than and the sum of these numbers is
We are given that Clearing denominators, we have Subtracting the equations, we get from which and
The sum of the twelve remaining numbers is To maximize the largest number, we minimize the other eleven numbers:
We can have eleven s and one
~JBL (Solution)
~MRENTHUSIASM (Reconstruction)
Solution 2 (One Variable)
Suppose that has numbers other than We have the following table:
~MRENTHUSIASM
See also
1984 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |