Find the sum of all integers that are equal to 4 4 times their digit sum.
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.
shouldn't you have specified positive integers?
If n is a positive integer such that n = 4 4 D S ( n ) , where D S ( n ) is the sum of the digits of n , then certainly n is a multiple of 4 4 . If n has X digits then 1 0 X − 1 ≤ n = 4 4 D S ( n ) ≤ 4 4 × 9 X = 3 9 6 X so that 1 0 X ≤ 3 9 6 0 X which implies that X ≤ 4 . There are no 1 -digit numbers with this property. Since 4 4 and 8 8 are the only 2 -digit multiples of 4 4 , there are no 2 -digit numbers with this property.
Now consider a 3 -digit number n = a b c . Then 1 0 0 a + 1 0 b + c = 4 4 ( a + b + c ) , so that 5 6 a = 3 4 b + 4 3 c . This means that c = 2 γ is even, and that 2 8 a = 1 7 b + 4 3 γ . Since n is a multiple of 1 1 , a − b + c ≡ 0 ( m o d 1 1 ) , and so b = a + c − 1 1 e where e = 0 or 1 . Thus 2 8 a = 1 7 a + 1 7 c − 1 8 7 e + 4 3 γ = 1 7 a + 7 7 γ − 1 8 7 e , so that a = 7 γ − 1 7 e . Since 7 γ = a + 1 7 e ≤ a + 1 7 ≤ 2 6 we deduce that γ ≤ 3 . There are four possibilities:
The only 3 -digit number with the desired property is 7 9 2 = 4 4 ( 7 + 9 + 2 ) .
Now consider a 4 -digit number n = a b c d . Then n = 1 0 0 0 a + 1 0 0 b + 1 0 c + d = 4 4 ( a + b + c + d ) , so that 9 5 6 a + 5 6 b = 3 4 c + 4 3 d In addition a − b + c − d ≡ 0 ( m o d 1 1 ) , so that b + d = a + c + 1 1 e where e = − 1 , 0 or 1 . But then n = 4 4 ( a + b + c + d ) = 8 8 ( a + c ) + 4 8 4 e ≤ 8 8 × 1 8 + 4 8 4 = 2 0 6 8 , and hence a ≤ 2 . But then n ≤ 8 8 × 1 1 + 4 8 4 = 1 4 5 2 , so it follows that a = 1 . But this means that 9 5 6 ≤ 9 5 6 a + 5 6 b = 3 4 c + 4 3 d ≤ ( 3 4 + 4 3 ) 9 = 6 9 3 which is impossible. Thus there are no 4 -digit numbers with the required property.
Thus the only positive integer with the desired property, and hence the sum of all integers with that property, is 7 9 2 .
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 |
|
you could have used a loop in the definition of the function
How @Sahil Goyat
Log in to reply
Log in to reply
I am beginner I did not reach that level yet but will soon
@Sahil Goyat when will pokemon unite launched
Problem Loading...
Note Loading...
Set Loading...
First, the digit sum of a k -digit number is at most 9 k , whereas a k -digit number is (by definition) at least 1 0 k − 1 . We therefore need 4 4 ⋅ 9 k = 3 9 6 k ≥ 1 0 k − 1
It's easy to check that this means we are interested in numbers with at most 4 digits.
So, let's put n = 1 0 0 0 a + 1 0 0 b + 1 0 c + d (where a , b , c , d are all in the range 0 to 9 inclusive). The digit sum of n is a + b + c + d ; so 4 4 a + 4 4 b + 4 4 c + 4 4 d 9 5 6 a + 5 6 b = 1 0 0 0 a + 1 0 0 b + 1 0 c + d = 3 4 c + 4 3 d
The right-hand side is at most 3 4 ⋅ 9 + 4 3 ⋅ 9 = 6 9 3 which forces a = 0 and 5 6 b = 3 4 c + 4 3 d
Taking the equation modulo 9 , we find b + c + d ≡ 0 ; so n is a multiple of 9 . Also, n is a multiple of 4 4 ; hence n is a multiple of 3 9 6 and is less than 1 0 0 0 . There are only two options; n = 3 9 6 doesn't work, but n = 7 9 2 does; so n = 7 9 2 is the unique solution.