How many 4-digit combinations can you get when only using 1 and 0? And what are they? Thanks?

Question

PS, it's not homework, but I need to find it our for game strategy.

Should really have said permuatations. :s
But thanks for the answers!!

Answer 1

There are 16 numbers. That's 2^4 because order of the digits DOES matter. In ascending order, they are:

0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111

Answer 2

Combinations Of 4

Answer 3

16. 0000 to 1111. That is basic digital counting. The numbers pictured are 0 to 15. 1111 = 2^3 + 2^2 + 2^1 + 2^0 = 8 + 4+ 2 + 1= 15

Answer 4

There are 16 all in all and these are:

1. 0000, 2. 0001, 3. 0010, 4. 0011, 5. 0100, 6. 0101, 7. 0110, 8. 0111, 9. 1000, 10. 1001, 11. 1010, 12. 1011, 13. 1100, 14. 1101, 15. 1110 and 16. 1111

Answer 5

since we can only used 1 and 0 to form a 4-digit numbers, 1 and 0 must be repeated

so 2*2*2*2 = 16 combinations <== answer

Answer 6

nothing is said about having zero in the first place and repetition of digits so number of 4-digit combinations using two digits 0 and 1 is 5 and count them from total 16 permutations
[0000],
[0001, 0010, 0100, 1000],
[0011, 0110, 1100, 0101, 1010, 1001],
[0111, 1110, 1011, 1101],
[1111].
Answer is 5 combinations and 16 permutaions.

Answer 7

Hey its a trick question ....sort of. It is demonstrating how to read binary. In binary the first 16 numbers can be demonstrated using a 4 digit numbers of only 1's and 0's. Do a google search on binarty.

Answer 8

grand_funkopotamus is got them all !

But
----------
AND
1 - 0 = 1
0 - 1 = 0
1 - 0 = 0
1 - 1 = 0
----------
NAND
1 - 0 = 1
0 - 1 = 1
1 - 0 = 1
1 - 1 = 0
----------
OR
1 - 0 = 0
0 - 1 = 1
1 - 0 = 1
1 - 1 = 1
----------
NOR
1 - 0 = 1
0 - 1 = 0
1 - 0 = 0
1 - 1 = 0
----------
EX OR
1 - 0 = 0
0 - 1 = 1
1 - 0 = 1
1 - 1 = 0
-----------
EX NOR
1 - 0 = 1
0 - 1 = 0
1 - 0 = 0
1 - 1 = 1
--------------

Answer 9

Do your own homework.