2001 AMC 10 Problem 8
Wanda, Darren, Beatrice, and Chi are tutors in the school math lab. Their schedule is as follows: Darren works every third school day, Wanda works every fourth school day, Beatrice works every sixth school day, and Chi works every seventh school day. Today they are all working in the math lab. In how many school days from today will they next be together tutoring in the lab?
Show solution without answering
Key insight
The four tutors are all together again on the first day that is a multiple of 3, 4, 6 and 7 at once. That is their least common multiple, 84.
Solution
- Call today day . Darren works on days , the multiples of . In the same way Wanda works on multiples of , Beatrice on multiples of , and Chi on multiples of .
- So the next day they are all together is the smallest number that is a multiple of , , and at the same time. This is called the least common multiple.
- Break each number into primes: , , , .
- The day must contain every one of those factors. It needs (for ), a (for and ), and a (for ). The is already covered by the and the .
- So the day is .
- Check: , , , . All whole numbers.
The answer is .
Why this works
"Every th day" means the days that are multiples of , so "everyone together again" means a common multiple, and "next" means the smallest one. The least common multiple is usually smaller than the product, because shared factors are only needed once; here the adds nothing new.
Alternative approach
Check the choices from smallest to largest. : , so Wanda is not there. : divides evenly by , , and . Since is the first choice that works, it is the answer.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Count days from today. Darren returns on days (multiples of ), Wanda on multiples of , Beatrice on multiples of , and Chi on multiples of . All four are present exactly on the common multiples of , and the first such day is their least common multiple.
Factor: , , , . The lcm takes the largest power of each prime:
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.7)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.