Which sequences could be described by the recursive definition LaTeX: a_{n+1}=3\cdot a_n-1a n + 1 = 3 ⋅ a n − 1
Group of answer choices

2, 5, 14, 41, 122...

2, 5, 8, 11, 14...

2, 3, 5, 11, 29, 86...

2,6,18,54,162...

Respuesta :

Answer:

an=3+an-1

2, 5, 14, 41, 122..

9

Step-by-step explanation:

Answer:

2,6,18,54,162...

Step-by-step explanation:

The given expression is:

[tex]a_{n}=3 a_{n-1}[/tex]

To find the right sequence, we have to find the value for [tex]n=1[/tex], [tex]n=2[/tex], [tex]n=3[/tex], [tex]n=4[/tex] and [tex]n=5[/tex], which are presented in the following operations, also we know that the first term is 2, we can begin from there:

[tex]a_{1}=2\\a_{2}=3(2)=6\\ a_{3}=3(6)=18\\ a_{4}=3(18)=54\\ a_{5}=3(54)=162[/tex]

As you can see, the given expression represents a sequence where the next term is the triple than the term before.

As a result, we found the sequence 2, 6, 18, 54, 162...

Therefore the right answer is the last choice.