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 "1992 AHSME Problems/Problem 21"

(→‎Solution)
(→‎Solution)
 
(4 intermediate revisions by one other user not shown)
Line 12: Line 12:
 
\text{(E) } 1009</math>
 
\text{(E) } 1009</math>
  
−
== Solution ==
+
== Solution 1==
  
−
Let us define the Cesáro total of a particular sequence to be n * Cesáro sum. We can see that the Cesáro total is S[1] + S[2] + S[3] + ... + S[n] = a[1] + (a[1] + a[2]) + (a[1] + a[2] + a[3]) ... = n*a[1] + (n - 1)*a[2] + ... + a[n]. If we take this to be the Cesáro total for the second sequence, we can see that all the terms but the first term make up the first sequence. Since we know that the Cesáro total of the original sequence is 1000 * 99 = 99,000, than the Cesáro total of the second sequence is n*a[1] + 99,000 = 100 * 1 + 99,000 = 99,100. Thus the Cesáro sum of the second sequence is 99,100/100 = 991 <math>\fbox{A}</math>.
+
Let us define the Cesáro total of a particular sequence to be n * Cesáro sum. We can see that the Cesáro total is  
 +
<cmath>S_1 + S_2 + S_3 + ... + S_n</cmath>
 +
<cmath>= a_1 + (a_1 + a_2) + (a_1 + a_2 + a_3) + \ldots + (a_1 + a_2 + \ldots + a_n)</cmath>
 +
<cmath>= n \cdot a_1 + (n - 1) \cdot a_2 + \ldots + a_n.</cmath>
 +
If we take this to be the Cesáro total for the second sequence, we can see that all the terms but the first term make up the first sequence. Since we know that the Cesáro total of the original sequence is <math>1000 * 99 = 99,000,</math> than the Cesáro total of the second sequence is <math>n \cdot a_1 + 99,000 = 100 \cdot 1 + 99,000 = 99,100.</math> Thus the Cesáro sum of the second sequence is <math>\frac{99,100}{100} = \boxed{991, A}\, .</math>
 +
 
 +
==Solution 2==
 +
 
 +
We know that the Cesáro sum of the first <math>99</math> numbers is
 +
 
 +
<cmath>\frac{a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}}{99}=100.</cmath>
 +
 
 +
Multiplying by <math>99</math>, we see that
 +
 
 +
<cmath>a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}=100\cdot{99}.</cmath>
 +
 
 +
Now, we append <math>1</math> to the list of <math>a_n,</math> so our new sum becomes
 +
 
 +
<cmath>\frac{1+1+a_1+1+a_1+a_2+...+a_{99}}{100} \rightarrow</cmath>
 +
<cmath>\frac{100+a_1+a_1+a_2+...+a_{99}}{100}.</cmath>
 +
 
 +
We've estabished that <math>a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}=100\cdot{99}</math>, so
 +
 
 +
<cmath>\frac{100+a_1+a_1+a_2+...+a_{99}}{100}=\frac{100+99\cdot{100}}{100}.</cmath>
 +
 
 +
Dividing everything by <math>100</math>, the sum of the sought sequence is <math>1+990=991 \rightarrow \boxed{A}</math>
 +
 
 +
~Benedict T (countmath1)
  
 
== See also ==
 
== See also ==

Latest revision as of 21:53, 17 April 2022

Problem

For a finite sequence $A=(a_1,a_2,...,a_n)$ of numbers, the Cesáro sum of A is defined to be $\frac{S_1+\cdots+S_n}{n}$ , where $S_k=a_1+\cdots+a_k$ and $1\leq k\leq n$. If the Cesáro sum of the 99-term sequence $(a_1,...,a_{99})$ is 1000, what is the Cesáro sum of the 100-term sequence $(1,a_1,...,a_{99})$?

$\text{(A) } 991\quad \text{(B) } 999\quad \text{(C) } 1000\quad \text{(D) } 1001\quad \text{(E) } 1009$

Solution 1

Let us define the Cesáro total of a particular sequence to be n * Cesáro sum. We can see that the Cesáro total is \[S_1 + S_2 + S_3 + ... + S_n\] \[= a_1 + (a_1 + a_2) + (a_1 + a_2 + a_3) + \ldots + (a_1 + a_2 + \ldots + a_n)\] \[= n \cdot a_1 + (n - 1) \cdot a_2 + \ldots + a_n.\] If we take this to be the Cesáro total for the second sequence, we can see that all the terms but the first term make up the first sequence. Since we know that the Cesáro total of the original sequence is $1000 * 99 = 99,000,$ than the Cesáro total of the second sequence is $n \cdot a_1 + 99,000 = 100 \cdot 1 + 99,000 = 99,100.$ Thus the Cesáro sum of the second sequence is $\frac{99,100}{100} = \boxed{991, A}\, .$

Solution 2

We know that the Cesáro sum of the first $99$ numbers is

\[\frac{a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}}{99}=100.\]

Multiplying by $99$, we see that

\[a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}=100\cdot{99}.\]

Now, we append $1$ to the list of $a_n,$ so our new sum becomes

\[\frac{1+1+a_1+1+a_1+a_2+...+a_{99}}{100} \rightarrow\] \[\frac{100+a_1+a_1+a_2+...+a_{99}}{100}.\]

We've estabished that $a_1+a_1+a_2+a_1+a_2+a_3+...+a_{99}=100\cdot{99}$, so

\[\frac{100+a_1+a_1+a_2+...+a_{99}}{100}=\frac{100+99\cdot{100}}{100}.\]

Dividing everything by $100$, the sum of the sought sequence is $1+990=991 \rightarrow \boxed{A}$

~Benedict T (countmath1)

See also

1992 AHSME (Problems • Answer Key • Resources)
Preceded by
Problem 20 		Followed by
Problem 22
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=1992_AHSME_Problems/Problem_21&oldid=173420"