What's the recursive formula of the geometric sequence below? 2, 6, 18, 54, 162, 486, ...

a1 = 2; an = an–1 ∙ (3)n–1 for n ≥ 1

a1 = 2; an = an–1 ∙ (3) for n ≥ 2

a1 = 3; an = an–1 ∙ (2)n–1 for n ≥ 2

a1 = 2; an = an–1 ∙ (2) for n ≥ 1

7.3

step-by-step explanation:

a

step-by-step explanation:

this linear equation would have just one solution.

step-by-step explanation:

the reason why this would have one solution is that it is an expression with just one variable. since that variable is not raised to a power, it will always have just one solution.