Originally Posted by
sirellwood Hi all, any ideas with the following?
Let n be a positive integer:
Show that when n is written in binary notation, then the number k of its digits
satises
k - 1 <= ln(n)/ln(2) < k
where ln is the natural logarithm.
Thanks!