Problem #PRU-88129

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

Jack and Ben had a bicycle on which they went to a neighborhood village. They rode it in turns, but whenever one rode, the other walked and did not run. They managed to arrive in the village at the same time and almost twice as fast than if they had both walked. How did they do it?