Assume that a vowel is one of the letters A, E, I, O, U, or Y (for the purposes of this problem, we will ignore the fact that Y is not always a vowel.) (a) How many ten-letter sequences from the alphabet contain exactly three vowels? (b) How many of the sequences from part (a) have at least one repeated letter?

Answer :

Answer:

a. [tex]10_3 {C} * 6^{3} * 20^{7}[/tex] = 33,177,600,000,000 sequences

b. [tex]10_3 {C} * 6^{3} * 20^{7} - 10_3 {C} * 6_3 {P} * 20_7{P}[/tex] = 27,551,508,408,000 sequences

Step-by-step explanation:

The step-by-step explanation is attached.

${teks-lihat-gambar} ridwanatanda29
${teks-lihat-gambar} ridwanatanda29

Other Questions