Difference between revisions of "2020 AIME I Problems/Problem 12"
m (→Solution 3 (Elementary and Thorough)) |
m (→Solution 2 (Simpler, just basic mods and Fermat's theorem)) |
||
Line 22: | Line 22: | ||
Calculating the LCM of all these, one gets <math>2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5</math>. Using the factor counting formula, | Calculating the LCM of all these, one gets <math>2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5</math>. Using the factor counting formula, | ||
the answer is <math>3\cdot3\cdot5\cdot6</math> = <math>\boxed{270}</math>. | the answer is <math>3\cdot3\cdot5\cdot6</math> = <math>\boxed{270}</math>. | ||
− | |||
-Solution by thanosaops | -Solution by thanosaops |
Revision as of 23:34, 1 April 2020
Contents
[hide]Problem
Let be the least positive integer for which is divisible by Find the number of positive integer divisors of
Solution 1
Lifting the Exponent shows that so thus, divides . It also shows that so thus, divides .
Now, multiplying by , we see and since and then meaning that we have that by LTE, divides .
Since , and all divide , the smallest value of working is their LCM, also . Thus the number of divisors is .
~kevinmathz
Solution 2 (Simpler, just basic mods and Fermat's theorem)
BY THE WAY, please feel free to correct my formatting. I don't know latex.
Note that for all , is divisible by because that is a factor. That is , so now we can clearly see that the smallest to make the expression divisible by is just . Similarly, we can reason that the smallest to make the expression divisible by is just .
Finally, for , take and of each quantity (They happen to both be and respectively, so you only need to compute once). One knows from Fermat's theorem that the maximum possible minimum for divisibility by is , and other values are factors of . Testing all of them(just ,, using mods-not too bad), is indeed the smallest value to make the expression divisible by , and this clearly is NOT divisible by . Therefore, the smallest to make this expression divisible by is .
Calculating the LCM of all these, one gets . Using the factor counting formula, the answer is = .
-Solution by thanosaops -formatted by MY-2
Solution 3 (Elementary and Thorough)
As usual, denote the highest power of prime that divides . For divisibility by , notice that as , and upon checking mods, is divisible by but not . In addition, is divisible by because , and the rightmost factor equates to . In fact, is the least possible choice to ensure divisibility by because if , with and , we write Then, the rightmost factor is equivalent to , and .
For divisibility by , we'll induct, claiming that for whole numbers . The base case is clear. Then, By the induction hypothesis, . Then, notice that This tells us that is divisible by , but not so that , completing our induction. We can verify that is the least choice of to ensure divisibility by by arguing similarly to the case.
Finally, for , we take the powers of and in mod and mod . Writing out these mods, we have that if and only if , in which . So here we claim that and perform yet another induction. The base case is true: , but . Now then, assuming the induction statement to hold for some , Note that equates to in both mod and mod . We notice that . Writing out the powers of mod , we have . Also when is a multiple of . Hence for , . Thus, , completing our induction. Applying the same argument from the previous two cases, is the least choice to ensure divisibility by .
Our answer is the number of divisors of . It is .
~hnkevin42
See Also
2020 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.