Chapter 7: Problem 2
Evaluate the arithmetic series. $$ 1001+1002+1003+\cdots+2998+2999+3000 $$
/*! 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 2
Evaluate the arithmetic series. $$ 1001+1002+1003+\cdots+2998+2999+3000 $$
All the tools & learning materials you need for study success - in one app.
Get started for free
Consider the fable from the beginning of Section 3.4. In this fable, one grain of rice is placed on the first square of a chessboard, then two grains on the second square, then four grains on the third square, and so on, doubling the number of grains placed on each square. Find the total number of grains of rice on the first 18 squares of the chessboard.
Use Pascal's triangle to simplify the indicated expression. $$ (2-\sqrt{3})^{5} $$
Explain why $$ \sum_{m=1}^{1000} m^{2}=\sum_{m=0}^{999}\left(m^{2}+2 m+1\right) . $$
Show that $$ \sum_{k=0}^{n} \frac{n !}{k !(n-k) !}=2^{n} $$ for every positive integer \(n\). [Hint: Expand \((1+1)^{n}\) using the Binomial Theorem.]
Evaluate the arithmetic series. $$ \sum_{m=1}^{75}(2+3 m) $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.