Difference between revisions of "2014 AIME I Problems/Problem 8"

Revision as of 18:05, 28 December 2016

Problem 8

The positive integers $N$ and $N^2$ both end in the same sequence of four digits $abcd$ when written in base 10, where digit a is not zero. Find the three-digit number $abc$ .

Solution (general)

We have that $N^2 - N = N(N - 1)\equiv 0\mod{10000}$

Thus, $N(N-1)$ must be divisible by both $5^4$ and $2^4$ . Note, however, that if either $N$ or $N-1$ has both a 5 and a 2 in its factorization, the other must end in either 1 or 9, which is impossible for a number that is divisible by either 2 or 5. Thus, one of them is divisible by $2^4 = 16$ , and the other is divisible by $5^4 = 625$ . Noting that $625 \equiv 1\mod{16}$ , we see that 625 would work for $N$ , except the thousands digit is 0. The other possibility is that $N$ is a multiple of 16 and $N-1$ is a multiple of 625. In order for this to happen, $N-1$ must be congruent to -1 (mod 16). Since $625 \equiv 1 \mod{16}$ , we know that $15*625 = 9375 \equiv 15 \equiv -1 \mod{16}$ . Thus, $N-1 = 9375$ , so $N = 9376$ , and our answer is $\boxed{937}$ .

Solution (bashing)

let $N= 10000t+1000a+100b+10c+d$ for positive integer values t,a,b,c,d when we square N we get that $N^2=(10000t+1000a+100b+10c+d)^2=10^8t^2+10^6a^2+10^4b^2+10^2c^2+d^2+2(10^7ta+10^6tb+10^5tc+10^4td+10^5ab+10^4ac+10^3bc+10^ad+10^2bd+10cd)$

However we dont have to deal with this whole expression but only with its last 4 digits so it is suffices to consider only: $2000ad+2000bc+100c^2+200bd+20cd+d^2$ now we need to compare each decimal digit with $1000a+100b+10c+d$ and see whether the digits are congrount in base 10. we first consider the ones digits:

$d^2\equiv d \pmod{10}$

this can happen for only 3 values : 1, 5 and 6

we can try to solve each case

Case 1 $(d=1)$

considering the tenths place we have that:

$20cd=20c\equiv 10c \pmod {100}$ so $c= 0$

considering the hundreds place we have that

$200bd+100c^2= 200b \equiv 100b \pmod{1000}$ so again $b=0$

now considering the thousands place we have that

$2000ad+2000bc = 2000a \equiv 1000a \pmod {10000}$ so we get $a=0$ but $a$ cannot be equal to 0 so we consider $d=5$

Case 2 $(d=5)$

considering the tenths place we have that:

$20cd+20=100c+20\equiv 20 \equiv 10c \mod {100}$ ( the extra 20 is carried from $d^2$ which is equal to 25) so $c=2$

considering the hundreds place we have that

$200bd+100c^2+100c= 1000b+600 \equiv600\equiv 100b \pmod{1000}$ ( the extra 100c is carried from the tenths place) so $b=6$

now considering the thousands place we have that

$2000ad+2000bc +1000b= 10000a+24000+ 6000\equiv0\equiv 1000a \pmod {10000}$ ( the extra 1000b is carried from the hundreds place) so a is equal 0 again

Case 3 $(d=6)$

considering the tenths place we have that:

$20cd+30=120c+30\equiv 30+20c \equiv 10c \pmod {100}$ ( the extra 20 is carried from $d^2$ which is equal to 25) if $c=7$ then we have

$30+20*7 \equiv 70\equiv7*10 \pmod{100}$

so $c=7$

considering the hundreds place we have that

$200bd+100c^2+100c+100= 1200b+4900+800 \equiv200b+700\equiv 100b \pmod{1000}$ ( the extra 100c+100 is carried from the tenths place)

if $b=3$ then we have

$700+200*3 \equiv 300\equiv3*100 \pmod {1000}$

so $b=3$

now considering the thousands place we have that

$2000ad+2000bc +1000b+5000+1000= 12000a+42000+ 3000+6000\equiv0\equiv 2000a+1000\equiv 1000a \pmod {10000}$ ( the extra 1000b+6000 is carried from the hundreds place)

if $a=9$ then we have

$2000*9+1000 \equiv 9000\equiv9*1000 \pmod {1000}$

so $a=9$

so we have that the last 4 digits of N are $9376$ and $abc$ is equal to $937$

Solution (not bashing)

