MathB.in
New
Demo
Tutorial
About
Suppose $x$ is a binary string of length $n - k$, where $n, k$ are integers and $n > k$. An 'extension' of $x$ is a string of length $n$ which is formed from $x$ by inserting exactly $k$ total new 0s and 1s at any position in the string $x$. How many distinct such 'extensions' are there from $x$? Does it depend on more than the length of the string $x$ (i.e., the value of $k$)? Based on numerical evidence the answer is 'it does not depend on the actual string x'.And the number of distinct extensions is $\sum_0^k \binom{n}{i}$
ERROR: JavaScript must be enabled to render input!
Sun, 18 Mar 2018 03:20 GMT