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,

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.
RELATED QUESTIONS
1.How many bit strings of length 6 have: (a) Exactly three 0s? (b) The same number... (answered by stanbon)

Please verify: Given two binary values (0,1), how many permutations can there be for... (answered by stanbon)

A binary number consists only 0s and 1s. A) How may different seven-digit binary numbers (answered by Edwin McCravy)

A binary string is an ordered sequences of 0's and 1's (for example, 0100101). Determine... (answered by Theo,greenestamps)

A cat walks in a straight line, which we shall call the x-axis, with the positive... (answered by textot)

A product code is a string of 2 characters and 2 digits or 1 character and 3 digits. What (answered by Fombitz)

Can someone answer this question for me step by step or in a broken down manner... (answered by richard1234)

How many permutations of the leters ABCDEFG contain (a)the string BCD (b)the string... (answered by stanbon)

Arrange the letter O,R,A,N,G, and E in a row.Find the number of... (answered by ikleyn)