Question

A geometric sequence is defined by the recursive formula t1 = 64, tn = tn - 1 2 , where n ∈N and n > 1. The sequence is

A)-64, -16, -8, -4, -2, -1, ...
B)64, 16, 8, 4, 2, 1, ...
C)64, 32, 16, 8, 4, 2, ...
D)64, 128, 256, 512, 1024, 2048

Answer 1

Answer: The anser is C

Step-by-step explanation: I honestly have no clue but im on usa test prep and guessed but got it right so I figured i'd help someone out lol, gotta go practice

Answer 2

D)64, 128, 256, 512, 1024, 2048

Explanation:

A geometric sequence is defined by the recursive formula t1 = 64,

`t_n = t_(n - 1) \cdot 2`

To get the geometric sequence , plug in the value for n=2,3,4,5....

n=2, plug in 2 for n

`t_2 = t_(1) \cdot 2`

`t_2 = 64 \cdot 2=128`

n=3, plug in 3 for n

`t_3 = t_(2) \cdot 2`

`t_3 = 128 \cdot 2=256`

n=4, plug in 4 for n

`t_4 = t_(3) \cdot 2`

`t_4 = 256 \cdot 2=512`