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?

a. = 33,177,600,000,000 sequences

b. = 27,551,508,408,000 sequences

Step-by-step explanation:

The step-by-step explanation is attached.

false

step-by-step explanation:

4y - 6 + 4y^2 - 9

before simplifying this contains 4 terms

after simplifying

4y -15 + 4y^2

it contains 3 terms

3

step-by-step explanation:

in standard form:

a= dictionaries

b= maps

you have to buy 3 dictionaries, so put a 3 next to the a (dictionaries) so that you can multiply them by each other.

a3+b= 60 (the amount of money you have)

we already know the cost of a=15 so replace a with $15

($15 x 3)+b=60

multiply 15 and 3 to get $45 and replace it with $45

45+b=60

and then replace b with 15 to get the total:

45+15=60

that means you have $15 left after buying 3 dictionaries.

15 divided by the cost of a map ($5) equals 3.

so you can buy 3 maps.

sorry if it was confusing!