By the Chinese Remainder Theorem, the equation $N(N-1)\equiv 0\pmod{10000}$ is equivalent to the two equations: $\begin{align*} N(N-1)&\equiv 0\pmod{16},\\ N(N-1)&\equiv 0\pmod{625}. \end{align*}$ Since $N$ and $N-1$ are coprime, the only solutions are when $(N\mod{16},N\mod{625})\in\{(0,0),(0,1),(1,0),(1,1)\}$ .

Let $\varphi:\mathbb Z/10000\mathbb Z\to\mathbb Z/16\mathbb Z\times\mathbb Z/625\mathbb Z$ , $x\mapsto (x\mod{16},x\mod{625})$ . The statement of the Chinese Remainder theorem is that $\varphi$ is an isomorphism between the two rings. In this language, the solutions are $\varphi^{-1}(0,0)$ , $\varphi^{-1}(0,1)$ , $\varphi^{-1}(1,0)$ , and $\varphi^{-1}(1,1)$ . Now we easily see that $\varphi^{-1}(0,0)=0$ and $\varphi^{-1}(1,1)=1$ . Noting that $625\equiv 1\pmod{16}$ , it follows that $\varphi^{-1}(1,0)=625$ . To compute $\varphi^{-1}(0,1)$ , note that $(0,1)=15(1,0)+(1,1)$ in $\mathbb \mathbb Z/16\mathbb Z\times\mathbb Z/625\mathbb Z$ , so since $\varphi^{-1}$ is linear in its arguments (by virtue of being an isomorphism), $\varphi^{-1}(0,1)=15\varphi^{-1}(1,0)+\varphi^{-1}(1,1)=15\times 625+1=9376$ .

The four candidate digit strings $abcd$ are then $0000,0001,0625,9376$ . Of those, only $9376$ has nonzero first digit, and therefore the answer is $\boxed{937}$ .

Solution (semi-bashing)

Note - $\overline{abcd}$ means the number formed when the digits represented by $a$ , $b$ , $c$ , and $d$ are substituted in. $\overline{abcd}\ne a\times b\times c\times d$ .

WLOG, we can assume that $N$ is a 4-digit integer $\overline{abcd}$ . Note that the only $d$ that will satisfy $N$ will also satisfy $d^2\equiv d\pmod{10}$ , as the units digit of $\overline{abcd}^2$ is affected only by $d$ , regardless of $a$ , $b$ , or $c$ .

By checking the numbers 0-9, we see that the only possible values of $d$ are $d=0, 1, 5, 6$ .

Now, we seek to find $c$ . Note that the only $\overline{cd}$ that will satisfy $N$ will also satisfy $\overline{cd}^2 \equiv \overline{cd}\pmod{100}$ , by the same reasoning as above - the last two digits of $\overline{abcd}^2$ are only affected by $c$ and $d$ . As we already have narrowed choices for $d$ , we start reasoning out.

First, we note that if $d=0$ , then $c=0$ , as a number ending in 0, and therefore divisible by 10, is squared, the result is divisible by 100, meaning it ends in two 0's. However, if $N$ ends in $00$ , then recursively, $a$ and $b$ must be $0$ , as a number divisible by 100 squared ends in four zeros. As $a$ cannot be 0, we throw out this possibility, as the only solution in this case is $0$ .

Now, let's assume that $d=1$ . $\overline{cd}$ is equal to $10c + d = 10c + 1$ . Squaring this gives $100c^2 + 20c + 1$ , and when modulo 100 is taken, it must equal $10c + 1$ . As $c$ is an integer, $100c^2$ must be divisible by 100, so $100c^2+20c+1 \equiv 20c + 1\pmod{100}$ , which must be equivalent to $10c + 1$ . Note that this is really $\overline{(2c)1}$ and $\overline{c1}$ , and comparing the 10's digits. So really, we're just looking for when the units digit of $2c$ and $c$ are equal, and a quick check reveals that this is only true when $c=0$ .However, if we extend this process to find $b$ and $a$ , we'd find that they are also 0. The only solution in this case is $1$ , and since $a=0$ here, this is not our solution. Therefore, there are no valid solutions in this case.

Let's assume that $d=5$ . Note that $(10c + 5)^2 = 100c^2 + 100c + 25$ , and when modulo 100 is taken, 25 is the remainder. So all cases here have squares that end in 25, so $\overline{cd}=25$ is our only case here. A quick check reveals that $25^2=625$ , which works for now.

Now, let $d=6$ . Note that $(10c + 6)^2 = 100c^2 + 120c + 36$ . Taking modulo 100, this reduces to $20c+36$ , which must be equivalent to $10c+6$ . Again, this is similar to $\overline{(2c+3)6}$ and $\overline{c6}$ , so we see when the units digits of $2c+3$ and $c$ are equal. To make checking faster, note that $2c$ is necessarily even, so $2c+3$ is necessarily odd, so $c$ must be odd. Checking all the odds reveals that only $c=3$ works, so this case gives $76$ . Checking quickly $76^2 = 5776$ , which works for now.

