F(n)=2⋅(−3) ^n

Complete the recursive formula f(n)

f(1)=

f(n)=f(n−1)⋅

just find the gcf and solve the gcf's until you get each answer i have a really good feeling somethings missing xd (like the dimensions of the fence) *cough *cough *hint *hint

step-by-step explanation:

you might have to contact customer support. if you have it on your iphone you just got into your settings> subscriptions> cancel

step-by-step explanation:

tangent

step-by-step explanation:

median is the value separating the higher half of a data sample, a population or probablity distribution from the lower half.

step-by-step explanation:

say you have 3,8,7,3,1,9,8 order them from lowest to highest

if orderd it would be 1,3,3,7,8,8,9 now you take away from the lowest and the highest until you end up in the middle.

so you would remove the 1 and 9 leaving you with 5 digits remaining

when you've reached the middle that would be your answer so in this case the answer is 7

if there were two numbers left say 7 and 5 you'd and them together so 12 then divide by 2 witch would equal 6 so the answer would be 6

good luck on that project hoped i you at all