Write a recursive formula for the sequence {10, 12, 14, 16, ...}. (1 point)
O f(1) = 10, f(n) = f(n − 1) + 2, for n > 1
O f(1) = 2, f(n) = f(n − 1) + 10, for n > 1
O f(1) = 10, f(n) = f(n − 1) – 2, for n > 1
O f(1) = 2, f(n) = f(n − 1) – 10, for n > 1

The answer is:O f(1) = 10, f(n) = f(n − 1) + 2, for n > 1

Step-by-step explanation:

f1=10 because the first number is 10. then f(n)=f(n-1)+2 for N because it goes up 2 every time.

there would be 365 different 4 digit numbers

step-by-step explanation:

i belive that it is 365 because i asked google

b

step-by-step explanation:

a difference is the result of subtraction. while each of these expressions has subtraction in it, a difference will be the result when subtraction is the last operation applied in the order of operations for the expression. this means subtraction must be outside of the parenthesis. only b has this.