Answer:
The recursive formula for the given sequence
![t_(n)= (2)^(n+2)](https://img.qammunity.org/2021/formulas/mathematics/high-school/yzaqre9qh78aoqh8llpsy8ix3ecsr7ako3.png)
Explanation:
Explanation:-
Given sequence is 8 , 16, 32, 64 ,.....
First term is a = 8
common ratio
![r = (16)/(8) =2](https://img.qammunity.org/2021/formulas/mathematics/high-school/dqy5e91ag7cutzd5n8p0u0klx0z6q11if8.png)
![r = (32)/(16) =2](https://img.qammunity.org/2021/formulas/mathematics/high-school/igzqok9vhx3c7tjh1tppxjm5w9t7f57lyi.png)
and so on..
Given sequence of the common ratio 'r' is equal
The
term of the sequence
![t_(n) = a r^(n-1)](https://img.qammunity.org/2021/formulas/mathematics/high-school/5jy79dg2kx3ezgf6mank8onj15n4w76gh2.png)
![t_(n)= 8 (2)^(n-1)](https://img.qammunity.org/2021/formulas/mathematics/high-school/3ls4ndb9nij3mrwoyhsvj7eb7qfj9lkylv.png)
![t_(n)= (2)^((3+n-1))](https://img.qammunity.org/2021/formulas/mathematics/high-school/rf28fx4238edaq1bne92dbskj2g099raxx.png)
![t_(n)= (2)^(n+2)](https://img.qammunity.org/2021/formulas/mathematics/high-school/yzaqre9qh78aoqh8llpsy8ix3ecsr7ako3.png)
This is recursive formula for the given sequence
![t_(n)= (2)^(n+2)](https://img.qammunity.org/2021/formulas/mathematics/high-school/yzaqre9qh78aoqh8llpsy8ix3ecsr7ako3.png)
Verification:-
![t_(n)= (2)^(n+2)](https://img.qammunity.org/2021/formulas/mathematics/high-school/yzaqre9qh78aoqh8llpsy8ix3ecsr7ako3.png)
put n=1 ⇒ t₁ = 8
put n=2 ⇒ t₂ = 16
put n=3 ⇒ t₃ = 32
put n=4 ⇒ t₄= 64
and so on..
The sequence 8 ,16 , 32 , 64 ....