Number of 9s = 2 0 0 0 9 9 9 … 9 9 9 3 Find the sum of the digits of the number above.
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.
@Fidel Simanjuntak nice observation there! :) To complete the solution you need to prove that such pattern works for all positive integers n (perhaps by induction).
Log in to reply
@Jaydee Lucero I'm still trying to prove it. Otherwise, I'm still waiting someone to give a proof.
Log in to reply
@Fidel Simanjuntak I've seen your proof now. Nice solution :)
Log in to reply
@Jaydee Lucero – Thank you! Glad to hear that!
Similar solution with Áron Bán-Szabó 's
N = Number of 9s = 2 0 0 0 9 9 9 . . . 9 9 9 3 = ( 1 0 2 0 0 0 − 1 ) 3 = 1 0 6 0 0 0 − 3 ⋅ 1 0 4 0 0 0 + 3 ⋅ 1 0 2 0 0 0 − 1 = 1 9 9 9 9 9 9 . . . 9 9 9 7 4 0 0 0 0 0 0 . . . 0 0 0 + 2 2 0 0 0 9 9 9 . . . 9 9 9 = 1 9 9 9 9 9 9 . . . 9 9 9 7 1 9 9 9 0 0 0 . . . 0 0 0 2 2 0 0 0 9 9 9 . . . 9 9 9
Therefore, the sum of digits of N , S n = 9 ⋅ 2 9 9 9 + 7 + 2 = 3 6 0 0 0 .
@Chew-Seong Cheong I did the same. :)
2 0 0 0 number of 9 9 9 9 … 9 9 = 1 0 2 0 0 0 − 1 ⇒ ( 1 0 2 0 0 0 − 1 ) 3 = 1 0 6 0 0 0 − 3 ∗ 1 0 4 0 0 0 + 3 ∗ 1 0 2 0 0 0 − 1 The ( 3 ∗ 1 0 2 0 0 0 − 1 ) number's first digit is 2 , the others are 9 . From the back the first 4 0 0 0 digit are 0 in ( 1 0 6 0 0 0 − 3 ∗ 1 0 4 0 0 0 ) , then the 4 0 0 1 . digit from the bag is 7 , then from the 4 0 0 2 . digit to the 6 0 0 0 . digit all of the digits are 9 s. So the answer is: 2 0 0 0 ∗ 9 + 2 + 7 + 1 9 9 9 ∗ 9 = 3 6 0 0 0
Problem Loading...
Note Loading...
Set Loading...
I observed a pattern. Let S ( n ) denotes the sum of the digit of n .
S ( 9 3 ) = S ( 7 2 9 ) S ( 9 9 3 ) = S ( 9 7 0 , 2 9 9 ) S ( 9 9 9 3 ) = S ( 9 9 7 , 0 0 2 , 9 9 9 ) = 1 8 = 3 6 = 5 4
We can conclude that S ⎝ ⎛ number of 9s = n 9 9 9 . . . 9 9 9 3 ⎠ ⎞ = 1 8 n .
For n = 2 0 0 0 , the answer is 1 8 × 2 0 0 0 = 3 6 0 0 0 .
Proof
This is the generalozation of Chew-Seong Cheong's and Áron Bán-Szabó's solution.
Consider the expression below.
number of 9s = n 9 9 . . . 9 9 3 = ( 1 0 n − 1 ) 3 = 1 0 3 n − 3 ⋅ 1 0 2 n + 3 ⋅ 1 0 n − 1 = number of 0s = 3 n 1 0 0 . . 0 0 − number of 0s = 2 n 3 0 0 . . . 0 0 + number of 0s = n 3 0 0 . . . 0 0 − 1 = n − 1 times 9 9 . . . 9 9 7 2 n times 0 0 . . . 0 0 + 2 n times 9 9 . . . 9 9
Then,
S ⎝ ⎛ number of 9s = n 9 9 . . . 9 9 3 ⎠ ⎞ = 9 ( n − 1 ) + 7 + 2 + 9 n = 9 ( n − 1 ) + 9 + 9 n = 9 ( n − 1 + 1 + n ) = 9 ( 2 n ) = 1 8 n
Hence, proved.