# Friends Walking !

## Recommended Posts

Two friends A and B set out for a morning walk around the Building on the defined Walking Path starting from the same point.

A will finish his walk when he completes 10 rounds.

A walks twice as fast as B.

If they walk in the opposite direction how many times they cross each other when A finishes his walk ?

If they walk in the same direction how many times A overtakes B before he finishes his walk.

##### Share on other sites

This must be a very simple teaser. Why no one has solved it yet ?

##### Share on other sites

• 2 months later...

I think :-

When they walk in opposite directions, A crosses B 14 times and they meet when A finishes.

When they walk in the same direction, A overtakes B 4 times, and catches up again at the end.

##### Share on other sites

I thought about this puzzle for a long time, but I could not come up with anything, I think the answer should be ingeniously simple.

##### Share on other sites

18

once on the first lap

twice on laps 2-9

once on the last lap.

##### Share on other sites

There is a formula for this, it is the same one used to find synodic periods for planets etc. (for example, how long it takes between Earth and Mars passing each other as they orbit the Sun.)

The formula is T = 1/(1/p1-1/p2)

Where p1 id the time it takes for one plane to complete is orbit and p2 is the time for the other planet to complete is orbit.

In this case we are not given times, so we will simply give B a complete circuit walking time of 1  time unit and thus A has a complete circuit walking time of 1/2 time unit.

Thus for when they are walking in the same direction T = 1/(1/(1/2)-1/1) - 1/(2-1) =1

Meaning that A passes B every time B has completed a complete circuit. This works out to 5 times if you count the last time they meet up again at the end of the walk (4 if you don't.

For when they walk opposite of each other you make one of the times negative, giving T=1/(1/(1/2)-1/(-1)) = 1(2+1) =1/3

A and B meet when B has completed each 1/3 of his complete loop, and since B makes 5 complete loops, they meet 15 times if you count the last meeting ( 14 if not).

So Give Jon O'Starr a star.

##### Share on other sites

15 and 5 are the Right answers ! Well done !!

Edited by Commander

## Create an account or sign in to comment

You need to be a member in order to leave a comment

## Create an account

Sign up for a new account in our community. It's easy!

Register a new account