To find out how many different values can represented by a certain number of bits, we can use the following formula 2n-1 and that is because the first number is always a zero.
Based on that 6 bits = 26- 1= 64-1=63
7 bits= 27-1= 127
8 bits= 28-1=255
10 bits= 210-1=1023
# of bits
1=1
2=3
3=7
4=15
5=31
6=63
7=127
8=255
9=511
10=1023
2^12=4096
1000
24, or 16 (0 through 15) One binary digit (bit) can have 21 values (0 or 1). Two bits can have 22 values. Three bits can have 23 values. A five-bit number can have 25 values... and so on...
Using 5 bits, a total of (2^5) different numbers can be represented. This equals 32, allowing for values ranging from 0 to 31 in unsigned binary representation. If signed representation is used (e.g., two's complement), the range would be from -16 to 15, still totaling 32 distinct values.
65,536
2
There are 256 possible values (or characters) in 8 bits.
n2 -1
24 = 16
Binary bits are necessary to represent 748 different numbers in the sense that binary bits are represented in digital wave form. Binary bits also have an exponent of one.
64 or 123
256 (162)