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 Your Progress

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Jane, Chen and Boris start together to travel the same way [#permalink]
02 Jul 2007, 22:38

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?

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?

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

plz explain your answer. thanks.

D. lcm = 44 hours

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

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

plz explain your answer. thanks.

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)

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).

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

plz explain your answer. thanks.

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.

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

plz explain your answer. thanks.

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.

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.

I´ve done an interview at Accepted.com quite a while ago and if any of you are interested, here is the link . I´m through my preparation of my second...

It’s here. Internship season. The key is on searching and applying for the jobs that you feel confident working on, not doing something out of pressure. Rotman has...