Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n 2 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)

c. prove the lengths are the same.

step-by-step explanation:

you need to prove the segments are congruent. congruent segments have the same length. find the lengths of the segments using the distance formula, and compare them.

answer: c. prove the lengths are the same.

fwms@lil_ben06

step-by-step explanation:

fjfjfhdhdhdhjjdjdjdjdjjd thats the answers

step-by-step explanation:

answer: first option i.e. 'a' is correct.

step-by-step explanation:

since we have given that

number of minutes to wrap a small gift box = 4 minutes

we need to find the number of gifts to be wrapped in 5 minutes

since there is a direct variation, as the number of minutes will increase with   number of gifts to be wrapped.

so, let the number of gifts to be wrapped in 5 minutes be x.

so, it becomes,

hence, first option 'a'   is correct.