Let S ( N ) denote the digit sum of integer N . Let M denote the maximum value of S ( N ) N , where N is a 3-digit number. How many 3-digit numbers N satisfy S ( N ) N = M ?
Details and assumptions
The digit sum of an integer is the sum of all its digits. For example, the digit sum of N = 1 1 2 3 is 1 + 1 + 2 + 3 = 7 .
The number 1 2 = 0 1 2 is a 2-digit number, not a 3-digit number.
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.
Let N = 1 0 0 a + 1 0 b + c , where ( 1 ≤ a ≤ 9 ) , ( 0 ≤ b , c ≤ 9 ) .
So S ( N ) = a + b + c
If S ( N ) N > 1 0 0 , then
a + b + c 1 0 0 a + 1 0 b + c > 1 0 0
1 0 0 a + 1 0 b + c > 1 0 0 ( a + b + c )
1 0 0 a + 1 0 b + c > 1 0 0 a + 1 0 0 b + 1 0 0 c
0 > 9 0 b + 9 9 c
0 > 1 0 b + 1 1 c
This is impossible since b and c are non-negative.
If S ( N ) N = 1 0 0 , then it simplifies to
0 = 1 0 b + 1 1 c
This is possible. Hence, M = the maximum of S ( N ) N = 1 0 0 , and this occurs if b = c = 0 .
a is any number from 1 to 9 . So N can be 1 0 0 , 2 0 0 , . . . , 9 0 0 .
This gives us 9 three-digit numbers which satisfy the required condition.
let D(N)=N/S(N),N=abc,so D(N)=(100a+10b+c)/(a+b+c)=100-(90b+99c)/(a+b+c),let b=c=0,we get the max. 100, this can be get when N is multi. of 100
Let N = a b c = 1 0 0 a + 1 0 b + c , where 1 ≤ a ≤ 9 , 0 ≤ b ≤ 9 and 0 ≤ c ≤ 9 .
We have a + b + c a b c = a + b + c 1 0 0 a + 1 0 b + c = a + b + c 9 9 a + 9 b + 1 . Thus, the maximum occurs when c = 0 .
Then a + b 9 9 a + 9 b + 1 = a + b 9 0 a + 9 + 1 . Thus, the maximum occurs when b = 0 .
Then a 9 0 a + 9 + 1 = 1 0 0 would be the value of M . There are 9 possible values of a , thus there are 9 3-digit numbers that satisfy M = 1 0 0 = S ( N ) N .
Problem Loading...
Note Loading...
Set Loading...
Let the number be N = a b c . Then the value we want to maximize is a + b + c 1 0 0 a + 1 0 b + c = 1 + a + b + c 9 9 a + 9 b . This is maximized when c = 0 . Then we repeat again, to get 1 0 + a + b 9 0 a , which is maximized when b = 0 . Then M = 1 0 0 , which holds for N = 1 0 0 , 2 0 0 , … , 9 0 0 . So there are 9 such numbers.