Asequence is defined recursively by the following rules:
f(1) = 3
f(n+1) =2. f(n) – 1
which of the following statements is true about the sequence? select all that apply.
a)f(3) = 10
b)f(6) = 66
c)f(5)= 33
d)f(4) = 18
e)f(2) = 5

Step-by-step explanation:

The recursive definition tells you that values of f(n) will all be odd. (They are one less than an even number.) This observation eliminates all choices except C and E.

The first few values of f(n) are ...

  3, 5, 9, 17, 33, 65, ...

From this list, we can see that f(2) = 5 and f(5) = 33, matching choices C and E.

___

The explicit formula is ...

example 2 – simplify: step 1: completely factor both the numerators and denominators of all fractions. step 2: change the division sign to a multiplication sign and flip (or reciprocate) the fraction after the division sign; essential you need to multiply by the reciprocal. step 3 : cancel or reduce the fractions.

0.6

39mph

step-by-step explanation: