Question

How many strings of eight English letters are there a) that contain no vowels, if letters can be repeated? b) that contain no vowels, if letters cannot be repeated? c) that start with a vowel, if letters can be repeated? d) that start with a vowel, if letters cannot be repeated? e) that contain at least one vowel, if letters can be repeated? f) that contain exactly one vowel, if letters can be repeated? g) that start with X and contain at least one vowel, if letters can be repeated? h) that start and end with X and contain at least one vowel, if letters can be repeated?

Solution

Verified
Step 1
1 of 14

DEFINITIONS

Product rule \textbf{Product rule }If one event can occur in mm ways AND a second event can occur in nn ways, the number of ways the two events can occur in sequence is then mnm\cdot n.

Subtraction rule \textbf{Subtraction rule } If an event can occur either in mm ways OR in nn ways (overlapping), the number of ways the event can occur is then m+nm+n decreased by the number of ways that the event can occur commonly to the two different ways.

Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Continue with GoogleContinue with Facebook

Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Continue with GoogleContinue with Facebook

Recommended textbook solutions

Discrete Mathematics and Its Applications 7th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

7th EditionKenneth Rosen
4,285 solutions
Discrete Mathematics 8th Edition by Richard Johnsonbaugh

Discrete Mathematics

8th EditionRichard Johnsonbaugh
4,246 solutions
Discrete Mathematics and Its Applications 8th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

8th EditionKenneth Rosen
4,399 solutions

Related questions