How any number have max. log(N) bits in mathematical approach.
How any number have max. log(N) bits
You write any number in binary form by taking log. ( Think opposite, you take powers with 2…)
So maximum number formed can be something like 2^(logn + k).
Its intuitive. You have to feel it . I feel its hard to give you a mathematical proof for it but learn it i suggest that max bits are log(n)
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.