Consider the following recursively defined sequence. , 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 as a summation written in expanded form, and use Theorem 5.2.1 to write it as a single fraction whose denominator is 2.

for me what is finding a good play list and going out because i can not lay down and relax so i usually go to a coffee shop. i also use the gum trick and this actually works. another advice is highlighting subjects it really does me remember certain things

step-by-step explanation:

answer: integers are just whole numbers: positive, negative, and zero.

i = {-∞, -2, -1, 0, 1, 2, 3, ∞}

let x = 1st integer

let y = 2nd integer

x = 3y + 17   {equation 1}

xy = -24         {equation 2}

substitute 3y+17 in place of x n equation 2

and solve for y.

(3y+17)y = -24

3y2 + 17y = -24

3y2 + 17y + 24 = 0

from quadratic equation:

y = [-17±√(172-4(3)(24))]/(2(3))

y = (-17 ±√1)/6

y = (-17+1)/6   or     y = (-17-1)/6

y = -16/6           or     y = -18/6

y = -2 2/3         or   y = -3

since we are dealing with

y = -3

x = 3y+17 = -9+17 = 8

the integers are -3, 8

step-by-step explanation: