Difference between revisions of "2022 AMC 10B Problems/Problem 17"
MRENTHUSIASM (talk | contribs) m (→Video Solution by OmegaLearn Using Digit Cycles) |
MRENTHUSIASM (talk | contribs) m (→Solution) |
||
Line 5: | Line 5: | ||
<math>\textbf{(A) } 2^{606}-1 \qquad\textbf{(B) } 2^{606}+1 \qquad\textbf{(C) } 2^{607}-1 \qquad\textbf{(D) } 2^{607}+1\qquad\textbf{(E) } 2^{607}+3^{607}</math> | <math>\textbf{(A) } 2^{606}-1 \qquad\textbf{(B) } 2^{606}+1 \qquad\textbf{(C) } 2^{607}-1 \qquad\textbf{(D) } 2^{607}+1\qquad\textbf{(E) } 2^{607}+3^{607}</math> | ||
− | ==Solution== | + | ==Solution 1 (Modular Arithmetic)== |
For <math>\textbf{(A)}</math> modulo <math>3,</math> | For <math>\textbf{(A)}</math> modulo <math>3,</math> | ||
Line 15: | Line 15: | ||
\end{align*} | \end{align*} | ||
</cmath> | </cmath> | ||
− | |||
Thus, <math>2^{606} - 1</math> is divisible by <math>3.</math> | Thus, <math>2^{606} - 1</math> is divisible by <math>3.</math> | ||
Line 27: | Line 26: | ||
\end{align*} | \end{align*} | ||
</cmath> | </cmath> | ||
− | |||
Thus, <math>2^{606} + 1</math> is divisible by <math>5.</math> | Thus, <math>2^{606} + 1</math> is divisible by <math>5.</math> | ||
Line 38: | Line 36: | ||
\end{align*} | \end{align*} | ||
</cmath> | </cmath> | ||
− | |||
Thus, <math>2^{607} + 1</math> is divisible by <math>3.</math> | Thus, <math>2^{607} + 1</math> is divisible by <math>3.</math> | ||
Line 50: | Line 47: | ||
\end{align*} | \end{align*} | ||
</cmath> | </cmath> | ||
− | |||
Thus, <math>2^{607} + 3^{607}</math> is divisible by <math>5.</math> | Thus, <math>2^{607} + 3^{607}</math> is divisible by <math>5.</math> | ||
Revision as of 05:51, 28 November 2022
Contents
Problem
One of the following numbers is not divisible by any prime number less than Which is it?
Solution 1 (Modular Arithmetic)
For modulo Thus, is divisible by
For modulo Thus, is divisible by
For modulo Thus, is divisible by
For modulo Thus, is divisible by
Therefore, the answer is
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
~MrThinker (LaTeX Error)
Solution 2 (Factoring)
. A is divisible by 3.
. B is divisible by 5.
. D is divisible by 3.
. E is divisible by 5.
Since all of the other choices have been eliminated, we are left with .
~not_slay
Solution 3 (Elimination)
Mersenne Primes are primes of the form , where is prime. Using the process of elimination, we can eliminate every option except for and . Clearly, isn't prime, so the answer must be .
Video Solution
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Video Solution by OmegaLearn Using Digit Cycles
~ pi_is_3.14
See Also
2022 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.