Question
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?
Step 1
Step 1: We want to form a 3-letter string that contains the letter 'A' and repetition is not allowed. Show more…
Show all steps
Your feedback will help us improve your experience
Aman Gupta and 75 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 do not 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$, allowing repetitions?
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD