2013 AMC 10A Problems/Problem 17
Contents
[hide]Problem
Daphne is visited periodically by her three best friends: Alice, Beatrix, and Claire. Alice visits every third day, Beatrix visits every fourth day, and Claire visits every fifth day. All three friends visited Daphne yesterday. How many days of the next -day period will exactly two friends visit her?
Solution 1
The -day time period can be split up into , -day time periods, because after days, all three of them visit again (Least common multiple of , , and ). You can find how many times each pair of visitors can meet by finding the LCM of their visiting days and dividing that number by 60. Remember to subtract , because you do not wish to count the th day, when all three visit.
A and B visit times.
A and C visit times.
B and C visit $\fra{60}{4 \cdot 5}-1 = 2$ (Error compiling LaTeX. Unknown error_msg) times.
This is a total of visits per day period.
Therefore, the total number of -person visits is .
- Note: We do not have to worry about the numbers over 360: () having 2 factors. This is because we can rewrite
. We note that is not further divisible by 4 or 5, is not further divisible by 3 or 5, 73 is not further divisible by 3 or 4. Therefore, none of the numbers from have 2 factors of or , so we can conclude that the answer is indeed
Solution 2
From the information above, we get that
Now, we want the days in which exactly two of these people meet up
The three pairs are , , .
Notice that we are trying to find the LCM of each pair.
Hence, , ,
Notice that we want to eliminate when all these friends meet up. By doing this, we will find the LCM of the three letters.
Hence,
Now, we add all of the days up(including overcount).
We get . Now, because , we have to subtract days from every pair. Hence, our answer is .
See Also
2013 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.