Difference between revisions of "2020 AMC 12A Problems/Problem 21"
(Created page with "==Problem 21== How many positive integers <math>n</math> are there such that <math>n</math> is a multiple of <math>5</math>, and the least common multiple of <math>5!</math>...") |
|||
Line 9: | Line 9: | ||
We set up the following equation as the problem states: | We set up the following equation as the problem states: | ||
− | <cmath> \text{lcm}{(5!, n)} = 5\text{gcd}{(10!, n)}</cmath> | + | <cmath> \text{lcm}{(5!, n)} = 5\text{gcd}{(10!, n)}.</cmath> |
Breaking each number into its prime factorization, we see that the equation becomes | Breaking each number into its prime factorization, we see that the equation becomes | ||
− | <cmath> \text{lcm}{(2^3\cdot 3 \cdot 5, n)} = 5\text{gcd}{(2^8\cdot 3^4 \cdot 5^2 \cdot 7, n)}</cmath> | + | <cmath> \text{lcm}{(2^3\cdot 3 \cdot 5, n)} = 5\text{gcd}{(2^8\cdot 3^4 \cdot 5^2 \cdot 7, n)}.</cmath> |
We can now determine the prime factorization of <math>n</math>. We know that its prime factors belong to the set <math>\{2, 3, 5, 7\}</math>, as no factor of <math>10!</math> has <math>11</math> in its prime factorization, nor anything greater. Next, we must find exactly how many different possibilities exist for each. | We can now determine the prime factorization of <math>n</math>. We know that its prime factors belong to the set <math>\{2, 3, 5, 7\}</math>, as no factor of <math>10!</math> has <math>11</math> in its prime factorization, nor anything greater. Next, we must find exactly how many different possibilities exist for each. |
Revision as of 17:46, 1 February 2020
Problem 21
How many positive integers are there such that is a multiple of , and the least common multiple of and equals times the greatest common divisor of and
Solution
We set up the following equation as the problem states:
Breaking each number into its prime factorization, we see that the equation becomes
We can now determine the prime factorization of . We know that its prime factors belong to the set , as no factor of has in its prime factorization, nor anything greater. Next, we must find exactly how many different possibilities exist for each.
There can be anywhere between and 's and to 's. However, since is a multiple of , and we multiply the by , there can only be 's in 's prime factorization. Finally, there can either or 's.
Thus, we can multiply the total possibilities of 's factorization to determine the number of integers which satisfy the equation, giving us . ~ciceronii
2020 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 20 |
Followed by Problem 22 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.