subject
Mathematics, 13.06.2020 00:57 warnene17

F(n) = 2 .(-3) n
Complete the recursive formula of f(n).
f(1) =
f(n) = f(n − 1).

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 16:00
Does the problem involve permutations or? combinations? do not solve. the matching section of an exam has 4 questions and 7 possible answers. in how many different ways can a student answer the 4 ? questions, if none of the answer choices can be? repeated?
Answers: 1
question
Mathematics, 21.06.2019 18:00
For a field trip to the zoo, 4 students rode in cars and the rest filled nine busess. how many students were in each bus if 472 students were on the trip
Answers: 1
question
Mathematics, 21.06.2019 21:30
Find the ratios of the corresponding sides
Answers: 2
question
Mathematics, 21.06.2019 22:00
Find an bif a = {3, 6, 9, 12) and b = {2, 4, 6, 8, 10).
Answers: 1
You know the right answer?
F(n) = 2 .(-3) n
Complete the recursive formula of f(n).
f(1) =
f(n) = f(n − 1)....
Questions
question
Social Studies, 18.09.2019 17:30
question
Spanish, 18.09.2019 17:30
Questions on the website: 13722367