Positive integer n is the smallest possible multiple of 1 5 only having 0 , 4 in it's digits when written in base 1 0 . Find 1 1 1 0 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.
Clear solution! +1
Find 1 1 1 0 n is actually a hint.
1 1 1 0 n = k ⟹ n = 1 1 1 0 ∗ k
The smallest integer k = 4 makes n contains 0 and 4 only
The number will have atleast 3 four to be divisible by 3 and must end in 0, 5 to be divisible by 5. Smallest number is 4 4 4 0 satisfting both and hence being divisible by 15
Problem Loading...
Note Loading...
Set Loading...
n is divisible by 1 5 . In other words, n is divisible by 3 and 5 . Let's deal with them separately.
Divisible by 5 : n must end with 0 or 5 . Since the digits must be 0 or 4 , the last digit must be 0 .
Divisible by 3 : The sum of the digits of n must be divisible by 3 . Because extra 0 s don't affect the sum of the digits, and 4 is not divisible by 3 , we need at least three 4 s.
Thus, the smallest value of n is 4 4 4 0 . 1 1 1 0 4 4 4 0 = 4 .