The last three digits of the cube of a positive integer n are 9 2 9 . What is the minimum value of n ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
You first say n "must end in 9 " and then later say "the units digit of n must be 0 ." I think you mean to say "the units digit of x must be 0 ."
The last three digits of n 3 is 9 2 9 implies that ⎩ ⎪ ⎨ ⎪ ⎧ n 3 ≡ 9 2 9 (mod 1000) n 3 ≡ 2 9 (mod 100) n 3 ≡ 9 (mod 10)
Let n ≡ 1 0 a + b , where a and b are non-negative integers and b ≤ 9 . Then by Chinese remainder theorem :
n 3 1 0 0 0 a 3 + 3 0 0 a 2 b + 3 0 a b 2 + b 3 ⟹ b 3 ≡ 9 (mod 10) ≡ 9 (mod 10) ≡ 9 (mod 10)
For 0 ≤ b ≤ 9 , only 9 3 ≡ 9 (mod 10) . Therefore b = 9 and n = 1 0 a + 9 and
1 0 0 0 a 3 + 2 7 0 0 a 2 + 2 4 3 0 a + 7 2 9 3 0 a + 2 9 3 0 a ⟹ a ⟹ 1 0 0 a ⟹ n ≡ 2 9 (mod 100) ≡ 2 9 (mod 100) ≡ 0 (mod 100) ≡ 0 (mod 100) ≡ 0 (mod 100) ≡ 1 0 0 a + 9
And
n 3 1 0 6 a 3 + 2 7 ⋅ 1 0 4 a 2 + 2 4 3 0 0 a + 7 2 9 3 0 0 a + 7 2 9 3 0 0 a ⟹ a ⟹ n ≡ 9 2 9 (mod 1000) ≡ 9 2 9 (mod 1000) ≡ 9 2 9 (mod 1000) ≡ 2 0 0 (mod 1000) ≡ 4 ≡ 1 0 0 a + 9 ≡ 4 0 9
3 0 a ≡ 0 ( m o d 1 0 0 ) ⟹ a ≡ 0 ( m o d 1 0 0 )
I believe this is a mistake. It only implies that a ≡ 0 ( m o d 1 0 ) , but the result would still remain the same.
Problem Loading...
Note Loading...
Set Loading...
Since the last three digits of n 3 is 9 2 9 , n 3 ≡ 9 2 9 ( m o d 1 0 0 0 ) n 3 ≡ 2 9 ( m o d 1 0 0 ) n 3 ≡ 9 ( m o d 1 0 ) If a cube of number ends with 9 , then the number must also end with 9 . n ≡ 9 ( m o d 1 0 ) ⟹ n 3 = ( 1 0 x + 9 ) 3 = ( 1 0 x ) 3 + 3 ⋅ ( 1 0 x ) 2 ⋅ 9 + 3 ⋅ ( 1 0 x ) ⋅ 9 2 + 9 3 = 1 0 0 0 x 3 + 2 7 0 0 x 2 + 2 4 3 0 x + 7 2 9 Considering the last two digits of n 3 , n 3 ≡ 3 0 x + 2 9 ≡ 2 9 ( m o d 1 0 0 ) ⟹ x ≡ 1 0 ( m o d 1 0 0 ) So the tens digit of n must be 0 . n ≡ 9 ( m o d 1 0 0 ) ⟹ n 3 = ( 1 0 0 y + 0 9 ) 3 = ( 1 0 0 y ) 3 + 3 ⋅ ( 1 0 0 y ) 2 ⋅ 9 + 3 ⋅ ( 1 0 0 y ) ⋅ 9 2 + 9 3 = 1 0 0 0 0 0 0 x 3 + 2 7 0 0 0 0 x 2 + 2 4 3 0 0 x + 7 2 9 Considering the last three digits of n 3 , n 3 ≡ 3 0 0 y + 7 2 9 ≡ 9 2 9 ( m o d 1 0 0 0 ) ⟹ 3 0 0 y ≡ 2 0 0 ( m o d 1 0 0 0 ) ⟹ y ≡ 4 ( m o d 1 0 0 0 ) So the hundreds digits must be 4 . Therefore, the least value of n is 4 0 9 .
Verification: 4 0 9 3 = 6 8 4 1 7 9 2 9