
Posted by Denis Borris on 2/8/2009, 5:46 pm
Same general idea as Moby Dick's:
A motorbike's tank is capable of holding one drum of fuel (and storing fuel in containers along the way).
It is allowed to go forward, unload some fuel and then return to base using the fuel remaining in its tank.
At the base, it can be refuelled and can then set out again. When it reaches any fuel which has been
previously stored, it may then use it to partially fill its tank.
We have 2 motorbiles: M1 and M2.
Both can store fuel at only 2 points [1] and [2], these 2 points being different for each.
And both are fuelholics: 1 mile per gallon!
The dope on M1:
[BASE]....a miles....[1]....b miles....[2]....u miles....[335 miles]
At BASE there are m gallons of fuel, and M1's tank has capacity of u gallons.
M1 is able to travel a net of 335 miles: a + b + u = 335.
The dope on M2:
[BASE]...c miles...[1]....d miles....[2].....v miles.....[335 miles]
At BASE there are n gallons of fuel, and M1's tank has capacity of v gallons.
M1 is able to travel a net of 335 miles: c + d + v = 335.
EVERYTHING is integers, including m/u amd n/v.
If a = 75 and c = 67, what's m and n?



Message Thread:
![]()
« Back to thread