Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2013 AMC 10A Problems/Problem 17"

m (→‎Solution 1)
m (→‎Solution 1)
Line 15: Line 15:
 
A and C visit <math>\frac{60}{3 \cdot 5}-1 = 3</math> times.
 
A and C visit <math>\frac{60}{3 \cdot 5}-1 = 3</math> times.
  
−
B and C visit <math>\frac{60}{4 \cdot 5}-1 = 2</math> times.
+
B and C visit <math>\fra{60}{4 \cdot 5}-1 = 2</math> times.
  
  

Revision as of 10:16, 23 August 2023

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?

$\textbf{(A)}\ 48\qquad\textbf{(B)}\ 54\qquad\textbf{(C)}\ 60\qquad\textbf{(D)}\ 66\qquad\textbf{(E)}\ 72$

Solution 1

The $365$-day time period can be split up into $6$, $60$-day time periods, because after $60$ days, all three of them visit again (Least common multiple of $3$, $4$, and $5$). 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 $60$th day, when all three visit.

A and B visit $\frac{60}{3 \cdot 4}-1 = 4$ times.

A and C visit $\frac{60}{3 \cdot 5}-1 = 3$ times.

B and C visit $\fra{60}{4 \cdot 5}-1 = 2$ (Error compiling LaTeX. Unknown error_msg) times.


This is a total of $9$ visits per $60$ day period. Therefore, the total number of $2$-person visits is $9 \cdot 6 = \boxed{\textbf{(B) }54}$.

  • Note: We do not have to worry about the numbers over 360: ($361,362,363,364,365$) having 2 factors. This is because we can rewrite

$(361,362,363,364,365) \Rightarrow (361,362, 3\cdot 121, 4 \cdot 91, 5 \cdot 73)$. We note that $121$ is not further divisible by 4 or 5, $91$ is not further divisible by 3 or 5, 73 is not further divisible by 3 or 4. Therefore, none of the numbers from $361-365$ have 2 factors of $3,4,$ or $5$, so we can conclude that the answer is indeed $\boxed{54}$

Solution 2

From the information above, we get that $A=3x$ $B=4x$ $C=5x$

Now, we want the days in which exactly two of these people meet up

The three pairs are $(A,B)$, $(B,C)$, $(A,C)$.

Notice that we are trying to find the LCM of each pair.

Hence, $LCM(A,B)=12x$, $LCM(B,C)=20x$, $LCM(A,C)=15x$

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, $LCM(A,B,C)=60x$

Now, we add all of the days up(including overcount).

We get $30+18+24=72$. Now, because $60(6)=360$, we have to subtract $6$ days from every pair. Hence, our answer is $72-18=\boxed{54}\implies\boxed{B}$.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_AMC_10A_Problems/Problem_17&oldid=197334"