Can you explain why this works?
hey im having trouble getting started on this question:
how many strings of at least one and at most three characters from the alphabet have their characters in alphabetical order? repeated characters are allowed and strings such as aab are in alphabetical order.
i figured with only one character strings, the number of alphabetically-ordered strings is 26, because each string will only have 1 letter, thus n alphabetical order.
im getting stuck with 2 and 3 characters in the string. i considered starting with each letter in the string, but that was going to take too long. i know it has something to do with commutations/pemutations...
with 2 character strings, i guess u could do sum of (26-r) from r=0 to 25...cause for the first letter r=0 (ie. a) there are 26 ways, r=1 (b), there are 25 ways etc...but this doesnt have anything to do with commutations/permutations??
well that formula looks like the one for unordered repetitions. but where does the sum of come from? and why k from 1 to 3? is that because u have at least 1 and at most 3 strings of characters? how did u separate the alphabetically arranged from the non-alphabetically arranged? im so confused...
I had to make lists ... and look for patterns.
One-letter stringsHow many strings of at least one and at most three characters
from the alphabet have their characters in alphabetical order?
Repeated characters are allowed and strings such as are in alphabetical order.
You are right . . . there are possible one-letter strings.
Two-letter strings: .
. . . . . . . . . . . . . .
Reading from the right, we have:
. . 3-letter strings
Let me give you another problem to demonstrate the concept.
How many way can we select five letters from the alphabet allowing repetitions: . Correct?
If you are given any collection for five letters, say any five Scrabble pieces, you can always arrange those pieces in alphabetical order. Can you not?
Therefore, we have just counted the number of five letters strings appearing in alphabetical order.
Now the sum is for one, two, or three strings.
ok. im pretty sure the question is ordered ie. the first letter has to stay the first letter. so i made the lists, saw the patterns and worked out how many strings would be possible. BUT the next question is how many strings of at least one and at most n characters from the alphabet have the characters in alphabetical order? you used T1, T2,...,T26 in your answer what is the definition of Tn? Thanks for all your help!
But the point here is that we count the number of unordered selections each of which we can then in turn order.
The selection <B,A,L,L,O,O,N> can be ordered into ABLLNOO.
That selection is one of possible selections of seven choices of letters allowing repeats.
But that is also the number of seven letter ‘words’ having their letters is alphabetical order.
Thus the answer to the second part, “n characters from the alphabet have the characters in alphabetical order”, is .
Now you add .