Thanks Brent, Could you supply some illustrative examples? marty a.

----- Original Message ----- From: "Brent Meeker" <meeke...@dslextreme.com> To: <everything-list@googlegroups.com> 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@googlegroups.com To unsubscribe from this group, send email to everything-list+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/everything-list?hl=en -~----------~----~----~----~------~----~------~--~---