Let be a positive integer such that Find the smallest possible value of .
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.
Relevant wiki: Application of Divisibility Rules
Due to the given condition, R . H . S should be divisible by 9 9 . Hence, 9 | 111 … 1 Also, 11 | 111 … 1 Therefore, the number of 1's must be divisible by 9. Such smallest possible value is Nine 1’s 1 1 1 … 1 , but we note that this number is not divisible by 11 , because the number of digits are odd , for it to be perfectly divisible by 11 , the number of digits should by even.
Hence, the number should have 18 1's and hence Y = 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 9 .
Note that the reasoning for divisibility of 11 holds here for this special case only.