Jane, Chen and Boris start together to travel the same way : Quant Question Archive [LOCKED]
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 12:16

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# Jane, Chen and Boris start together to travel the same way

Author Message
Manager
Joined: 25 Jul 2006
Posts: 97
Followers: 1

Kudos [?]: 1 [0], given: 0

Jane, Chen and Boris start together to travel the same way [#permalink]

### Show Tags

02 Jul 2007, 22:38
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours

(B) 12 hours

(C) 11 hours

(D) 44 hours

(E) 200/11 hours

Manager
Joined: 07 Jan 2007
Posts: 59
Followers: 1

Kudos [?]: 2 [0], given: 0

### Show Tags

02 Jul 2007, 23:10
for them to meet at the starting point after some hours, they all should have travelled a distance which is a multiple of 20.

(A) 40 hours
distances travelled by each of them are 160, 220, 320(40*4, 40*5.5, 40*8)

(B) 12 hours
distances travelled: 48, 66, 96

(C) 11 hours
distances travelled: 44, 60.5, 88

(D) 44 hours
distances travelled: 176, *, *

(E) 200/11 hours
distances travelled: 800/11, *, *

except A) all others have a distance which is not a multiple of 20.
Ans is A)
Director
Joined: 26 Feb 2006
Posts: 904
Followers: 4

Kudos [?]: 107 [0], given: 0

### Show Tags

02 Jul 2007, 23:30
Himalayan wrote:
oops wrote:
Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours
(B) 12 hours
(C) 11 hours
(D) 44 hours
(E) 200/11 hours

D. lcm = 44 hours

oops oops.....

Update: A not D.
Senior Manager
Joined: 04 Jun 2007
Posts: 346
Followers: 1

Kudos [?]: 29 [0], given: 0

### Show Tags

02 Jul 2007, 23:33
Himalayan wrote:
oops wrote:
Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours

(B) 12 hours

(C) 11 hours

(D) 44 hours

(E) 200/11 hours

D. lcm = 44 hours

I think it should be (Distance)/(GCD of the speeds).
Time = (20)/(1/2) = 40 kms.
Intern
Joined: 05 Apr 2007
Posts: 16
Followers: 0

Kudos [?]: 0 [0], given: 0

### Show Tags

03 Jul 2007, 02:19
Hi

This is my solution:

time for every person to make full circle:

20 km / 4 kmh = 5 hours
20 km / 5 kmh = 4 hours
20 km / 0.5 kmh = 10 hours
20 km / 8 kmh = 2.5 hours

We should find LCM for (5, 4, 10, 2.5) but before we have to make them integer (multiple by 2)
LCM (10, 8, 20, 5) = 40

GMAT Instructor
Joined: 04 Jul 2006
Posts: 1264
Followers: 29

Kudos [?]: 298 [0], given: 0

### Show Tags

03 Jul 2007, 03:52
oops wrote:
Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours

(B) 12 hours

(C) 11 hours

(D) 44 hours

(E) 200/11 hours

Keep in mind that there are only three people, who take 4, 40/11 and 5/2 hours to go around once. In h hours, they make h/4, 11h/40 and 2h/5 laps respectively. The number of laps must be an integer in each case, so h has to be a multiple of 4 , 40 and 5. The smallest possible value of h is 40. (A)
Manager
Joined: 25 Jul 2006
Posts: 97
Followers: 1

Kudos [?]: 1 [0], given: 0

### Show Tags

11 Jul 2007, 14:15
buffetfollower wrote:
for them to meet at the starting point after some hours, they all should have travelled a distance which is a multiple of 20.

(A) 40 hours
distances travelled by each of them are 160, 220, 320(40*4, 40*5.5, 40*8)

(B) 12 hours
distances travelled: 48, 66, 96

(C) 11 hours
distances travelled: 44, 60.5, 88

(D) 44 hours
distances travelled: 176, *, *

(E) 200/11 hours
distances travelled: 800/11, *, *

except A) all others have a distance which is not a multiple of 20.
Ans is A)

