Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1982 AHSME Problems/Problem 28"
Line 11: Line 11:
 
Suppose that there are <math>n</math> positive integers in the set initially, so their sum is <math>\frac{n(n+1)}{2}</math> by arithmetic series. The average of the remaining numbers is minimized when <math>n</math> is erased, and is maximized when <math>1</math> is erased.
 
Suppose that there are <math>n</math> positive integers in the set initially, so their sum is <math>\frac{n(n+1)}{2}</math> by arithmetic series. The average of the remaining numbers is minimized when <math>n</math> is erased, and is maximized when <math>1</math> is erased.
  
−
It is clear that <math>n>1,</math> from which we write and solve a compound inequality for <math>n:</math>
+
It is clear that <math>n>1.</math> We write and solve a compound inequality for <math>n:</math>
 
<cmath>\begin{alignat*}{8}
 
<cmath>\begin{alignat*}{8}
 
\frac{\frac{n(n+1)}{2}-n}{n-1} &\leq 35\frac{7}{17} &&\leq \frac{\frac{n(n+1)}{2}-1}{n-1} \
 
\frac{\frac{n(n+1)}{2}-n}{n-1} &\leq 35\frac{7}{17} &&\leq \frac{\frac{n(n+1)}{2}-1}{n-1} \
Line 19: Line 19:
 
\frac{n}{2} &\leq 35\frac{7}{17} &&\leq \frac{n+2}{2} \
 
\frac{n}{2} &\leq 35\frac{7}{17} &&\leq \frac{n+2}{2} \
 
n &\leq 70\frac{14}{17} &&\leq n+2 \
 
n &\leq 70\frac{14}{17} &&\leq n+2 \
−
68\frac{14}{17} &\leq \hspace{3mm} n &&\leq 70\frac{14}{17}.
+
68\frac{14}{17} &\leq \hspace{3mm} n &&\leq 70\frac{14}{17},
 
\end{alignat*}</cmath>
 
\end{alignat*}</cmath>
 +
from which <math>n</math> is either <math>69</math> or <math>70.</math>
 +
 +
Let <math>x</math> be the number that is erased. We are given that <math>\frac{\frac{n(n+1)}{2}-x}{n-1}=35\frac{7}{17},</math> or <cmath>\frac{n(n+1)}{2}-x=35\frac{7}{17}\cdot(n-1). \hspace{15mm}(\bigstar)</cmath>
 +
* If <math>n=70,</math> then <math>(\bigstar)</math> becomes <math>2485-x=\frac{41538}{17},</math> from which <math>x=\frac{707}{17},</math> contradicting the precondition that <math>x</math> is a positive integer.
 +
 +
* If <math>n=69,</math> then <math>(\bigstar)</math> becomes <math>2415-x=2408,</math> from which <math>x=\boxed{\textbf{(B)}\ 7}.</math>
 +
 +
~MRENTHUSIASM
  
 
== See Also ==
 
== See Also ==
 
{{AHSME box|year=1982|num-b=27|num-a=29}}
 
{{AHSME box|year=1982|num-b=27|num-a=29}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 03:28, 10 September 2021

Problem

A set of consecutive positive integers beginning with $1$ is written on a blackboard. One number is erased. The average (arithmetic mean) of the remaining numbers is $35\frac{7}{17}$. What number was erased?

$\textbf{(A)}\ 6\qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ \text{cannot be determined}$

Solution

Suppose that there are $n$ positive integers in the set initially, so their sum is $\frac{n(n+1)}{2}$ by arithmetic series. The average of the remaining numbers is minimized when $n$ is erased, and is maximized when $1$ is erased.

It is clear that $n>1.$ We write and solve a compound inequality for $n:$ \begin{alignat*}{8} \frac{\frac{n(n+1)}{2}-n}{n-1} &\leq 35\frac{7}{17} &&\leq \frac{\frac{n(n+1)}{2}-1}{n-1} \\ \frac{n(n+1)-2n}{2(n-1)} &\leq 35\frac{7}{17} &&\leq \frac{n(n+1)-2}{2(n-1)} \\ \frac{n^2-n}{2(n-1)} &\leq 35\frac{7}{17} &&\leq \frac{n^2+n-2}{2(n-1)} \\ \frac{n(n-1)}{2(n-1)} &\leq 35\frac{7}{17} &&\leq \frac{(n+2)(n-1)}{2(n-1)} \\ \frac{n}{2} &\leq 35\frac{7}{17} &&\leq \frac{n+2}{2} \\ n &\leq 70\frac{14}{17} &&\leq n+2 \\ 68\frac{14}{17} &\leq \hspace{3mm} n &&\leq 70\frac{14}{17}, \end{alignat*} from which $n$ is either $69$ or $70.$

Let $x$ be the number that is erased. We are given that $\frac{\frac{n(n+1)}{2}-x}{n-1}=35\frac{7}{17},$ or \[\frac{n(n+1)}{2}-x=35\frac{7}{17}\cdot(n-1). \hspace{15mm}(\bigstar)\]

  • If $n=70,$ then $(\bigstar)$ becomes $2485-x=\frac{41538}{17},$ from which $x=\frac{707}{17},$ contradicting the precondition that $x$ is a positive integer.
  • If $n=69,$ then $(\bigstar)$ becomes $2415-x=2408,$ from which $x=\boxed{\textbf{(B)}\ 7}.$

~MRENTHUSIASM

See Also

1982 AHSME (Problems • Answer Key • Resources)
Preceded by
Problem 27 		Followed by
Problem 29
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1982_AHSME_Problems/Problem_28&oldid=161982"