Chapter 7: Problem 58
Show that the sum of a finite arithmetic sequence is 0 if and only if the last term equals the negative of the first term.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Problem 58
Show that the sum of a finite arithmetic sequence is 0 if and only if the last term equals the negative of the first term.
All the tools & learning materials you need for study success - in one app.
Get started for free
Learn about Zeno's paradox (from a book, a friend, or a web search) and then relate the explanation of this ancient Greek problem to the infinite series $$ \frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{1}{16}+\cdots=1 $$
Find the ninth row of Pascal's triangle.
Express $$ 8.237545454 \ldots $$ as a fraction; here the digits 54 repeat forever.
Evaluate the arithmetic series. $$ 200+195+190+\cdots+75+70+65 $$
For Example 2 , the author wanted to find a polynomial \(p\) such that $$ p(1)=1, p(2)=4, p(3)=9, p(4)=16, p(5)=31 $$ Carry out the following steps to see how that polynomial was found. (a) Note that the polynomial $$ (x-2)(x-3)(x-4)(x-5) $$ is 0 for \(x=2,3,4,5\) but is not zero for \(x=1\). By dividing the polynomial above by a suitable number, find a polynomial \(p_{1}\) such that \(p_{1}(1)=1\) and $$ p_{1}(2)=p_{1}(3)=p_{1}(4)=p_{1}(5)=0 $$. (b) Similarly, find a polynomial \(p_{2}\) of degree 4 such that \(p_{2}(2)=1\) and $$ p_{2}(1)=p_{2}(3)=p_{2}(4)=p_{2}(5)=0 $$ (c) Similarly, find polynomials \(p_{j},\) for \(j=3,4,5,\) such that each \(p_{j}\) satisfies \(p_{j}(j)=1\) and \(p_{j}(k)=0\) for values of \(k\) in \\{1,2,3,4,5\\} other than \(j\). (d) Explain why the polynomial \(p\) defined by $$ p=p_{1}+4 p_{2}+9 p_{3}+16 p_{4}+31 p_{5} $$. satisfies $$ p(1)=1, p(2)=4, p(3)=9, p(4)=16, p(5)=31 $$.
What do you think about this solution?
We value your feedback to improve our textbook solutions.