Asequence is defined by the recursive function f(n + 1) = f(n) – 2. if f(1) = 10, what is f(3)? 1 6 8 30

In the final round of trivia competition, contestants were asked to name as many states that begin with the letter m as they could in 15 seconds. the bar graph shows the number of states the contestants were able to name. how many contestants participated in the final round of the competition? a) 6 b) 8 c) 14 d) 20

How many zeros does the function f(x)=4x3-x2+1 have

What is the equation of a line that passes through points (0, 4) and (-4,-8)?