in reply to (OT) A different kind of 'combinatorics'

If each set of four were to be repeated, it'd be impossible, because after 0000 or 1111 the next digit must be either 0 or 1, which will be a repeat of 0000, 1111, 0001 or 1110. So, the question would only be valid for a condensed string that happens to includes all combinations but not more than once. (This is probably what you are asking, but i did not see it so clearly at first.)

  • Comment on Re: (OT) A different kind of 'combinatorics'

Replies are listed 'Best First'.
Re^2: (OT) A different kind of 'combinatorics'
by BrowserUk (Patriarch) on Mar 26, 2015 at 15:40 UTC
    If each set of four were to be repeated, it'd be impossible ... This is probably what you are asking, but i did not see it so clearly at first.

    Indeed, though it wasn't obvious to me at first either.

    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority". I'm with torvalds on this
    In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked
[reply]

In Section Seekers of Perl Wisdom