2019 Mock AMC 10B Problems/Problem 19

Revision as of 20:44, 2 November 2019 by Baker77 (talk | contribs) (Created page with "== Problem == What is the largest power of <math>2</math> that divides <math>3^{2016}-1</math>? <math>\textbf{(A)}\ 16 \qquad\textbf{(B)}\ 32 \qquad\textbf{(C)}\ 64 \qquad\...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

What is the largest power of $2$ that divides $3^{2016}-1$?

$\textbf{(A)}\ 16 \qquad\textbf{(B)}\ 32 \qquad\textbf{(C)}\ 64 \qquad\textbf{(D)}\ 128 \qquad\textbf{(E)}\ 256$

Solution

$3^{2016} - 1 = (3^{1008} - 1)(3^{1008} + 1) = (3^{504} - 1)(3^{504} + 1)(3^{1008} + 1) = (3^{252} - 1)(3^{252} + 1)(3^{504} + 1)(3^{1008} + 1) = (3^{126} - 1)(3^{126} + 1)(3^{252} + 1)(3^{504} + 1)(3^{1008 + 1) = (3^{63} - 1)(3^{63} + 1)(3^{126} + 1)(3^{252} + 1)(3^{504} + 1)(3^{1008 + 1)$ (Error compiling LaTeX. Unknown error_msg). By simple mod checking, we find that $3^{1008} + 1 \equiv 3^{504} + 1 \equiv e^{252} + 1 \equiv 3^{126 + 1 \equiv 3^{63} - 1 \equiv 2$ (Error compiling LaTeX. Unknown error_msg) $\text{mod}$ $4$, and $3^{63} + 1 \equiv 4$ $\text{mod}$ $8$. Therefore, the smallest powers of $2$ that divide each of these numbers are $2, 2, 2, 2, 2, and 4$, respectively. The smallest power of $2$ that divides $3^{2016} - 1$ is thus $2^5 \cdot 4 \equiv 256$.