A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing
 2 years ago
How many permutations of the letters ABCDEFG contain:
a.) the string BCD?
b.) the string CFGA?
c.) the strings BA and GF?
if you can explain, that would be awesome! Thank you kindly.
 2 years ago
How many permutations of the letters ABCDEFG contain: a.) the string BCD? b.) the string CFGA? c.) the strings BA and GF? if you can explain, that would be awesome! Thank you kindly.

This Question is Closed

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0Did u mean BCD togther?

kropot72
 2 years ago
Best ResponseYou've already chosen the best response.2a.) Assuming "the string BCD" means the three letters are grouped together, the number of permutations of the 7 letters containing the string BCD will equal the possible number of permutations of the remaining 4 letters. Each permutation of AEFG can be placed in 5 possible ways relative to the string as follows: 1. 0 letters before the string 2. 1 letter before the string 3. 2 letters before the string 4. 3 letters before the string 5. 4 letters before the string Therefore the required number of permutations is: \[4!\times 5\]
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.