yes, this is an excellent fast approach for this particular problem - the caveat being if there is more than one answer choice that is a multiple of the distance (the least multiple value may not necessarily be correct given other speed combinations).
Manager
Joined: 25 Jul 2006
Posts: 97
Followers: 1

Kudos [?]: 1 [0], given: 0

### Show Tags

11 Jul 2007, 14:25
kevincan wrote:
oops wrote:
Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours

(B) 12 hours

(C) 11 hours

(D) 44 hours

(E) 200/11 hours

Keep in mind that there are only three people, who take 4, 40/11 and 5/2 hours to go around once. In h hours, they make h/4, 11h/40 and 2h/5 laps respectively. The number of laps must be an integer in each case, so h has to be a multiple of 4 , 40 and 5. The smallest possible value of h is 40. (A)

kevincan, this is a nice way of figuring it out.
i was familiar with the LCM method (taking the LCM of the time it takes to complete one lap), but was stuck bcoz the LCM of 4, 40/11 and 5/2 wouldn't work in this case. your approach is super!

BTW, what is a quick way to solve the problem if it is not required that they meet at the starting point i.e. find the time it takes for them to all meet the very first time, wherever it be.
Director
Joined: 09 Aug 2006
Posts: 763
Followers: 1

Kudos [?]: 192 [0], given: 0

### Show Tags

12 Jul 2007, 02:22
sumande wrote:
Himalayan wrote:
oops wrote:
Jane, Chen and Boris start together to travel the same way around a circular path of 20 kms. Their speeds are 4, 5 and 1/2, and 8 kms per hour respectively. When will they meet at the starting point?

(A) 40 hours

(B) 12 hours

(C) 11 hours

(D) 44 hours

(E) 200/11 hours

D. lcm = 44 hours

I think it should be (Distance)/(GCD of the speeds).
Time = (20)/(1/2) = 40 kms.

Sumande,
Why should it be D/(GCD of Speeds)? Thanks.
Director
Joined: 09 Aug 2006
Posts: 763
Followers: 1

Kudos [?]: 192 [0], given: 0

### Show Tags

12 Jul 2007, 02:29
Andrey2010 wrote:
Hi

This is my solution:

time for every person to make full circle:

20 km / 4 kmh = 5 hours
20 km / 5 kmh = 4 hours
20 km / 0.5 kmh = 10 hours
20 km / 8 kmh = 2.5 hours

We should find LCM for (5, 4, 10, 2.5) but before we have to make them integer (multiple by 2)
LCM (10, 8, 20, 5) = 40

20/.5=10 hours???
Senior Manager
Joined: 03 Jun 2007
Posts: 384
Followers: 3

Kudos [?]: 13 [0], given: 0

### Show Tags

12 Jul 2007, 09:51
Oops I got 200/11. Now I see why it is 40. Good question
Manager
Joined: 25 Jul 2006
Posts: 97
Followers: 1

Kudos [?]: 1 [0], given: 0

### Show Tags

12 Jul 2007, 10:43
dahcrap wrote:
Oops I got 200/11. Now I see why it is 40. Good question

glad you got 200/11 - am happy that somebody thought the same as I did.
but the OA is 40.
200/11 was not in the answer choices. i added it since that is what i got using the LCM approach (LCM of 4, 40/11 and 5/2 - the time it takes for each of them to complete a lap), which seemed to me as the right approach (and works for most other similar problems).

however, i later realized 200/11 is not the LCM of 4, 40/11 and 5/2 and I made an error in including it. i think now, kevincan's method is correct (although backsolving (finding multiple of 20) is another much easier method, it cannot be used in the general case).

finally, the real challenging part is a variation of this question - i.e. a good method to find when they meet (for the first time) at whatever point on the track (i.e. if NOT specified that they meet at the starting point). the above solutions will not work for this case. i tried to do it using pairwise LCM method, but took way too much time. if anyone has some insight into that, plz explain.
12 Jul 2007, 10:43
Display posts from previous: Sort by