Difference between revisions of "2020 AIME I Problems/Problem 12"

(Solution 2 (Simpler, just basic mods and Fermat's theorem))
(Solution 1)
Line 5: Line 5:
 
Lifting the Exponent shows that <cmath>v_3(149^n-2^n) = v_3(n) + v_3(147) = v_3(n)+1</cmath> so thus, <math>3^2</math> divides <math>n</math>. It also shows that <cmath>v_7(149^n-2^n) = v_7(n) + v_7(147) = v_7(n)+2</cmath> so thus, <math>7^5</math> divides <math>n</math>.  
 
Lifting the Exponent shows that <cmath>v_3(149^n-2^n) = v_3(n) + v_3(147) = v_3(n)+1</cmath> so thus, <math>3^2</math> divides <math>n</math>. It also shows that <cmath>v_7(149^n-2^n) = v_7(n) + v_7(147) = v_7(n)+2</cmath> so thus, <math>7^5</math> divides <math>n</math>.  
  
 +
The divisibility criterion implies <math>149^n\equiv 2^n \pmod{5}</math>. This only occurs when <math>4 | n</math>, so let <math>n=4m</math>. We see <cmath>5 = v_5(149^{4m}-2^{4m}) = v_5((149^4)^{m}-(2^4)^{m}) = v_5(149^4-2^4)+v_5(m)</cmath> Since <math>149^{4} \equiv 1 \pmod{25}</math> and <math>16^1 \equiv 16 \pmod{25}</math>, then <math>v_5(149^4-2^4)=1</math>, so <math>v_5(m)=5</math>, hence <math>4 \cdot 5^4</math> divides <math>n</math>.
  
Now, multiplying <math>n</math> by <math>4</math>, we see <cmath>v_5(149^{4n}-2^{4n}) = v_5(149^{4n}-16^{n})</cmath> and since <math>149^{4} \equiv 1 \pmod{25}</math> and <math>16^1 \equiv 16 \pmod{25}</math> then <math>v_5(149^{4n}-2^{4n})=1</math> meaning that we have that by LTE, <math>4 \cdot 5^4</math> divides <math>n</math>.  
+
Since <math>3^2</math>, <math>7^5</math> and <math>4\cdot 5^4</math> all divide <math>n</math>, the smallest value of <math>n</math> working is their LCM, also <math>3^2 \cdot 7^5 \cdot 4 \cdot 5^4 = 2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5</math>. Thus the number of divisors is <math>(2+1)(2+1)(4+1)(5+1) = \boxed{270}</math>.
  
Since <math>3^2</math>, <math>7^5</math> and <math>4\cdot 5^4</math> all divide <math>n</math>, the smallest value of <math>n</math> working is their LCM, also <math>3^2 \cdot 7^5 \cdot 4 \cdot 5^4 = 2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5</math>. Thus the number of divisors is <math>(2+1)(2+1)(4+1)(5+1) = \boxed{270}</math>.
+
~kevinmathz + fireflame241
  
~kevinmathz
 
 
== Solution 2 (Simpler, just basic mods and Fermat's theorem)==
 
== Solution 2 (Simpler, just basic mods and Fermat's theorem)==
  

Revision as of 22:52, 13 March 2020

Problem

Let $n$ be the least positive integer for which $149^n-2^n$ is divisible by $3^3\cdot5^5\cdot7^7.$ Find the number of positive integer divisors of $n.$

Solution 1

Lifting the Exponent shows that \[v_3(149^n-2^n) = v_3(n) + v_3(147) = v_3(n)+1\] so thus, $3^2$ divides $n$. It also shows that \[v_7(149^n-2^n) = v_7(n) + v_7(147) = v_7(n)+2\] so thus, $7^5$ divides $n$.

The divisibility criterion implies $149^n\equiv 2^n \pmod{5}$. This only occurs when $4 | n$, so let $n=4m$. We see \[5 = v_5(149^{4m}-2^{4m}) = v_5((149^4)^{m}-(2^4)^{m}) = v_5(149^4-2^4)+v_5(m)\] Since $149^{4} \equiv 1 \pmod{25}$ and $16^1 \equiv 16 \pmod{25}$, then $v_5(149^4-2^4)=1$, so $v_5(m)=5$, hence $4 \cdot 5^4$ divides $n$.

Since $3^2$, $7^5$ and $4\cdot 5^4$ all divide $n$, the smallest value of $n$ working is their LCM, also $3^2 \cdot 7^5 \cdot 4 \cdot 5^4 = 2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5$. Thus the number of divisors is $(2+1)(2+1)(4+1)(5+1) = \boxed{270}$.

~kevinmathz + fireflame241

Solution 2 (Simpler, just basic mods and Fermat's theorem)

Note that for all n, $149^n - 2^n$ is divisible by 1$49-2 = 147$ because that is a factor. That is $3\cdot7^2$, so now we can clearly see that the smallest $n$ to make the expression divisible by $3^3$ is just $3^2$. Similarly, we can reason that the smallest n to make the expression divisible by $7^7$ is just $7^5$.

Finally, for $5^5$, take mod $5$ and mod $25$ of each quantity (They happen to both be $-1$ and $2$ respectively, so you only need to compute once). One knows from Fermat's theorem that the maximum possible minimum $n$ for divisibility by $5$ is $4$, and other values are factors of $4$. Testing all of them (just $1,2,4$ using mods-not too bad), $4$ is indeed the smallest value to make the expression divisible by $5$, and this clearly is NOT divisible by $25$. Therefore, the smallest $n$ to make this expression divisible by $5^5$ is $2^2 \cdot 5^4$.

Calculating the LCM of all these, one gets $2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5$. Using the factor counting formula, the answer is $3\cdot 3\cdot 5\cdot 6$ = $\boxed{270}$.

-Solution by thanosaops

See Also

2020 AIME I (ProblemsAnswer KeyResources)
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. AMC logo.png