Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1? 3, –6, 12, –24, 48, … a. f(n + 1) = –3 f(n ) b. f(n + 1) = 3 f(n ) c. f(n + 1) = –2 f(n ) d. f(n + 1) = 2 f(n)

An equation representing lyle’s hedge-trimming business is a = 12n - 300 where a is the amount of profit or loss in dollars and n is the number of hedges trimmed. how would the graph of lyle’s business change if the equation a = 10n - 300 represented his business? the graph would be flatter. the graph would be steeper. the graph would start closer to the origin. the graph would start lower on the y-axis.

Show your workcan a right triangle have this sides? *how to prove it without using the pythagorean theorema*

Answer for 10 points show work you guys in advanced < 3