subject
Mathematics, 07.10.2019 20:20 macybarham

Suppose you are given a budget of k = 2 jars. describe a strategy for finding the highest safe rung that requires you to drop a jar at most f (n) times, for some function f (n) that grows slower than linearly. (in other words, it should be the case that limn→[infinity] f (n)/n = 0.)

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 20:00
The radius of the earth is two times the radius of the moon. what fraction of the volume of the earth is the volume of the moon?
Answers: 1
question
Mathematics, 21.06.2019 20:40
David estimated he had about 20 fish in his pond. a year later, there were about 1.5 times as many fish. the year after that, the number of fish increased by a factor of 1.5 again. the number of fish is modeled by f(x)=20(1.5)^x. create a question you could ask that could be answered only by graphing or using a logarithm.
Answers: 1
question
Mathematics, 21.06.2019 21:00
Ineed with math stuff it involves graphs
Answers: 1
question
Mathematics, 21.06.2019 21:30
Noel is hoping to make a profit (in $) on the school play and has determined the function describing the profit to be f(t) = 8t – 2654, where t is the number of tickets sold. what does the number 8 tell you?
Answers: 1
You know the right answer?
Suppose you are given a budget of k = 2 jars. describe a strategy for finding the highest safe rung...
Questions
question
Arts, 24.04.2021 19:00
question
English, 24.04.2021 19:00
question
Business, 24.04.2021 19:00
question
Mathematics, 24.04.2021 19:00
Questions on the website: 13722363