Chapter 9: Problem 87
Find the sum. $$\sum_{i=1}^{5}(2 i+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 9: Problem 87
Find the sum. $$\sum_{i=1}^{5}(2 i+1)$$
All the tools & learning materials you need for study success - in one app.
Get started for free
Write an expression for the apparent \(n\) th term of the sequence. (Assume \(n\) begins with \(1 .\)) $$3,8,13,18,23, \dots$$
Find the indicated term of the sequence. $$\begin{aligned} &a_{n}=(-1)^{n-1}[n(n-1)]\\\ &a_{16}= \end{aligned}$$
An auditorium has 20 rows of seats. There are 20 seats in the first row, 21 seats in the second row, 22 seats in the third row, and so on (see figure). How many seats are there in all 20 rows?
Write the first five terms of the sequence defined recursively. Use the pattern to write the \(n\) th term of the sequence as a function of \(n .\) (Assume \(n\) begins with 1.) $$a_{1}=14, a_{k+1}=-2 a_{k}$$
Fill in the blank. The _________ states that if there are \(m_{1}\) ways for one event to occur and \(m_{2}\) ways for a second event to occur, then there are \(m_{1} \bullet m_{2}\) ways for both events to occur.
What do you think about this solution?
We value your feedback to improve our textbook solutions.