Now, we find $b$ , given two possibilities for $\overline{cd}$ .

Start with $\overline{cd} = 25$ . $\overline{bcd} = 100b + \overline{cd} = 100b + 25.$ Note that if we square this, we get $10000b^2 + 5000b + 625$ , which should be equivalent to $100b + 25$ modulo 1000. Note that, since $b$ is an integer, $10000b^2 + 5000 + 625$ simplifies modulo 1000 to $625$ . Therefore, the only $\overline{bcd}$ that works here is $625$ . $625^2 = 390625$ .

Now, assume that $\overline{cd}=76$ . We have $100b + 76$ , and when squared, becomes $10000b^2 + 15200b + 5776$ , which, modulo 1000, should be equivalent to $100b+76$ . Reducing $10000b^2 + 15200b + 5776$ modulo 1000 gives $200b + 776$ . Using the same technique as before, we must equate the hundreds digit of $\overline{(2b+7)76}$ to $\overline{b76}$ , or equate the units digit of $2b+7$ and $b$ . Since $2b+7$ is necessarily odd, any possible $b$ 's must be odd. A quick check reveals that $b=3$ is the only solution, so we get a solution of $376$ . $376^2 = 141376$ .

Finally, we solve for $a$ . Start with $\overline{bcd}=625$ . We have $1000a + 625$ , which, squared, gives $1000000a^2 + 1250000a + 390625$ , and reducing modulo 10000 gives simply 625. So $\overline{abcd}=625$ . However, that makes $a=0$ . Therefore, no solutions exist in this case.

We turn to our last case, $\overline{bcd}=376$ . We have $1000a + 376^2 = 1000000a^2 + 752000a + 141376$ , and reducing modulo 10000 gives $2000a + 1376$ , which must be equivalent to $1000a + 376$ . So we must have $\overline{(2a+1)376}$ being equivalent to $\overline{a376}$ modulo 1000. So, the units digit of $2a+1$ must be equal to $a$ . Since $2a+1$ is odd, $a$ must be odd. Lo and behold, the only possibility for $a$ is $a=3$ . Therefore, $\overline{abcd}=9376$ , so our answer is $\boxed{937}$ .

@@ Line 108: / Line 108: @@
 The four candidate digit strings <math>abcd</math> are then <math>0000,0001,0625,9376</math>. Of those, only <math>9376</math> has nonzero first digit, and therefore the answer is <math>\boxed{937}</math>.
