2020 AIME I Problems/Problem 12
Let be the least positive integer for which is divisible by Find the number of positive integer divisors of
Lifting the Exponent shows that so thus, divides . It also shows that so thus, divides .
Now, setting (necessitated by in order to set up LTE), we see and since and then meaning that we have that by LTE, and divides .
Since , and all divide , the smallest value of working is their LCM, also . Thus the number of divisors is .
clarified by another user
Lol you can get by just Euler Totient.
Solution 2 (Simpler, just basic mods and Fermat's theorem)
Note that for all , is divisible by by difference of th powers. 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
~also formatted by pandyhu2001
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 .
Solution 4 (Official MAA)
Analyze each prime power separately. Start with the case of . By the Binomial Theorem, Because is divisible by , all terms after the first two are divisible by , and the exponent of in the first term is less than that in the second term. Hence it is necessary and sufficient that , that is, . For the case, consider the same expansion as in the previous case. Because is divisible by , all terms after the first three are divisible by , and the exponent of in the first term is less than that in the second and third term. Hence it is necessary and sufficient that , that is, . For the case, working modulo gives , so it must be that . Let , and let . Note that is an integer not divisible by . Expand by the Binomial Theorem again to get All terms after the first four are divisible by , and the exponent of in the first term is less than that in the second, third, or fourth term. Hence it is necessary and sufficient that . Thus , and it follows that . Therefore the least is . The requested number of divisors is .
The results of the above cases can be generalized using the following lemma.
Lifting the Exponent Lemma: Let be an odd prime, and let and be integers relatively prime to such that . Let be a positive integer. Then the number of factors of that divide is equal to the number of factors of that divide plus the number of factors of that divide .
|2020 AIME I (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|