Bits, bytes

Calculate how many different numbers can be encoded in 16-bit binary word?

Result

n =  65536

Solution:

Leave us a comment of example and its solution (i.e. if it is still somewhat unclear...):

Be the first to comment!

To solve this example are needed these knowledge from mathematics:

See also our variations calculator. Would you like to compute count of combinations?

Next similar examples:

1. Morse alphabet
Calculate how many words of Morse code to create compiling commas and dots in the words of one to four characters.
2. Lock
Combination lock will open when the right choice of 5 numbers (from 1 to 12 inclusive) is selected. A. How many different lock combinations are possible? B. Is he combination lock named appropriately?
3. Cars plates
How many different licence plates can country have, given that they use 3 letters followed by 3 digits?
4. PIN - codes
How many five-digit PIN - code can we create using the even numbers?
5. Area codes
How many 6 digit area codes are possible if the first number can't be zero?
6. Metals
In the Hockey World Cup play eight teams, determine how many ways can they win gold, silver and bronze medals.
7. Football league
In the 5th football league is 10 teams. How many ways can be filled first, second and third place?
8. Olympics metals
In how many ways can be win six athletes medal positions in the Olympics? Metal color matters.
9. Medals
In how many ways can be divided gold, silver and bronze medal among 21 contestant?
10. Friends in cinema
5 friends went to the cinema. How many possible ways can sit in a row, if one of them wants to sit in the middle and the remaining's place does not matter?
11. Guests
How many ways can 5 guests sit down on 6 seats standing in a row?
12. Practice
How many ways can you place 20 pupils in a row when starting on practice?
13. Variations
Determine the number of items when the count of variations of fourth class without repeating is 42 times larger than the count of variations of third class without repetition.
14. Theorem prove
We want to prove the sentense: If the natural number n is divisible by six, then n is divisible by three. From what assumption we started?