# I'm not sure I understand the problem, can someone clarify?

by mr_coffee
Tags: clarify
 P: 1,629 Hello everyone. I'm not sure where to begin with this problem becuase I don't think I know what they are trying to tell me. Heres what it says: In morse code, Symobls are represented by variable-length sequences of dots and dashes. For example, A = .-, 1 = . - - - -, ? = . . - - . . How many different symobls can be represented by sequences of seven or fewwer dots and dashes? So are they saying, I have a total number of 7 either dots or dashes to work with and how many different permutations can i get with that? or how many different combinations can i get with that? Order shouldn't matter, they didn't say it did, and also repeitions not allowed becuase you don't want 2, A's, ?'s, etc. So that leaves me to think its combinations. Would this be correct? combinations formula is the following: Choosing r items from n possibilities: n!/[r! (n-r)!] so your choose 2 items from 7 possibilities r = 2 n = 7 7!/[2!5!] = 21 different symbols can be represeented by sequences of seven or fewer dots and dashes.
 P: 1,119 You are looking for sequences of Seven or fewer, so you are not done yet. I think you will have to compute 7 cases, but once you see the pattern the number for each case should be easy to find. Also, I would say you are looking at permutations, not combinations, since we can map different symbols to .- and -. If this is the case, what would the number be?
 P: 1,629 hm...if its permutations then it should be pretty straight forward using: P(n,r) = n!/(n-r)! That means order does matter, so n = 7 r = 2 7!/(5)! = 42 different symbols which sounds more correct than 21.
HW Helper
P: 9,395

## I'm not sure I understand the problem, can someone clarify?

42 symbols? That doesn't sound remotely correct. Why are you doing it with permutations or combinations? It is just asking how many strings of length 1,2,3,4,5,6, or 7 can be made up from 2 symbols, be they dots, dashes, or zeroes and ones. You are off by a factor of around 5.5.
 P: 1,629 matt, i'm not sure i understand how your supose to figure this out. All the problems i've been doing invovle permutations or combinations thats why I thought thats how it would be solved. WHen you say strings of length 1, 2, 3, 4, 5, 6, and 7, could i do it directly and say: 1 = . or - 2 = .- or .- 3 = .-. or -.. or ..- or --- or ... 4 = 4! 5 = 5! 6 = 6! 7 = 7! but i'm getting huge numbers, i'm not sure i follow or is it just 2^n? 2^7 = 128
 HW Helper Sci Advisor P: 9,395 You've not counted strings of length 2 correctly.
 P: 1,629 (2^7)+(2^6)+(2^5)+(2^4)+(2^3)+(2^2)+(2^1)= 2^8-2 = 254 hows that look?
 P: 1,119 That looks perfect.
 P: 1,629 Thanks matt!

 Related Discussions High Energy, Nuclear, Particle Physics 9 High Energy, Nuclear, Particle Physics 4 Introductory Physics Homework 2 General Physics 2 Set Theory, Logic, Probability, Statistics 3