What is the smallest four digit multiple of 17, the sum of its digit should be 17.
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.
Further b = 3 1 7 ( 3 m − 1 ) − 3 3 a + 2 d < 3 0 , m > 4
For m = 7 , b = 3 3 4 − 3 3 a + 2 d , note that a = 0 , a < 2 ∴ a = 1 . b = 3 1 + 2 d Thus value of d are 4 , 7 and solution for b = 3 , 5 Hence a b c d = 1 3 8 7 , 1 5 4 7
For m = 1 0 , b = 3 5 1 − 3 3 a + 2 d the possible value of a are 1 and 2 . For a = 1 , b = 3 1 8 + 2 d < 3 0 . For d = 0 , b = 6 but c = 1 0 so this is rejected . Now for d = 3 , b = 8 , c = 7 ∴ a b c d = 1 8 7 3 . For a = 2 , b = 3 2 d − 1 5 . Only possible value of d = 9 for which b = 1 , c = 5 . Therefore, a b c d = 2 1 5 9 .
For m = 1 3 , b = 3 6 8 − 3 3 a + 2 d . Only satisfying value of a = 2 which results d = 5 , 8 , b = 4 , 6 , c = 6 , 1 ⟹ a b c d = 2 4 6 5 , 2 6 1 8 .
On the similar manner other such number can also be obtained.
M a t h e m a t i c a
Min@Select[17 Range[Ceiling[1000/17],Floor[9999/17]],Total@IntegerDigits@#==17&]
1 0 8 8
We know that that a number, which is divisible by 9,the seed (sum of the digits till a single digit is obtained) of that number must be 9. This also implies that when a multiple of 9 is added to some other number, the seed of that (some)number will remain unchanged. So, we can write the number as N = 17×9×n +17. The first 17 is to get a multiple of 17, 9 is to make seed = 9, whereas n is to get the smallest possible four digit number. Also, last 17 will play the role of making N's seed = 8, which gives a possibility that N's digit sum will be 8, which may give sum of the digits as 17. Put n = 7 to get the required answer.
Problem Loading...
Note Loading...
Set Loading...
Divisibility rule of 17
Call n = a b c d the smallest four digit number. As per the divisibility test of 1 7 . We have new number m = a b c − 5 d = 1 0 2 a + 1 0 b + c − 5 d . Assume number is divisible by 1 7 . Then we get 1 7 m = 1 0 2 a + 1 0 b + c − 5 d = 9 9 a + 9 b − 6 d + ( a + b + c + d ) 1 7 ( m − 1 ) = 3 ( 3 3 a + 3 b − 2 d ) ⟹ 1 7 ( 3 m − 1 ) = 3 3 a + 3 b − 2 d Clearly, left hand side is m ≡ 1 m o d ( 3 ) which implies m = 3 k + 1 for positive integers k . For the smallest possible value of RHS the value of LHS must be as small as possible which is only If m = 4 . Then 3 3 a + 3 b − 2 d = 1 × 1 7 = 1 7 Notice a = 0 so the smallest possible value of a = 1 then last equation becomes 3 3 + 3 b − 2 d = 1 7 ⟹ 2 d − 3 b = 1 6 ⟹ d = 2 1 6 + 3 b For b = 0 , 2 then d = 8 , 1 1 respectively. Since d ≤ 9 , ∴ d = 8 , b = 0 , a = 1 & c = 1 7 − 9 = 8 which makes 1 0 8 8 as smallest required number.
Here is next problem inspired by this