Question

Fenyang got \[6\] rabbits to raise on his farm. From the following month forward, the rabbit population doubled every month.
Let \[g(n)\] be the number of rabbits in Fenyang's farm in the \[n^\text{th}\] month since he got the rabbits.
\[g\] is a sequence. What kind of sequence is it?
Choose 1 answer:
A
Arithmetic sequence
B
Geometric sequence
Complete the recursive formula for \[g(n)\].
\[g(1)=\]
\[g(n)=g(n-1)\]

Answer 1

Answer: B — Geometric sequence.

g(1) = 6
g(n) = 2·g(n−1) for n ≥ 2

(Explicitly g(n) = 6·2^{\,n-1}.)