Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • 1
    $\begingroup$ The number of fixed digits, m, in a non-overlapping pattern of length, n, reduces the available combinations by an amount 2^(n-m). Finding the set of non-overlapping patterns, e.g. x1xxx0xx and x1xxx0x0 overlap, should compute the remaining available patterns. $\endgroup$ Commented Nov 13, 2012 at 12:26