返回题库

AIME 1988 · 第 9 题

AIME 1988 — Problem 9

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Find the smallest positive integer whose cube ends in 888888.

解析

Solution 1

A little bit of checking tells us that the units digit must be 2. Now our cube must be in the form of (10k+2)3(10k + 2)^3; using the binomial theorem gives us 1000k3+600k2+120k+81000k^3 + 600k^2 + 120k + 8. Since we are looking for the tens digit, mod100\mod{100} we get 20k+888(mod100)20k + 8 \equiv 88 \pmod{100}. This is true if the tens digit is either 44 or 99. Casework:

  • 44: Then our cube must be in the form of (100k+42)33(100k)(42)2+423200k+88(mod1000)(100k + 42)^3 \equiv 3(100k)(42)^2 + 42^3 \equiv 200k + 88 \pmod{1000}. Hence the lowest possible value for the hundreds digit is 44, and so 442442 is a valid solution.
  • 99: Then our cube is (100k+92)33(100k)(92)2+923200k+688(mod1000)(100k + 92)^3 \equiv 3(100k)(92)^2 + 92^3 \equiv 200k + 688 \pmod{1000}. The lowest possible value for the hundreds digit is 11, and we get 192192. Hence, since 192<442192 < 442, the answer is 192\fbox{192}

Solution 2

n3888(mod1000)    n30(mod8)n^3 \equiv 888 \pmod{1000} \implies n^3 \equiv 0 \pmod 8 and n313(mod125)n^3 \equiv 13 \pmod{125}. n2(mod5)n \equiv 2 \pmod 5 due to the last digit of n3n^3. Let n=5a+2n = 5a + 2. By expanding, 125a3+150a2+60a+813(mod125)    5a2+12a1(mod25)125a^3 + 150a^2 + 60a + 8 \equiv 13 \pmod{125} \implies 5a^2 + 12a \equiv 1 \pmod{25}.

By looking at the last digit again, we see a3(mod5)a \equiv 3 \pmod5, so we let a=5a1+3a = 5a_1 + 3 where a1Z+a_1 \in \mathbb{Z^+}. Plugging this in to 5a2+12a1(mod25)5a^2 + 12a \equiv 1 \pmod{25} gives 10a1+61(mod25)10a_1 + 6 \equiv 1 \pmod{25}. Obviously, a12(mod5)a_1 \equiv 2 \pmod 5, so we let a1=5a2+2a_1 = 5a_2 + 2 where a2a_2 can be any non-negative integer.

Therefore, n=2+5(3+5(2+5a2))=125a2+67n = 2 + 5(3+ 5(2+5a_2)) = 125a_2 + 67. n3n^3 must also be a multiple of 88, so nn must be even. 125a2+670(mod2)    a21(mod2)125a_2 + 67 \equiv 0 \pmod 2 \implies a_2 \equiv 1 \pmod 2. Therefore, a2=2a3+1a_2 = 2a_3 + 1, where a3a_3 is any non-negative integer. The number nn has form 125(2a3+1)+67=250a3+192125(2a_3+1)+67 = 250a_3+192. So the minimum n=192n = \boxed{192}.

BTW, explanation is pretty bad

Solution 3

Let x3=1000a+888x^3 = 1000a + 888. We factor an 88 out of the right hand side, and we note that xx must be of the form x=2yx = 2y, where yy is a positive integer. Then, this becomes y3=125a+111y^3 = 125a + 111. Taking mod 55, 2525, and 125125, we get y31(mod5)y^3 \equiv 1\pmod 5, y311(mod25)y^3 \equiv 11\pmod{25}, and y3111(mod125)y^3 \equiv 111\pmod{125}.

We can work our way up, and find that y1(mod5)y\equiv 1\pmod 5, y21(mod25)y\equiv 21\pmod{25}, and finally y96(mod125)y\equiv 96\pmod{125}. This gives us our smallest value, y=96y = 96, so x=192x = \boxed{192}, as desired. - Spacesam

Solution 4 (Bash)

Let this integer be x.x. Note that

x3888(mod1000)    x0(mod2)    x2(mod5).x^3 \equiv 888 \pmod{1000} \implies x \equiv 0 \pmod {2}~~ \cap ~~ x \equiv 2 \pmod{5}. We wish to find the residue of xx mod 125.125. Note that

x2,7,12,17, or 22(mod25)x \equiv 2,7,12,17, \text{ or } 22 \pmod{25} using our congruence in mod 5.5. The residue that works must also satisfy x313(mod25)x^3 \equiv 13 \pmod{25} from our original congruence. Noting that 173(8)351213(mod25)17^3 \equiv (-8)^3 \equiv -512 \equiv 13 \pmod{25} (and bashing out the other residues perhaps but they're not that hard), we find that

x17(mod25).x \equiv 17 \pmod{25}. Observe that

173491338(mod125).17^3 \equiv \mathbf{4913} \equiv 38 \pmod{125}. Also,

42342242176442144288(mod125).42^3 \equiv 42^2 \cdot 42 \equiv 1764 \cdot 42 \equiv 14 \cdot 42 \equiv 88 \pmod{125}. Finally,

67367267448967(11)6773713(mod125),67^3 \equiv 67^2 \cdot 67 \equiv 4489 \cdot 67 \equiv (-11) \cdot 67 \equiv -737 \equiv 13 \pmod{125}, as desired. Thus, xx must satisfy

x0(mod2)    x67(mod125)    x192(mod250)    x=192.x \equiv 0 \pmod{2}~~ \cap ~~x \equiv 67 \pmod{125} \implies x \equiv 192 \pmod{250} \implies x=\boxed{192}. ~samrocksnature

Solution 5

This number is in the form of 10k+210k+2, after binomial expansion, we only want 600k2+120k880(mod1000)600k^2+120k\equiv 880 \pmod{1000}. We realize that 600,120600,120 are both multiples of 88, we only need that 600k2+120k5(mod125)600k^2+120k \equiv 5\pmod{125}, so we write 600k2+120k=125x+5;120k2+24k=25x+1,24(5k2+k)=25x+1,5k2+k1(mod25)600k^2+120k=125x+5; 120k^2+24k=25x+1, 24(5k^2+k)=25x+1, 5k^2+k\equiv -1\pmod{25}

Then, we write 5k2+k=25m1,5k2+k+1=25m5k^2+k=25m-1, 5k^2+k+1=25m so k+1k+1 must be a multiple of 55 at least, so k1,6,11,16,21(mod25)k\equiv {-1, -6, -11, -16, -21} \pmod {25} after checking, when k=6,5k2+k+1=175=257k=-6, 5k^2+k+1=175=25\cdot 7. So k6(mod25)k\equiv -6 \pmod{25}, smallest k=19k=19, the number is 192\boxed{192}

~bluesoul

Solution 6 (A bit of brute force using basic knowledge.)

We do know the unit digit has to be 2, So lets consider the number of the form of x2x2.

On cubing x2x2, we get a number of the form x36x212x8x^3 \,6x^2 \,12x \,8 where the unit digit of 12x12x must be 8, therefore x can be 4 or 9. But for this value of xx the hundreds digit won't be 8.

Thus our number must be of the form x42x42 / x92x92. Repeating the above process we get values of xx as 4 and 1 respectively.

Therefore the smallest number is 192.~ Dubey619