Difference between revisions of "2022 AMC 12B Problems/Problem 15"

Revision as of 00:24, 20 November 2022

Problem

One of the following numbers is not divisible by any prime number less than $10$ . Which is it? $\textbf{(A) } 2^{606}-1 \qquad \textbf{(B) } 2^{606}+1 \qquad \textbf{(C) } 2^{607}-1 \qquad \textbf{(D) } 2^{607}+1 \qquad \text{(E) } 2^{607}+3^{607}$

Solution 1 (Process of Elimination)

We examine option E first. $2^{607}$ has a units digit of $8$ (Taking the units digit of the first few powers of two gives a pattern of $2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, 6,\cdots$ ) and $3^{607}$ has a units digit of $7$ (Taking the units digit of the first few powers of three gives a pattern of $3, 9, 7, 1, 3, 9, 7, 1, 3, 9, 7, 1,\cdots$ ). Adding $7$ and $8$ together, we get $15$ , which is a multiple of $5$ , meaning that $2^{607}+3^{607}$ is divisible by 5.

Next, we examine option D. We take the first few powers of $2$ added with $1$ : $2^1+1=3$ $2^2+1=5$ $2^3+1=9$ $2^4+1=17$ $2^5+1=33$ $2^6+1=65$ $2^7+1=129$

We see that the odd powers of $2$ added with 1 are multiples of three. If we continue this pattern, $2^{607}+1$ will be divisible by $3$ . (The reason why this pattern works: When you multiply $2 \equiv2\text{mod} 3$ by $2$ , you obtain $4 \equiv1 \text{mod} 3$ . Multiplying by $2$ again, we get $1\cdot2\equiv2 \text{mod} 3$ . We see that in every cycle of two powers of $2$ , it goes from $2 \text{mod}3$ to $1 \text{mod}3$ and back to $2 \text{mod}3$ .)

Next, we examine option B. We see that $2^{606}$ has a units of digits of $4$ (Taking the units digit of the first few powers of two gives a pattern of $2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, 6,\cdots$ ). Adding $1$ to $4$ , we get $5$ . Since $2^{606}+1$ has a units digit of $5$ , it is divisible by $5$ .

Lastly, we examine option A. Using the difference of cubes factorization $a^3-b^3=(a-b)(a^2+ab+b^2)$ , we have $2^{606}-1^3=(2^{202}-1)(2^{404}+2^{202}+1)$ . Since $2^{404}+2^{202}+1\equiv0\text{mod}3$ (Every term in the sequence is equivalent to $1\text{mod}3$ ), $2^{606-1}$ is divisible by $3$ .

Since we have eliminated every option except C, $\boxed{\text{(C)}2^{607}-1}$ is not divisible by any prime less than $10$ .

Solution 1.1 (Process of Elimination + Number Theory)

We know that the prime numbers less than 10 are $2,3,5$ and $7$ . We can start by testing if any of the answer choices are divisible by $2$ . We see that they are all sums of one even number and one odd number, which is simply odd. So, we cannot exclude any answer choices so far. Now, let's check divisibility by $3$ . We can use the fact that $2 \equiv -1 \pmod{3}$ to our advantage:

$(\text{A})\hspace{0.1in} 2^{606}-1$ $\equiv (-1)^{606} -1$ $\equiv 1-1$ $\equiv 0 \pmod{3}$

$(\text{B}) \hspace{0.1in} 2^{606}+1$ $\equiv (-1)^{606} +1$ $\equiv 1+1$ $\equiv 2 \pmod{3}$

$(\text{C})\hspace{0.1in} 2^{607}-1$ $\equiv (-1)^{607} -1$ $\equiv -1 - 1$ $\equiv -2 \pmod{3}$

$(\text{D})\hspace{0.1in} 2^{607} +1 \equiv (-1)^{607} +1 \equiv -1+1 \equiv 0 \pmod{3}$

$(\text{E}) \hspace{0.1in} 2^{607} + 3^{607} \equiv 2^{607} \equiv (-1)^{607} \equiv -1 \pmod{3}$

So, we eliminate choices A and D from divisibility by 3. Now, we move onto divisibility by 5. We can use cycling of powers to find useful remainders. Let's start with choice $B$ .

