• anonymous
Problem: Compute the total number Sn of different Morse code messages (message=any string of dots and dashes) that can be sent in n time units? To solve this problem, complete the following steps: 1.Show that S1=1, S2=2, S3=3, S4=5 by just listing all of the possible messages in each case.
  • Stacey Warren - Expert
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
  • katieb
I got my questions answered at in under 10 minutes. Go to now for free help!
  • anonymous
2.Explain why the following recurrence relation holds for Sn: Sn = Sn-1 + Sn-2 for n > 2 3.Find a formula for Sn as a function of n; that is, solve the discrete dynamical system: (I) S1 = 1, S2 = 2 (R) Sn = Sn-1 + Sn-2 for n > 2

Looking for something else?

Not the answer you are looking for? Search for more explanations.