Finding number of Strings when content prefix is fixed [closed]
-2
$begingroup$
Let $n geq m geq k$ be three non-negative integers. What is the number of binary strings of length n over the alphabet $A= { 0,1}$ whose prefix of size $m$ contains exactly $k$ numbers equal to $0$ ?
discrete-mathematics permutations
share | cite | improve this question
edited Jan 9 at 6:45
El Pasta
446 15
asked Jan 9 at 6:37
gucci gucci
1 1
$endgroup$
...
