subject
Mathematics, 31.10.2020 02:00 davidaagurto

F(n) = 5 • (-2) ^n-1
Complete the recursive formula of f(n).
f(1) =
f(n) = f(n-1)•

ansver
Answers: 2

Another question on Mathematics

question
Mathematics, 21.06.2019 18:00
Olga used 100 ounces of flour to make 225 muffins. how many ounces of flour will be used to make 300 muffins?
Answers: 2
question
Mathematics, 21.06.2019 20:00
The graph and table shows the relationship between y, the number of words jean has typed for her essay and x, the number of minutes she has been typing on the computer. according to the line of best fit, about how many words will jean have typed when she completes 60 minutes of typing? 2,500 2,750 3,000 3,250
Answers: 3
question
Mathematics, 21.06.2019 22:30
Marquise has 200 meters of fencing to build a rectangular garden. the garden's area (in square meters) as a function of the garden's width w w (in meters) is modeled by: a ( w ) = − w 2 + 1 0 0 w a(w)=−w 2 +100w what side width will produce the maximum garden area? meters
Answers: 1
question
Mathematics, 22.06.2019 00:00
Mrs. blake's bill at a restaurant is $42.75. she wants to leave the waiter an 18% tip. how much will she pay in all, including the tip?
Answers: 2
You know the right answer?
F(n) = 5 • (-2) ^n-1
Complete the recursive formula of f(n).
f(1) =
f(n) = f(n-1)•...
Questions
question
Mathematics, 23.10.2020 05:01
question
Mathematics, 23.10.2020 05:01
question
Mathematics, 23.10.2020 05:01
question
Mathematics, 23.10.2020 05:01
question
Health, 23.10.2020 05:01
question
Spanish, 23.10.2020 05:01
Questions on the website: 13722363