Question
The letters $A B C D E$ are to be used to form strings of length $3 .$How many strings do not contain the letter $A$, allowing repetitions?
Step 1
However, we are to exclude the letter $A$ from our strings. This leaves us with $4$ letters: $B, C, D, E$. Show more…
Show all steps
Your feedback will help us improve your experience
Vysakh M and 76 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
The letters $A B C D E$ are to be used to form strings of length $3 .$ How many strings do not contain the letter $A$ if repetitions are not allowed?
Counting Methods and the Pigeonhole Principle
Basic Principles
The letters $A B C D E$ are to be used to form strings of length $3 .$ How many strings contain the letter $A$, allowing repetitions?
The letters $A B C D E$ are to be used to form strings of length $3 .$ How many strings contain the letter $A$ if repetitions are no allowed?
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD