Question

How many {0,1} strings are there with exactly n zeros and m ones.

Answer 1

i am going to make a guess that it is \[\binom{n+m}{n}=\binom{n+m}{m}\]

Answer 2

you have \(m+n\) spaces all together, so i am interpreting the question as "how many ways are there to choose \(m\) of them to put the ones?, or "how many ways are there to choose \(n\) of them to put the zeros ?"

Answer 3

Thank you, this makes sense to me now :)