Calculating Binary

Oh man! Ad-blocking software has been detected! :'(

This website is run by the community, for the community... and it needs advertisements in order to keep running. Blocking our ads means your killing our stats!
Please disable your ad-block, or become a premium member to hide all advertisements and this notice.

This doesn't fit neatly into the programming section, since the technique applies to multiple sections, but since I'm looking at it from a programming perspective, I'll stick it here.

Does anyone have a quick technique for calculating the maximum possible value given a binary length (such as 2^32 for instance)? I could just try to memorise the maximum values, but I think it would be better for me to have a technique for calculating it.

It doesnt have to be spot on I suppose, just a rough indicator.

 

Oh man! Ad-blocking software has been detected! :'(

This website is run by the community, for the community... and it needs advertisements in order to keep running. Blocking our ads means your killing our stats!
Please disable your ad-block, or become a premium member to hide all advertisements and this notice.

You said what it is, its 0 to 2powN where N is number of bits for unsigned.

If its a signed twos complement number its -2pow(N-1) to 2pow(N-1)-1.

Floating point is more complicated and is expressed as a mantissa and exponent, look into the IEEE specs for double and single precision floating point for details.

 

Yes, there is a quick way. If you wish to find the power of 2 for a particular number n you do:

log(n) / log(2)

(base 10 logarithm) and to reverse the process you do as dmarsh said.

Hi and long time no read!