Difference between revisions of "2015 UMO Problems/Problem 4"
(Created page with "==Problem == Find, with proof, all positive integers <math>n</math> with <math>2\le n\le 20</math> such that the greatest common divisor of the coefficients of <math>(x+y)^n-...") |
|||
| Line 1: | Line 1: | ||
==Problem == | ==Problem == | ||
| − | + | Anastasia and Balthazar need to go to the grocery store, which is <math>100</math> km away. Anastasia | |
| − | + | walks at <math>5</math> km/hr, and Balthazar walks at <math>4</math> km/hr. However, they also own a single bike, and | |
| − | + | each of them bikes at <math>10</math> km/hr. They are allowed to go forwards or backwards, and the bike | |
| + | will not get stolen if they drop it off along the way for the other person to pick up. What is | ||
| + | the shortest amount of time necessary for both of them to get to the grocery store? | ||
| Line 9: | Line 11: | ||
== See Also == | == See Also == | ||
| − | {{UMO box|year=2015|num-b= | + | {{UMO box|year=2015|num-b=3|num-a=5}} |
| − | [[Category:]] | + | [[Category:Intermediate Algebra Problems]] |
Latest revision as of 02:01, 6 November 2015
Problem
Anastasia and Balthazar need to go to the grocery store, which is 
km away. Anastasia
walks at 
km/hr, and Balthazar walks at 
km/hr. However, they also own a single bike, and
each of them bikes at 
km/hr. They are allowed to go forwards or backwards, and the bike
will not get stolen if they drop it off along the way for the other person to pick up. What is
the shortest amount of time necessary for both of them to get to the grocery store?
Solution
See Also
| 2015 UMO (Problems • Answer Key • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All UMO Problems and Solutions | ||
