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; using the binomial theorem gives us 1000k3+600k2+120k+8. Since we are looking for the tens digit, mod100 we get 20k+8≡88(mod100). This is true if the tens digit is either 4 or 9. Casework:
- 4: Then our cube must be in the form of (100k+42)3≡3(100k)(42)2+423≡200k+88(mod1000). Hence the lowest possible value for the hundreds digit is 4, and so 442 is a valid solution.
- 9: Then our cube is (100k+92)3≡3(100k)(92)2+923≡200k+688(mod1000). The lowest possible value for the hundreds digit is 1, and we get 192. Hence, since 192<442, the answer is 192
Solution 2
n3≡888(mod1000)⟹n3≡0(mod8) and n3≡13(mod125). n≡2(mod5) due to the last digit of n3. Let n=5a+2. By expanding, 125a3+150a2+60a+8≡13(mod125)⟹5a2+12a≡1(mod25).
By looking at the last digit again, we see a≡3(mod5), so we let a=5a1+3 where a1∈Z+. Plugging this in to 5a2+12a≡1(mod25) gives 10a1+6≡1(mod25). Obviously, a1≡2(mod5), so we let a1=5a2+2 where a2 can be any non-negative integer.
Therefore, n=2+5(3+5(2+5a2))=125a2+67. n3 must also be a multiple of 8, so n must be even. 125a2+67≡0(mod2)⟹a2≡1(mod2). Therefore, a2=2a3+1, where a3 is any non-negative integer. The number n has form 125(2a3+1)+67=250a3+192. So the minimum n=192.
BTW, explanation is pretty bad
Solution 3
Let x3=1000a+888. We factor an 8 out of the right hand side, and we note that x must be of the form x=2y, where y is a positive integer. Then, this becomes y3=125a+111. Taking mod 5, 25, and 125, we get y3≡1(mod5), y3≡11(mod25), and y3≡111(mod125).
We can work our way up, and find that y≡1(mod5), y≡21(mod25), and finally y≡96(mod125). This gives us our smallest value, y=96, so x=192, as desired. - Spacesam
Solution 4 (Bash)
Let this integer be x. Note that
x3≡888(mod1000)⟹x≡0(mod2) ∩ x≡2(mod5).
We wish to find the residue of x mod 125. Note that
x≡2,7,12,17, or 22(mod25)
using our congruence in mod 5. The residue that works must also satisfy x3≡13(mod25) from our original congruence. Noting that 173≡(−8)3≡−512≡13(mod25) (and bashing out the other residues perhaps but they're not that hard), we find that
x≡17(mod25).
Observe that
173≡4913≡38(mod125).
Also,
423≡422⋅42≡1764⋅42≡14⋅42≡88(mod125).
Finally,
673≡672⋅67≡4489⋅67≡(−11)⋅67≡−737≡13(mod125),
as desired. Thus, x must satisfy
x≡0(mod2) ∩ x≡67(mod125)⟹x≡192(mod250)⟹x=192.
~samrocksnature
Solution 5
This number is in the form of 10k+2, after binomial expansion, we only want 600k2+120k≡880(mod1000). We realize that 600,120 are both multiples of 8, we only need that 600k2+120k≡5(mod125), so we write 600k2+120k=125x+5;120k2+24k=25x+1,24(5k2+k)=25x+1,5k2+k≡−1(mod25)
Then, we write 5k2+k=25m−1,5k2+k+1=25m so k+1 must be a multiple of 5 at least, so k≡−1,−6,−11,−16,−21(mod25) after checking, when k=−6,5k2+k+1=175=25⋅7. So k≡−6(mod25), smallest k=19, the number is 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 x2.
On cubing x2, we get a number of the form x36x212x8 where the unit digit of 12x must be 8, therefore x can be 4 or 9. But for this value of x the hundreds digit won't be 8.
Thus our number must be of the form x42 / x92. Repeating the above process we get values of x as 4 and 1 respectively.
Therefore the smallest number is 192.~ Dubey619