Question

In: Advanced Math

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 of length 3 can be formed if the first letter is A we do not allow repetitions?

Solutions

Expert Solution

here 2 terms are used 'repetition is allowed' and another is 'repetition not allowed'

'repetition allowed' means that if we use any letter than we can use it again to fill next place

similarly for 'repetition not allowed' means if we use any letter we cannot use it again to fill any next place .


Related Solutions

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?
*PERMUTATIONS* How many tablets of 3 letters and 3 numbers can we form with the letters...
*PERMUTATIONS* How many tablets of 3 letters and 3 numbers can we form with the letters {A, B, C, D, E} and the 10 digits if the tablet should have: ◦ Letters and numbers should be kept together without repetition? ◦ Letters and numbers should be kept together with repetition? ◦ Letters and numbers do not have to be kept together without repetition? ◦ Letters and numbers do not have to be kept together with repetition?
[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 distinct arrangements can be formed from all the letters of ʺstudentsʺ?
How many distinct arrangements can be formed from all the letters of ʺstudentsʺ?
a)     How many four-letter words can be formed from the letters of the word LAUNDRY if each...
a)     How many four-letter words can be formed from the letters of the word LAUNDRY if each letter can only be used one time in a word? Y is NOT considered a vowel in this word. b)    How many contain the letter Y? c)     How many contain both vowels? d)    How many of them contain exactly three consonants? e)    How many of them begin and end in a consonant? f)      How many begin with N and end in a vowel? g)     How many begin with N and...
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 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.؟
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?
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...
How many arrangements of length n where 1 ≤ n ≤ 8 can be formed from...
How many arrangements of length n where 1 ≤ n ≤ 8 can be formed from the letters A, A, B, C, C, C, D, E where (a) both A’s are adjacent? (b) the string starts or ends with A? (c) you use (exactly) 4 letters from the list?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT