Difference between revisions of "2019 Mock AMC 10B Problems/Problem 19"
Jayevvms123 (talk | contribs) m (→Solution) |
Jayevvms123 (talk | contribs) m (→Solution) |
||
(One intermediate revision by the same user not shown) | |||
Line 21: | Line 21: | ||
Solution 2 | Solution 2 | ||
− | By LTE Lemma, we know that <math>v_2(x^n - y^n) = v_2(x-y) + | + | By LTE Lemma, we know that <math>v_2(x^n - y^n) = v_2(x-y) + v_2(n) + v_2(x+y)-1</math> |
So plugging in <math>x=3, y=1</math>, and <math>n=2016</math>, we get <math>1+5+2-1 = 7</math> so the answer is <math>2^7 = \boxed{128}</math> | So plugging in <math>x=3, y=1</math>, and <math>n=2016</math>, we get <math>1+5+2-1 = 7</math> so the answer is <math>2^7 = \boxed{128}</math> | ||
+ | |||
+ | <jayevvms123> |
Latest revision as of 23:04, 3 October 2023
Problem
What is the largest power of that divides
?
Solution
.
By simple mod checking, we find that
, and
.
Therefore, the largest powers of that divide each of these numbers are
, and
. The largest power of
that divides
is thus
.
<baker77>
Solution 2
By LTE Lemma, we know that
So plugging in , and
, we get
so the answer is
<jayevvms123>