subject
Mathematics, 23.10.2020 20:10 20guadalupee73248

Consider the following recursively defined sequence. t_{k} = t_{k-1} + 3k + 1, for each integer k ≥ 1
The steps below begin an iterative process to guess an explicit formula for the sequence.
Continue the iteration process in a free response. Then guess a formula for t_{n} as a summation written in expanded form, and use Theorem 5.2.1 to write it as a single fraction whose denominator is 2.


t_{0} = 0
t_{0} = 0
t_{1} = t_{0} + 3 * 1 + 1 = 3 + 1\\t_{2} = t_{1} + 3 * 2 + 1 = (3 + 1) + 3 * 2 + 1 = 3 + 3 * 2 + 2\\t_{3} = t_{2} + 3 * 3 + 1 = (3 + 3 * 2 + 2) + 3 * 3 + 1 = 3 + 3 * 2 + 3 * 3 + 3

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 19:10
If you answer 2+2 you will get over 80 points
Answers: 2
question
Mathematics, 21.06.2019 20:00
How many grams the dog will eat in 3 days?
Answers: 1
question
Mathematics, 21.06.2019 21:00
3x + 4y = 5 x- 3y = -7 solve by substitution
Answers: 1
question
Mathematics, 21.06.2019 21:30
Find the unit rate for: 75% high-fiber chimp food to 25% high -protein chimp food.
Answers: 2
You know the right answer?
Consider the following recursively defined sequence. , for each integer k ≥ 1

The steps...
Questions
Questions on the website: 13722363