Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

How many permutations of the letters \(ABCDEFGH\) contain

a) the string \(ED\)?

b) the string \(CDE\)?

c) the strings \(BA\) and \(FGH\)?

d) the strings \(AB\;,\;DE\) and \(GH\)?

e) the strings \(CAB\) and \(BED\)?

f) the strings \(BCA\) and \(ABF\)?

Short Answer

Expert verified

a) There are \(5040\) ways of permutation.

b) There are \(720\) ways of permutation.

c) There are \(120\) ways of permutation.

d) There are \(120\) ways of permutation.

e) There are \(24\) ways of permutation.

f) There is no permutation with both strings.

Step by step solution

01

Given data

Letters \( = ABCDEFGH\).

02

Concept of Permutation

The word "permutation" refers to the act or process of changing the linear order of an ordered set.

Formula:

\(_n{P_r} = \frac{{n!}}{{(n - r)!}}\)

03

Calculation for the permutations of the letters for string \(ED\)

a)

Assume the string as a single letter.

So, the letter becomes \(ABCDEFGH\).

Find the permutations of \(7\) letters, use the formula of permutations:

Number of permutations \( = P(7,7)\)

\(\begin{array}{l}P(7,7) = \frac{{7!}}{{(7 - 7)!}}\\P(7,7) = \frac{{7!}}{{0!}}\\P(7,7) = 5040\end{array}\)

Hence, there are \(5040\) ways of permutation.

04

Step 4: Calculation for the permutations of the letters for string \(CDE\)

b)

Assume the string as a single letter.

So, the letter becomes \(ABCDEFGH\).

Find the permutations of \(6\) letters, use the formula of permutations:

Number of permutations \( = P(6,6)\)

\(\begin{array}{l}P(6,6) = \frac{{6!}}{{(6 - 6)!}}\\P(6,6) = \frac{{6!}}{{0!}}\\P(6,6) = 720\end{array}\)

Hence, there are \(720\) ways of permutation.

05

Calculation for the permutations of the letters for string \(BA\) and \(FGH\)

c)

Assume the string as a single letter.

So, the letter becomes \(ABCDEFGH\).

Find the permutations of \(5\) letters, use the formula of permutations:

Number of permutations \( = P(5,5)\)

\(\begin{array}{l}P(5,5) = \frac{{5!}}{{(5 - 5)!}}\\P(5,5) = \frac{{5!}}{{0!}}\\P(5,5) = 120\end{array}\)

Hence, there are \(120\) ways of permutation.

06

Calculation for the permutations of the letters for string \(ABDE\) and \(GH\)

\(GH\)

d)

Assume the string as a single letter.

So, the letter becomes \(ABCDEFGH\).

Find the permutations of \(5\) letters, use the formula of permutations:

Number of permutations \( = P(5,5)\)

\(\begin{array}{l}P(5,5) = \frac{{5!}}{{(5 - 5)!}}\\P(5,5) = \frac{{5!}}{{0!}}\\P(5,5) = 120\end{array}\)

Hence, there are \(120\) ways of permutation.

07

Calculation for the permutations of the letters for string \(AB\;,\;DE\) and \(GH\)

e)

Assume the string contains \(CABED\) as a single letter because \(B\) can occur only once.

So, the letter becomes \(CABEDFGH\).

Find the permutations of \(4\) letters, use the formula of permutations:

Number of permutations \( = P(4,4)\)

\(\begin{array}{l}P(4,4) = \frac{{4!}}{{(4 - 4)!}}\\P(4,4) = \frac{{4!}}{{0!}}\\P(4,4) = 24\end{array}\)

Hence, there are \(24\) ways of permutation.

08

Calculation for the permutations of the letters for string \(BCA\) and \(ABF\)

f)

String cannot contain both \(BCA\) and \(ABF\) because the string \(B\) cannot be follow directly \(C\) and \(F\) both.

Hence, there is no permutation with both strings.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

A coin is flipped eight times where each flip comes up either heads or tails. How many possible outcomes

a) are there in total?

b) contain exactly three heads?

c) contain at least three heads?

d) contain the same number of heads and tails?

A coin is flipped times where each flip comes up either heads or tails. How many possible outcomes

a) are there in total?

b) contain exactly two heads?

c) contain at most three tails?

d) contain the same number of heads and tails?

x101y99What is the coefficient ofin the expansion of(2xโˆ’3y)200?

This procedure is used to break ties in games in the championship round of the World Cup soccer tournament. Each team selects five players in a prescribed order. Each of these players takes a penalty kick, with a player from the first team followed by a player from the second team and so on, following the order of players specified. If the score is still tied at the end of the 10 penalty kicks, this procedure is repeated. If the score is still tied after 20 penalty kicks, a sudden-death shootout occurs, with the first team scoring an unanswered goal victorious.

a) How many different scoring scenarios are possible if the game is settled in the first round of 10 penalty kicks, where the round ends once it is impossible for a team to equal the number of goals scored by the other team?

b) How many different scoring scenarios for the first and second groups of penalty kicks are possible if the game is settled in the second round of 10 penalty kicks?

c) How many scoring scenarios are possible for the full set of penalty kicks if the game is settled with no more than 10 total additional kicks after the two rounds of five kicks for each team?e1โˆ’1โˆ’x2

Suppose that and are integers with1โ‰คk<n . Prove the hexagon identity(nโˆ’1kโˆ’1)(nk+1)(n+1k)=(nโˆ’1k)(nkโˆ’1)(n+1k+1) which relates terms in Pascal's triangle that form a hexagon.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free