All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Circular Jogging Track Problem (Posted on 2006-04-12) Difficulty: 3 of 5
Three friends A, B and C regularly jog in circular jogging track every morning. The track is 1000 m in circumference.

A takes 8 mins to complete one lap, B takes 10 mins and 40 secs and C takes 12 mins. One day they decided to find out if they set out together in the same direction from a point what would be the fastest time for all of them to meet at any point on the track. What did they conclude?

The second day C decides to run in the opposite direction from the starting point. When will they all meet? Will this be sooner than the time taken on day one? Where do they meet in both cases?

See The Solution Submitted by Salil    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Question re: Wait a minute. | Comment 6 of 11 |
(In reply to Wait a minute. by vilnius)

In a standard track each runner has his or her own lane. On a curved track this forces the outer lanes to have starting positions further 'downstream' to offset the increase distance of the outside lanes in a curve. In distance running it is usually required that the runner stays in his or her own lane for a set distance to offset this and allow a staggered start. If the lanes are 3' wide AND THEY ALL START AT THE SAME POINT they shouldn't meet at the start especially if the times given were for running on the inside lane (or outside if the circumference given is for the outer lane).
Besides on the second day if they are not in there own lanes they would surely collide.
  Posted by vilnius on 2006-04-12 21:13:47

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information