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 different linear arrangements are there of the letters A, B, C, D, E, F for which

(a) A and B are next to each other?

(b) A is before B?

(c) A is before B and B is before C?

(d) A is before B and C is before D?

(e) A and B are next to each other and C and D are also next to each other?

(f) E is not last in line?

Short Answer

Expert verified

(a) The no. of linear arrangements of the letters A, B, C, D, E, F such that A and B are next to each other is240.

(b) The no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B is360.

(c) The no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B and B is before C is120.

(d) The no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B and C is before D is180.

(e) The no. of linear arrangements of the letters A, B, C, D, E, F such that A and B are next to each other and C and D are also next to each other is96.

(f) The no. of linear arrangements of the letters A, B, C, D, E, F such that E is not last in line is600.

Step by step solution

01

Part (a) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that A and B are next to each other.

Suppose A and B are together and form a group, then no. of groups are 5.

These groups can be arranged in 5!ways=5×4×3×2×1=120ways

A and B can be arranged in 2!ways=2×1=2ways.

Therefore, the possible no. of arrangements are=120×2=240.

02

Part (b) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B.

Total no. of arrangements with six letters 6!=6×5×4×3×2×1=720

The no. of arrangements in which A is before B =7202

Therefore, the possible no. of arrangements are =360.

03

Part (c) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B and B is before C.

Total no. of arrangements with six letters 6!=6×5×4×3×2×1=720

A, B and C can be arranged in 3!ways=3×2×1=6ways

Out of these 6 arrangements, there is only one arrangement in which A is before B and B is before C.

So, the possible no. of ways = 61=6!1!5!=6×5!1×5!=6

Therefore, the possible no. of arrangements are7206=120.

04

Part (d) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that A is before B and C is before D.

The no. of arrangements in which A is before B =6!2=360

Out of these 360arrangements, half will be with C before D and half will be with D before C.

Therefore, the possible no. of arrangements are3602=180.

05

Part (e) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that A and B are next to each other and C and D are also next to each other.

If A and B form one group and C and D from another group then there are 4groups and these groups can be arranged in 4!ways=4×3×2×1=24ways

A and B can be arranged in 2!ways=2×1=2ways

Similarly, C and D can be arranged in 2!ways=2×1=2ways

Therefore, the possible no. of arrangements are24×2×2=96.

06

Part (f) Step 1. Find the no. of linear arrangements of the letters A, B, C, D, E, F such that E is not last in line.

The no. of arrangements in which the position of E is fixed at last =5!=5×4×3×2×1=120

The no. of arrangements in which the position of E is not fixedrole="math" localid="1648405653455" =6!=6×5×4×3×2×1=720

Therefore, the possible no. of arrangements are 720-120=600.

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

Argue that

nn1,n2,........,nr=n-1n1-1,n2,........,nr+n-1n1,n2-1,........,nr+......+n-1n1,n2,........,nr-1

Hint: Use an argument similar to the one used to establish Equation (4.1).

(a) How many different 7-place license plates are possible if the first 2 places are for letters and the other 5 for numbers? (b) Repeat part (a) under the assumption that no letter or number can be repeated in a single license plate

Consider a tournament of ncontestants in which the outcome is an ordering of these contestants, with ties allowed. That is, the outcome partitions the players into groups, with the first group consisting of the players who tied for first place, the next group being those who tied for the next-best position, and so on. Let localid="1648231792067" N(n)denote the number of different possible outcomes. For instance, localid="1648231796484" N(2)=3, since, in a tournament with localid="1648231802600" 2contestants, player localid="1648231807229" 1could be uniquely first, player localid="1648231812796" 2could be uniquely first, or they could tie for first.

(a) List all the possible outcomes when n=3.

(b) With localid="1648231819245" N(0)defined to equal localid="1648231826690" 1, argue without any computations, that localid="1648281124813" N(n)=i=1nniNn-i

Hint: How many outcomes are there in which localid="1648231837145" iplayers tie for last place?

(c) Show that the formula of part (b) is equivalent to the following:

localid="1648285265701" N(n)=i=1n-1niNi

(d) Use the recursion to find N(3) and N(4).

For years, telephone area codes in the United States and Canada consisted of a sequence of three digits. The first digit was an integer between 2 and 9, the second digit was either 0 or 1, and the third digit was any integer from 1 to 9. How many area codes were possible? How many area codes starting with a 4 were possible

The following identity is known as Fermat’s combinatorial identity:

nk=i=kni-1k-1nk

Give a combinatorial argument (no computations are needed) to establish this identity.

Hint: Consider the set of numbers 1 through n. How many subsets of size k have i as their highest numbered member?

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