Search problems

1 problem matches “rate problems”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

  1. Elephant carrying bananas to city B ●●●●○ 100 ptsTwo cities AA and BB are 10001000 km apart. City AA has 30003000 bananas and an elephant that can carry at most 10001000 bananas at a time. The elephant eats one banana per km and cannot travel without bananas. Assume the elephant eats continuously, so it can eat fractions of a banana along the way. What is the maximum number of bananas that can be transferred to city BB? Round to two decimal places.