Select the recursive formula for the sequence {2, 12, 22, 32...}.(1 point)
Responses
f(1)=2
, f(n)=f(n−1)+10 for n>1
f of 1 is equal to 2, f left parenthesis n equals f left parenthesis n minus 1 right parenthesis plus 10 for n greater than 1
f(n)=10+2(n−1)
f left parenthesis n equals 10 plus 2 times left parenthesis n minus 1 right parenthesis
f(n)=2+10(n−1)
f left parenthesis n equals 2 plus 10 times left parenthesis n minus 1 right parenthesis
f(1)=10
, f(n)=f(n−1)+2 for n>1
f(1) = 2, f(n) = f(n-1) + 10 for n > 1
The correct recursive formula for the sequence {2, 12, 22, 32...} is:
f(1) = 2,
f(n) = f(n-1) + 10 for n > 1.
This means that the first term is 2, and each subsequent term is obtained by adding 10 to the previous term.
The recursive formula for the sequence {2, 12, 22, 32...} is:
f(1) = 2
f(n) = f(n-1) + 10 for n > 1
This formula states that the first term of the sequence, f(1), is equal to 2. For any term after the first term, f(n), it is calculated by taking the previous term, f(n-1), and adding 10 to it.