Take all strings of length 2
00 01 10 11
Make two copies of each
00 00 01 01 10 10 11 11
Add a 00 to the first and a 01 to the second
000 001 010 011 100 101 110 111
and you have all strings of length 3.
Brent
m.a. wrote:
> *Thanks Brent,*
> * Could you supply some illustrative examples? *
> *
> marty a.*
> **
>
> ----- Original Message -----
> From: "Brent Meeker" <meekerdb.domain.name.hidden
> <mailto:meekerdb.domain.name.hidden>>
> To: <everything-list.domain.name.hidden
> <mailto:everything-list.domain.name.hidden>>
> Sent: Tuesday, July 21, 2009 3:57 PM
> Subject: Re: The seven step series
>
> >
> > Each binary string of length n has two possible continuations of
> length
> > n+1, one of them by appending a 0 and one of them by appending a 1. So
> > to get all binary strings of length n+1 take each string of length n,
> > make two copies, to one copy append a 0 and to the other copy append
> a 1.
> >
> > Brent
> >
> > m.a. wrote:
> >> Hi Bruno,
> >> I'm not clear on the sentence in bold below,
> >> especially the word "correspondingly". The example of Mister X only
> >> confuses me more. Could you please give some simple examples? Thanks,
> >>
> >>
> >>
> >>
> >> marty a.
> >>
> >>
> >>
> >> >>
> >> >
> >
> >
> >
> >
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list+unsubscribe.domain.name.hidden
For more options, visit this group at
http://groups.google.com/group/everything-list?hl=en
-~----------~----~----~----~------~----~------~--~---
Received on Tue Jul 21 2009 - 14:24:36 PDT