Chapter 7: Problem 9
Evaluate the arithmetic series. $$ \sum_{k=5}^{65}(4 k-1) $$
/*! 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 9
Evaluate the arithmetic series. $$ \sum_{k=5}^{65}(4 k-1) $$
All the tools & learning materials you need for study success - in one app.
Get started for free
For \(n=0,1,2,3,4,5,\) show that the sum of the entries in row \(n+1\) of Pascal's triangle equals \(2^{n}\).
Assume \(n\) is a positive integer. Find the coefficient of \(w^{198}\) in the expansion of \((w+3)^{200}\).
Find the sum of all the four-digit odd positive integers.
Find all infinite sequences that are both arithmetic and geometric sequences.
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 smallest number \(n\) such that the total number of grains of rice on the first \(n\) squares of the chessboard is more than 30,000,000 .
What do you think about this solution?
We value your feedback to improve our textbook solutions.