Answer is, I think, 6 factorial, usually written 6!, which means 6x5x4x3x2x1, which is 120. This is the total number of different combinations of 6 digits. This answer is true if all six digits are always used. If it is allowed to use not all 6 digits, then the answer would be 6!+5!+4!+3!+2!+1!
This is 620+120+24+6+2+1, or 773.
Am I right? I left school 37 years ago, did maths A level in the UK but most of it is now forgotten!
There are 16 decimal numbers that can be represented by 4-bits.
10 bits would be required. 10 bits long (10 digits long) can represent up to 1024.
16 of them.
8 bits = 64 character
1000
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.
It depends which dictionary, doesn't it? Shakespeare was responsible for inventing many words which were not previously recorded, and for using many words in ways not previously recorded. Estimates of the numbers vary.
256 (0 through 255)
If you are using the ASCII system, the word "duck", as it has four letters, contains 4 bytes, or 32 bits.
Generally, 8 bits at a time. Some instructions deal with 16 bit numbers.
Each bit can be on or off giving 2 possible states, and for each bit the other bits can be in either state; so there are 2 x 2 x 2 x 2 x 2 x 2 = 26 = 64 possible numbers (which can either represent 0 to 63 or -32 to +31 using signed numbers).
256 in total - including zero.