Question

Considere a seguinte sequência definida recursivamente x subscript 1 equals 3, x subscript n equals left parenthesis x subscript n minus 1 end subscript right parenthesis squared, n greater or equal than 2. Assinale a alternativa que corresponde a uma fórmula fechada para ela.

a.
x subscript 1 equals 3, begin display style x subscript n equals 3 to the power of n minus 1 end exponent comma n greater or equal than 2 end style.

b.
x subscript 1 equals 3, begin display style x subscript n equals 3 to the power of 2 to the power of n minus 1 end exponent comma n greater or equal than 2 end style.

c.
begin display style x subscript n equals 3 to the power of 2 to the power of left parenthesis n minus 1 right parenthesis end exponent end exponent end style.

d.
x subscript 1 equals 3, begin display style x subscript n equals 3.2 to the power of 2 to the power of left parenthesis n minus 1 right parenthesis end exponent comma n greater or equal than 2 end style.

e.
x subscript 1 equals 3, begin display style x subscript n equals 3 to the power of 2 to the power of n end exponent comma n greater or equal than 2 end style.

Answer 1

Resposta:

Alternativa C

Xn = 3²⁽ⁿ⁻¹⁾

Explicação passo a passo:

Conferido