Question

In: Statistics and Probability

Problem 33.2ish. How many strings of fourteen lowercase English letters are there which (a) start with...

Problem 33.2ish. How many strings of fourteen lowercase English letters are there which

(a) start with the letter x, if letters may be repeated?

(b) contain the letter x at least once, if letters can be repeated?

(c) contain each of the letters x and y at least once, if letters can be repeated?

(d) which contain at least one vowel, where letters may not be repeated?

Solutions

Expert Solution

Number of options for a letter, if there is no condition = 26

a) Number of strings that start with x, if letters may be repeated = 1 x 2613

= 2.481x1018

b) Number of strings that contain letter x at least once, if letters may be repeated = Total number of strings possible - Number of strings that does not contain the letter x

= 2614 - 2514

= 2.726x1019

c) Number of strings that contain letter x and y at least once, if letters may be repeated  = Total number of strings possible - Number of strings that does not contain the letter x - Number of strings that does not contain the letter y + Number of strings that does not contain the letters x and y

= 2614 - 2514 - 2514 + 2414

= 1.104x1019

d) Number of vowels = 5

Number of consonants = 21

If letters cannot be repeated, use permutation.

Permutation formula: nPr = n!/(n-r)!

Number of strings with at least one vowel = Number of strings possible - Number of strings in which there are no vowels

= 26P14 - 21P14

= 8.318x1017


Related Solutions

A seqstring is a sequence of 18 letters(one of the 26 lowercase letters a-z). How many...
A seqstring is a sequence of 18 letters(one of the 26 lowercase letters a-z). How many seq strings are there where the number of letters between any two occurences of the same letter is at least 2?
How many permutations of the letters ABCDEFGHIJKLM do not contain the strings “BAD” or “DIG” or...
How many permutations of the letters ABCDEFGHIJKLM do not contain the strings “BAD” or “DIG” or “CLAM” consecutively? (Hint: Inclusion-exclusion and subtraction). **I KNOW THE ANSWER IS NOT 13! - 11! - 11! - 10! ** - please do not give that as one.
How many 7-bit strings are there which... (a) Start with the sub string 10? Explain. (b)...
How many 7-bit strings are there which... (a) Start with the sub string 10? Explain. (b) Have exactly 4 ones? Explain. (c) Either start with 10 or end with 11 (or both)? Explain.
How many bit strings of length 8 if i. bit strings start with the bit 1;...
How many bit strings of length 8 if i. bit strings start with the bit 1; ii. bit strings end with the two bits 00; iii. bit strings either start with the bit 1 or end with the bits 00.؟
3. How many strings can be made using 9 or more letters of MISSISSIPPI?
3. How many strings can be made using 9 or more letters of MISSISSIPPI?
Consider the letters ABCDE. a. How many strings of length 3 can be formed if we...
Consider the letters ABCDE. a. How many strings of length 3 can be formed if we allow repetitions (if we allow a letter to be used more than once)? b. How many strings of length 3 can be formed if we do not allow repetitions (if we allow each letter to be used at most once)? c. How many strings of length 3 can be formed if the first letter is A and we allow repetitions? d. How many strings...
1. How many 12-bit strings (that is, bit strings of length 14) start with the sub-string...
1. How many 12-bit strings (that is, bit strings of length 14) start with the sub-string 011? 2. You break your piggy bank to discover lots of pennies and nickels. You start arranging them in rows of 6 coins. How many coins would you need to make all possible rows of 6 coins (not necessarily with equal numbers of pennies and nickels)? 3. How many shortest lattice paths start at (4, 4) and end at (13, 13)? 4. What is...
[02] For n ≥ 1, how many strings of length n using letters a,b,c are there...
[02] For n ≥ 1, how many strings of length n using letters a,b,c are there if the letter a must occur an even number of times?
How many bit-strings are there of length 128 that either start with 1111 or end with...
How many bit-strings are there of length 128 that either start with 1111 or end with 0000 but not both?
Consider arrangements of the letters NEWBIT. How many arrangements start or end with a vowel?
Consider arrangements of the letters NEWBIT. How many arrangements start or end with a vowel?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT