A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 5 years ago

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.

  • This Question is Closed
  1. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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

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

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.