Problem:
Michael writes down all the integers between and inclusive on a piece of paper and discovers that exactly of them have leftmost digit . Given that , find the smallest possible value of .
Problem:
Michael writes down all the integers between and inclusive on a piece of paper and discovers that exactly of them have leftmost digit . Given that , find the smallest possible value of .
Solution:
Let be the number of digits of . Suppose that does not itself have leftmost digit . Then the number of integers which have leftmost digit is
so we must have , or . But the left-hand side is odd, so this is impossible.
Thus must have leftmost digit . In this case, the number of integers which have leftmost digit is
Therefore we need , or . Then, must be divisible by . The base-ten representation of has ones, so must be divisible by . Both and make less than , but gives the answer .