Difference between revisions of "2013 AMC 8 Problems/Problem 10"
m (→Another Similar Solution) |
m (→Another Similar Solution) |
||
| Line 29: | Line 29: | ||
From Solution 1, | From Solution 1, | ||
the prime factorization of <math>180 = 2^2 \cdot 3^2 \cdot 5</math>. | the prime factorization of <math>180 = 2^2 \cdot 3^2 \cdot 5</math>. | ||
| − | The prime factorization of <math>594 = 2 \cdot 3^3 \cdot 11</math>.\\ | + | The prime factorization of <math>594 = 2 \cdot 3^3 \cdot 11</math>. \\ |
Hence, <math>\operatorname{lcm} (180,594) = 2^2 \cdot 3^3 \cdot 5 \cdot 11</math>, and <math>\operatorname{gcf} (180,594) = 2 \cdot 3^2</math> \\ | Hence, <math>\operatorname{lcm} (180,594) = 2^2 \cdot 3^3 \cdot 5 \cdot 11</math>, and <math>\operatorname{gcf} (180,594) = 2 \cdot 3^2</math> \\ | ||
Therefore, <math>\frac{\operatorname{lcm} (180,594)}{\operatorname{gcf} (180,594)} = \frac{2^2 \cdot 3^3 \cdot 5 \cdot 11}{2 \cdot 3^2} = 2 \cdot 3 \cdot 5 \cdot 11 \cdot = 330 \Longrightarrow \boxed{\textbf{(C)}\ 330}</math> | Therefore, <math>\frac{\operatorname{lcm} (180,594)}{\operatorname{gcf} (180,594)} = \frac{2^2 \cdot 3^3 \cdot 5 \cdot 11}{2 \cdot 3^2} = 2 \cdot 3 \cdot 5 \cdot 11 \cdot = 330 \Longrightarrow \boxed{\textbf{(C)}\ 330}</math> | ||
Revision as of 19:43, 8 December 2017
Problem
What is the ratio of the least common multiple of 180 and 594 to the greatest common factor of 180 and 594?
Solution 1
To find either the LCM or the GCF of two numbers, always prime factorize first.
The prime factorization of 
.
The prime factorization of 
.
Then, to find the LCM, we have to find the greatest power of all the numbers there are; if one number is one but not the other, use it (this is 
). Multiply all of these to get 5940.
For the GCF of 180 and 594, use the least power of all of the numbers that are in both factorizations and multiply. 
= 18.
Thus the answer = 
= 
.
Similar Solution
We start off with a similar approach as the original solution. From the prime factorizations, the GCF is 
.
It is a well known fact that 
. So we have, 
.
Dividing by yields 
.
Therefore, 
.
Another Similar Solution
From Solution 1,
the prime factorization of 
.
The prime factorization of 
. \\
Hence, 
, and 
\\
Therefore, 
See Also
| 2013 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