$(\text{B}) \hspace{0.1in} 2^{606}+1$

We see that the remainders of powers of $2$ when divided by $5$ cycle in a pattern: $2,4,3,1,2,4,3,1 \dots$ . Since the pattern cycles every 4 terms, we use modulo 4 to simplify 606, getting that $606 \equiv 2\pmod{4}$ . So, we get that $2^{606}$ is congruent modulo 5 to the second term of our pattern, so $2^{606} \equiv{4} \pmod{5}$ . Thus, $2^{606}+1 \equiv 4+1 \equiv 5\equiv 0\pmod{5}$ . We now eliminate choice B and compare choices C and E.

$(\text{E}) \hspace{0.1in} 2^{607} + 3^{607}$

Looking at choice E, we see that we have to do similar cycling for powers of $3$ . We get a pattern of $3,4,2,1,3,4,2,1 \dots$ . Since this pattern also cycles every 4 terms, we use modulo 4 to simplify 607, getting that $607 \equiv 3\pmod{4}$ . Both the power of 3 and the power of 2 have an exponent of 607, so we use the third term (since we just found that $607 \equiv 3\pmod{4}$ ) in each corresponding 4 term pattern to get that $2^{607} + 3^{607} \equiv 3+2 \equiv 5 \equiv 0\pmod{5}$ . We eliminate choice E, and we are left with the correct answer: choice $\boxed{(\text{C}) \hspace{0.1in} 2^{607}-1}$

~TaeKim

Solution 2 (Factoring, Process of Elimination)

We have $\textbf{(A)} = 2^{606} - 1 = 4^{303} - 1 = (4^{101} - 1)(4^{202} + 4^{101} + 1) \equiv 0 \pmod 3$ because $4^x \equiv 0 \pmod 3$ for all positive integers $x$ .

We have $\textbf{(B)} = 2^{606} + 1 = 4^{303} + 1 = (4^{101} + 1)(4^{202} - 4^{101} + 1) \equiv 0 \pmod 5$ because $4^x \equiv 0 \pmod 5$ for all positive odd integers $x$ .

We have $\textbf{(D)} = 2^{607} + 1 = (2 + 1)(1 - 2 + 4 - 8 + \cdots + 2^{606}) \equiv 0 \pmod 3$ .

We have $\textbf{(E)} = 2^{607} + 3^{607} = (2+3)(3^{606} + 3^{605}2^1 + 3^{604}2^2 + \cdots + 2^606) \equiv 0 \pmod 5$ .

Thus, our only answer left is $\boxed{(\text{C}) \hspace{0.1in} 2^{607}-1}$

~mathboy100

@@ Line 75: / Line 75: @@
 ~TaeKim
+==Solution 2 (Factoring, Process of Elimination)==
+We have <math>\textbf{(A)} = 2^{606} - 1 = 4^{303} - 1 = (4^{101} - 1)(4^{202} + 4^{101} + 1) \equiv 0 \pmod 3</math> because <math>4^x \equiv 0 \pmod 3</math> for all positive integers <math>x</math>.
+We have <math>\textbf{(B)} = 2^{606} + 1 = 4^{303} + 1 = (4^{101} + 1)(4^{202} - 4^{101} + 1) \equiv 0 \pmod 5</math> because <math>4^x \equiv 0 \pmod 5</math> for all positive odd integers <math>x</math>.
+We have <math>\textbf{(D)} = 2^{607} + 1 = (2 + 1)(1 - 2 + 4 - 8 + \cdots + 2^{606}) \equiv 0 \pmod 3</math>.
+We have <math>\textbf{(E)} = 2^{607} + 3^{607} = (2+3)(3^{606} + 3^{605}2^1 + 3^{604}2^2 + \cdots + 2^606) \equiv 0 \pmod 5</math>.
+Thus, our only answer left is <math>\boxed{(\text{C}) \hspace{0.1in} 2^{607}-1}</math>
+~mathboy100
 == See Also ==
 {{AMC12 box|year=2022|ab=B|num-b=14|num-a=16}}
 {{MAA Notice}}

2022 AMC 12B (Problems • Answer Key • Resources)
Preceded by Problem 14	Followed by Problem 16
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 12 Problems and Solutions

Page

Toolbox

Search