GeekDad Puzzle of the Week – Counting Ones

Reading Time: 1 minute

ones_story

This week’s GeekDad Puzzle of the Week is based around the number “1” (one) and the number of times the number appears in the set of counting numbers. In the set of numbers from 1 to ten, the digit “1” appears twice: once on the “1”, and then again on the “10.” If we keep a running total, we can see that there are 12 “1s” present counting from 1 to 20.

11114
21125
31136
41147
51158
61169
711710
811811
911912
1022012

For the most part, it seems like the running count of observed 1s is far lower than the number up to which we have counted at that point; at 100, we have only seen 21 ones, and at 1000 only 301.

Is this true for all counting numbers under 10 million? That is, are there runs of observable counts that equal or exceed the number up to which we have counted at that point? If so, what are they? If not, why is it not possible?

As always, please submit your responses to GeekDad Central. If your response if correct (or reasonably well reasoned) it will be entered into a random drawing of all such responses. This week’s prize is a $50 Gift Certificate from the fine folks at ThinkGeek.

Happy puzzling!

Get the Official GeekDad Books!