+== Solution (semi-bashing) ==
+*Note - <math>\overline{abcd}</math> means the number formed when the digits represented by <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> are substituted in. <math>\overline{abcd}\ne a\times b\times c\times d</math>.
+WLOG, we can assume that <math>N</math> is a 4-digit integer <math>\overline{abcd}</math>. Note that the only <math>d</math> that will satisfy <math>N</math> will also satisfy <math>d^2\equiv d\pmod{10}</math>, as the units digit of <math>\overline{abcd}^2</math> is affected only by <math>d</math>, regardless of <math>a</math>, <math>b</math>, or <math>c</math>.
+By checking the numbers 0-9, we see that the only possible values of <math>d</math> are <math>d=0, 1, 5, 6</math>.
+Now, we seek to find <math>c</math>. Note that the only <math>\overline{cd}</math> that will satisfy <math>N</math> will also satisfy <math>\overline{cd}^2 \equiv \overline{cd}\pmod{100}</math>, by the same reasoning as above - the last two digits of <math>\overline{abcd}^2</math> are only affected by <math>c</math> and <math>d</math>. As we already have narrowed choices for <math>d</math>, we start reasoning out.
+First, we note that if <math>d=0</math>, then <math>c=0</math>, as a number ending in 0, and therefore divisible by 10, is squared, the result is divisible by 100, meaning it ends in two 0's. However, if <math>N</math> ends in <math>00</math>, then recursively, <math>a</math> and <math>b</math> must be <math>0</math>, as a number divisible by 100 squared ends in four zeros. As <math>a</math> cannot be 0, we throw out this possibility, as the only solution in this case is <math>0</math>.
+Now, let's assume that <math>d=1</math>. <math>\overline{cd}</math> is equal to <math>10c + d = 10c + 1</math>. Squaring this gives <math>100c^2 + 20c + 1</math>, and when modulo 100 is taken, it must equal <math>10c + 1</math>. As <math>c</math> is an integer, <math>100c^2</math> must be divisible by 100, so <math>100c^2+20c+1 \equiv 20c + 1\pmod{100}</math>, which must be equivalent to <math>10c + 1</math>. Note that this is really <math>\overline{(2c)1}</math> and <math>\overline{c1}</math>, and comparing the 10's digits. So really, we're just looking for when the units digit of <math>2c</math> and <math>c</math> are equal, and a quick check reveals that this is only true when <math>c=0</math>.However, if we extend this process to find <math>b</math> and <math>a</math>, we'd find that they are also 0. The only solution in this case is <math>1</math>, and since <math>a=0</math> here, this is not our solution. Therefore, there are no valid solutions in this case.
+Let's assume that <math>d=5</math>. Note that <math>(10c + 5)^2 = 100c^2 + 100c + 25</math>, and when modulo 100 is taken, 25 is the remainder. So all cases here have squares that end in 25, so <math>\overline{cd}=25</math> is our only case here. A quick check reveals that <math>25^2=625</math>, which works for now.
+Now, let <math>d=6</math>. Note that <math>(10c + 6)^2 = 100c^2 + 120c + 36</math>. Taking modulo 100, this reduces to <math>20c+36</math>, which must be equivalent to <math>10c+6</math>. Again, this is similar to <math>\overline{(2c+3)6}</math> and <math>\overline{c6}</math>, so we see when the units digits of <math>2c+3</math> and <math>c</math> are equal. To make checking faster, note that <math>2c</math> is necessarily even, so <math>2c+3</math> is necessarily odd, so <math>c</math> must be odd. Checking all the odds reveals that only <math>c=3</math> works, so this case gives <math>76</math>. Checking quickly <math>76^2 = 5776</math>, which works for now.
+Now, we find <math>b</math>, given two possibilities for <math>\overline{cd}</math>.
+Start with <math>\overline{cd} = 25</math>. <math>\overline{bcd} = 100b + \overline{cd} = 100b + 25.</math> Note that if we square this, we get <math>10000b^2 + 5000b + 625</math>, which should be equivalent to <math>100b + 25</math> modulo 1000. Note that, since <math>b</math> is an integer, <math>10000b^2 + 5000 + 625</math> simplifies modulo 1000 to <math>625</math>. Therefore, the only <math>\overline{bcd}</math> that works here is <math>625</math>. <math>625^2 = 390625</math>.
+Now, assume that <math>\overline{cd}=76</math>. We have <math>100b + 76</math>, and when squared, becomes <math>10000b^2 + 15200b + 5776</math>, which, modulo 1000, should be equivalent to <math>100b+76</math>. Reducing <math>10000b^2 + 15200b + 5776</math> modulo 1000 gives <math>200b + 776</math>. Using the same technique as before, we must equate the hundreds digit of <math>\overline{(2b+7)76}</math> to <math>\overline{b76}</math>, or equate the units digit of <math>2b+7</math> and <math>b</math>. Since <math>2b+7</math> is necessarily odd, any possible <math>b</math>'s must be odd. A quick check reveals that <math>b=3</math> is the only solution, so we get a solution of <math>376</math>. <math>376^2 = 141376</math>.
+Finally, we solve for <math>a</math>. Start with <math>\overline{bcd}=625</math>. We have <math>1000a + 625</math>, which, squared, gives <math>1000000a^2 + 1250000a + 390625</math>, and reducing modulo 10000 gives simply 625. So <math>\overline{abcd}=625</math>. However, that makes <math>a=0</math>. Therefore, no solutions exist in this case.
+We turn to our last case, <math>\overline{bcd}=376</math>. We have <math>1000a + 376^2 = 1000000a^2 + 752000a + 141376</math>, and reducing modulo 10000 gives <math>2000a + 1376</math>, which must be equivalent to <math>1000a + 376</math>. So we must have <math>\overline{(2a+1)376}</math> being equivalent to <math>\overline{a376}</math> modulo 1000. So, the units digit of <math>2a+1</math> must be equal to <math>a</math>. Since <math>2a+1</math> is odd, <math>a</math> must be odd. Lo and behold, the only possibility for <math>a</math> is <math>a=3</math>. Therefore, <math>\overline{abcd}=9376</math>, so our answer is <math>\boxed{937}</math>.
 == See also ==
 {{AIME box|year=2014|n=I|num-b=7|num-a=9}}
 {{MAA Notice}}

2014 AIME I (Problems • Answer Key • Resources)
Preceded by Problem 7	Followed by Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search

Difference between revisions of "2014 AIME I Problems/Problem 8"

Revision as of 18:05, 28 December 2016

Contents

Problem 8

Solution (general)

Solution (bashing)

Solution (not bashing)

Solution (semi-bashing)

See also