SOLUTION: For a string of n digits in a binary system (1s and 0s), what is the equation determining the number of permutations of the string for every n?
For example, in a 3-digit string,
Algebra ->
Permutations
-> SOLUTION: For a string of n digits in a binary system (1s and 0s), what is the equation determining the number of permutations of the string for every n?
For example, in a 3-digit string,
Log On
Question 875079: For a string of n digits in a binary system (1s and 0s), what is the equation determining the number of permutations of the string for every n?
For example, in a 3-digit string, there are 8 permutations possible:
000
001
010
011
100
101
110
111
How can I determine the number of permutations for longer strings? I'm hoping to have an equation good for all n. Answer by jim_thompson5910(35256) (Show Source):
You can put this solution on YOUR website! If you have n digits of either 1s or 0s, then you have different strings (in your example, n = 3, ). This is if repeats are allowed.
(