Consider the sequence: 8, 11, 14, 17, 20, 23, 26, write a recursive definition: group of answer choices
latex: a_n=2\cdot a_{n-1}-5 a n = 2 ⋅ a n − 1 − 5
latex: a_n=3\cdot a_{n-1} a n = 3 ⋅ a n − 1
latex: a_n=3+a_{n-1} a n = 3 + a n − 1
latex: a_n=8+3\cdot a_{n-1}

Consider the sequence: 8, 11, 14, 17, 20, 23, 26, The recursive definition is

The given sequence is :- 8, 11, 14, 17, 20, 23, 26, .....

Second term is and so on

On analyzing the above series we can say  

Each time we want a new term, we add on 3 to previous term which is as follows:-

8 + 3 = 11

11 + 3 = 14

14 + 3 = 17

17 + 3 = 20

20 + 3 = 23

23 + 3 = 26

And so on

This recursive step of adding on 3 to the prior term is written in the following general form:

Let's check the above recursive definition by substituting n = 2 we should get 11

Thus the required recursive definition is found

both graphs increase on their domain

neither graph has a y-intercept

step-by-step explanation:

the following points can be visualized easily from the graph

the answer is:

the correct option:

b.

to solve the problem, we need to remember how to operate to simplify exponential expressions using the logarithms.

we are given the equation:

then, using placing logarith with base 7 on both sides of the equation, we have:

so, rounding the obtained result to two decimal places (nearest hundreth), we have:

hence, we have that the correct option:

b.

have a nice day!