What is the recursive formula for this sequence?
10, 14, 18, 22, 26,...
O A. (
= 4
len = 2n-1 +10
=
O B.
ay = 30
an = an-1 + 4
=
C.
(ay = 10
lan= any +4
O D.
ſay = 10
Lan = an-1-4
lan

Respuesta :

Answer:

[tex]\begin{cases}a_1 = 10\\a_{n+1} = a_n + 4\end{cases}[/tex]

==================================================

Explanation:

The first row [tex]a_1 = 10[/tex] indicates the first term is 10. The small "1" is the index number. That means [tex]a_2[/tex] is next followed by [tex]a_3[/tex] and so on.

To generate the next term, we follow this recursive step: [tex]a_{n+1} = a_n + 4[/tex]

It means "whatever the nth term [tex]a_n[/tex] is, we add 4 to it to get the next term [tex]a_{n+1}[/tex]"

In other words, we add 4 to each term to get the next term.

Eg: 10+4 = 14 and 14+4 = 18

The recursive step could be rewritten as [tex]a_n = a_{n-1}+4[/tex] based on how you frame things.