Find the recursive definition of the following sequence (Remember to define the first term t, the recursive rule to find tn, and the value n will start at)
10, 20, 60, 240

10 +10 = 20

20 +10=30

30+10=40

40+10= 50

50+10=60

60+10=70

And so on ….

steps below

Step-by-step explanation:

first term: t₁

t₁ = 10

t₂ = t₁ * (1+1) = 10 * 2 = 20

t₃ = t₂ * (2+1) = 20 * 3 = 60

t₄ = t₃ * (3+1) = 60 * 4 = 240

tₙ = tₙ₋₁ * n   ...  first term: 10, n start at 2

walter needs to make at least 5 more cookies but no more than 40. 5 ≤ x ≤ 40

step-by-step explanation:

20 ≤ x + 15 ≤ 55

subtract 15 from all parts

20-15 ≤ x + 15-15 ≤ 55-15

5 ≤ x ≤ 40

this means how many more cookies he has to make

walter needs to make at least 5 more cookies, but no more than 40 cookies; 5 ≤ x ≤ 40

kjgfcvbjkl

step-by-step explanation:

sdfghjkl; vbnm,