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 15:00
Consider the diagram. which line segment has the same measure as st? rx tx sr xs
Answers: 3
question
Mathematics, 21.06.2019 16:30
Aflute is on sale for 20% off. including the discount and 8% tax, the sales price is $216.
Answers: 2
question
Mathematics, 21.06.2019 19:30
Geometry in the diagram, ∠abc is a right angle. ∠dbc = 30°27'40". find the measure of ∠abd.
Answers: 1
question
Mathematics, 22.06.2019 03:20
The equation ip| = 2 represents the total number of points that can be earned or lost during one turn of a game. which best describes how many points can be earned or lost during one turn?
Answers: 3
You know the right answer?
Consider the following recursively defined sequence. , for each integer k ≥ 1

The steps...
Questions
question
Biology, 16.12.2020 05:10
question
Mathematics, 16.12.2020 05:10
question
Mathematics, 16.12.2020 05:10
question
Mathematics, 16.12.2020 05:10
question
Social Studies, 16.12.2020 05:10
question
Business, 16.12.2020 05:10
Questions on the website: 13722360