100 points
8 ÷ 2 (2 + 2)
A. 1
B. 16

F(x) = x2 − 9, and g(x) = x − 3 f(x) = x2 − 4x + 3, and g(x) = x − 3 f(x) = x2 + 4x − 5, and g(x) = x − 1 f(x) = x2 − 16, and g(x) = x − 4 h(x) = x + 5 arrowright h(x) = x + 3 arrowright h(x) = x + 4 arrowright h(x) = x − 1 arrowright

Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !

What is 100,000 times 1/100,000, using the standard method of multiplication? write the answer as 10 to a power.