<h3>Answers:</h3>
The recursive model is ![\begin{cases}a_1 = 2\\a_{n} = 4*a_{n-1}\end{cases}](https://tex.z-dn.net/?f=%5Cbegin%7Bcases%7Da_1%20%3D%202%5C%5Ca_%7Bn%7D%20%3D%204%2Aa_%7Bn-1%7D%5Cend%7Bcases%7D)
--------------
The explicit model is ![a_n = 2(4)^{n-1}](https://tex.z-dn.net/?f=a_n%20%3D%202%284%29%5E%7Bn-1%7D)
============================================================
Explanation:
Finding the recursive model
The starting term of this geometric sequence is 2. We would write
. The small subscript 1 indicates the term number, while 2 is the term itself.
The second term is ![a_2 = 8](https://tex.z-dn.net/?f=a_2%20%3D%208)
The third term is ![a_3 = 32](https://tex.z-dn.net/?f=a_3%20%3D%2032)
and so on. Pick any term you want that isn't the first term. Divide that term you picked over its previous term. So say you picked the third term. Divide that over the second term to get
(third term)/(second term) = 32/8 = 4
or you could do fourth over third
(fourth term)/(third term) = 128/32 = 4
Each time you do this, you should get 4 as a result. This is the common ratio. We multiply each term by 4 to get the next term.
So the recursive step is
which says "the nth term
is found by multiplying the prior term
by 4". The entire "n-1" is a subscript to show it is the term just before the nth term.
Overall we have
as the first term and the recursive rule
both of which combine to get the recursive model ![\begin{cases}a_1 = 2\\a_{n} = 4*a_{n-1}\end{cases}](https://tex.z-dn.net/?f=%5Cbegin%7Bcases%7Da_1%20%3D%202%5C%5Ca_%7Bn%7D%20%3D%204%2Aa_%7Bn-1%7D%5Cend%7Bcases%7D)
That just says "start at 2, multiply each term by 4 to get the next one"
----------------------------------------------------
Finding the explicit model
We have a = 2 as the first term and r = 4 as the common ratio. Plug those into the nth term of a geometric sequence formula as shown below
![a_n = a*(r)^{n-1}\\\\a_n = 2(4)^{n-1}](https://tex.z-dn.net/?f=a_n%20%3D%20a%2A%28r%29%5E%7Bn-1%7D%5C%5C%5C%5Ca_n%20%3D%202%284%29%5E%7Bn-1%7D)
and that's all there is to it.