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

javeir earned 56 dollors more than kyle so kyle and javier had 14w but javier made 56 dollors more so 14w plus 56 equals 70w so kyle has 14w

step-by-step explanation: hope i plz give me brainliest with the points so this is not constant cause it says last week so its clearly not every week

explanation:

previous steps have made pa≅ pb ≅ st ≅ su. setting the compass width to ab allows you to make tu the same length. then δstu ≅ δpab by the sss congruence postulate, and ∠p ≅ ∠s by the reason cpctc.

25.3

step-by-step explanation:

1st step

add 3+6

=9

multipy 9*3

=37

is there supposed to be a picture here?