For any integer , prove that there is exactly one power of 2 having exactly n digits with leading digit 1
First, show existence. If the statement were false, then there would exist such that and But the former gives which is a contradiction of the latter.
Hence for each there must be such that i.e.
To prove uniqueness, observe that (from and (from The result follows since if then either or and so cannot be between and