Difference between revisions of "2013 AMC 10A Problems/Problem 17"
(→Solution 2) |
m |
||
Line 1: | Line 1: | ||
==Problem== | ==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 365-day period will exactly two friends visit her? | + | 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 <math>365</math>-day period will exactly two friends visit her? |
<math> \textbf{(A)}\ 48\qquad\textbf{(B)}\ 54\qquad\textbf{(C)}\ 60\qquad\textbf{(D)}\ 66\qquad\textbf{(E)}\ 72 </math> | <math> \textbf{(A)}\ 48\qquad\textbf{(B)}\ 54\qquad\textbf{(C)}\ 60\qquad\textbf{(D)}\ 66\qquad\textbf{(E)}\ 72 </math> | ||
− | ==Solution== | + | ==Solution 1== |
− | The 365-day time period can be split up into <math>6</math> 60-day time periods, because after <math>60</math> days, all three of them visit again (Least common multiple of <math>3</math>, <math>4</math>, and <math>5</math>). | + | The <math>365</math>-day time period can be split up into <math>6</math> <math>60</math>-day time periods, because after <math>60</math> days, all three of them visit again (Least common multiple of <math>3</math>, <math>4</math>, and <math>5</math>). |
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. | 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 1, because you do not wish to count the | + | Remember to subtract <math>1</math>, because you do not wish to count the <math>60</math>th day, when all three visit. |
A and B visit <math>\frac{60}{3 \cdot 4}-1 = 4</math> times. | A and B visit <math>\frac{60}{3 \cdot 4}-1 = 4</math> times. | ||
Line 16: | Line 16: | ||
This is a total of <math>9</math> visits per <math>60</math> day period. | This is a total of <math>9</math> visits per <math>60</math> day period. | ||
− | Therefore, the total number of 2-person visits is <math>9 \cdot 6 = \boxed{\textbf{(B) }54}</math>. | + | Therefore, the total number of <math>2</math>-person visits is <math>9 \cdot 6 = \boxed{\textbf{(B) }54}</math>. |
==Solution 2== | ==Solution 2== |
Revision as of 20:49, 28 December 2019
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. B and C visit times. C and A visit times.
This is a total of visits per day period. Therefore, the total number of -person visits is .
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.