Difference between revisions of "2020 AMC 12A Problems/Problem 21"
Pi is 3.14 (talk | contribs) (→Video Solution by Richard Rusczyk) |
(→Solution 2) |
||
(One intermediate revision by the same user not shown) | |||
Line 23: | Line 23: | ||
== Solution 2== | == Solution 2== | ||
− | Like the Solution 1, we | + | Like the Solution 1, we start from the equation: |
<cmath>\text{lcm}{(5!, n)} = 5\text{gcd}{(10!, n)}.</cmath> | <cmath>\text{lcm}{(5!, n)} = 5\text{gcd}{(10!, n)}.</cmath> | ||
Line 33: | Line 33: | ||
Similarly, <math>m</math> is a multiple of <math>5</math>, with a form of <math>5\cdot s</math>. We have | Similarly, <math>m</math> is a multiple of <math>5</math>, with a form of <math>5\cdot s</math>. We have | ||
<cmath>s=\text{gcd}{(6\cdot7\cdot8\cdot9\cdot2, 5\cdot s)}=\text{gcd}{(2^5\cdot3^3\cdot7, s)}</cmath> | <cmath>s=\text{gcd}{(6\cdot7\cdot8\cdot9\cdot2, 5\cdot s)}=\text{gcd}{(2^5\cdot3^3\cdot7, s)}</cmath> | ||
− | The equation holds, if <math>s</math> is a divisor of <math>2^5\cdot3^3\cdot7</math>, which has <math>(5+1)(3+1)(1+1)=\boxed{(\textbf{D})48}</math> divisors. | + | The equation holds, if <math>s</math> is a divisor of <math>2^5\cdot3^3\cdot7</math>, which has <math>(5+1)(3+1)(1+1)=\boxed{(\textbf{D})48}</math> divisors. ~Linty Huang |
− | |||
− | |||
== Solution 3 == | == Solution 3 == |
Latest revision as of 17:52, 9 October 2023
Contents
Problem
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 1
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
Solution 2
Like the Solution 1, we start from the equation:
Assume
, with some integer
. It follows that
. It means that
has a divisor
. Since
is a multiple of
,
has a divisor
. Thus,
. The equation can be changed as
We can see that
is also a multiple of
, with a form of
. Substituting it in the above equation, we have
Similarly,
is a multiple of
, with a form of
. We have
The equation holds, if
is a divisor of
, which has
divisors. ~Linty Huang
Solution 3
As in the previous solutions, we start with
From this we have that , and in particular,
. However,
, so we must have
or
. If
, then we have
; because
, this implies that 5 does not divide
, so we must have
.
Now we have , implying that
, and
. Writing out prime factorizations, this gives us
So can have 3, 4, 5, 6, 7, or 8 factors of 2; 1, 2, 3, or 4 factors of two; and 0 or 1 factors of 7. Note that
implies that
has 2 factors of 5. Thus, there are
possible choices for
, and our answer is
.
-gumbymoo
Video Solution by Richard Rusczyk
https://www.youtube.com/watch?v=8S85536jpYw&list=PLyhPcpM8aMvJvwA2kypmfdtlxH90ShZCc&index=1&t=25s - AMBRIGGS
Video Solution by OmegaLearn
https://youtu.be/CWZkTCNu42o?t=846
~ pi_is_3.14
See Also
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.