Discrete Mathematics
Discrete Mathematics
5th Edition
ISBN: 9780134689562
Author: Dossey, John A.
Publisher: Pearson,
bartleby

Videos

Question
Book Icon
Chapter 6, Problem 1SE

(a)

To determine

To find: The number of system of distinct representatives for the sequence of set {1,2,3,4,5},{1,2,3,4,5},{1,2,3,4,5}.

(a)

Expert Solution
Check Mark

Answer to Problem 1SE

There are 60_ system of distinct representatives for the sequence of set {1,2,3,4,5},{1,2,3,4,5},{1,2,3,4,5}.

Explanation of Solution

Given:

The sequence of set is {1,2,3,4,5},{1,2,3,4,5},{1,2,3,4,5}.

Concept used:

If the finite sequence of sets S1,S2,,Sn have the elements x1,x2,,xn then the sets S1,S2,,Sn are the system of distinct representative such that xiSi.

Here, i is equal to 1,2,,n and the element xi are all distinct.

Calculation:

The set S1,S2,S3 can be written as follows:

S1={1,2,3,4,5}S2={1,2,3,4,5}S3={1,2,3,4,5}

To obtain the number of distinct representative, there are 5 ways to choose an element from the set S1 and then 4 ways left to select the element from the set S2 because one element is selected from set S1.

Now, there are only 3 ways to select the element from set S3 for distinct representative.

Therefore, the number n of distinct representative for the sets S1,S2,S3 can be calculated as follows:

n=543=60

Thus, the number of distinct representative for the sets S1,S2,S3 is 60_.

(b)

To determine

To find: The number of system of distinct representatives for the sequence of set {1,2,3,4},{1,2,3,4},{5,6,7}.

(b)

Expert Solution
Check Mark

Answer to Problem 1SE

There are 36_ system of distinct representatives for the sequence of set {1,2,3,4},{1,2,3,4},{5,6,7}.

Explanation of Solution

Given:

The sequence of set is {1,2,3,4},{1,2,3,4},{5,6,7}.

Calculation:

The set S1,S2,S3 can be written as follows:

S1={1,2,3,4}S2={1,2,3,4}S3={5,6,7}

To obtain the number of distinct representative, there are 4 ways to choose an element from the set S1 and then 3 ways left to select the element from the set S2 because one element is selected from set S1.

Now, there are only 3 ways to select the element from set S3 as {5,6,7} for distinct representative.

Therefore, the number n of distinct representative for the sets S1,S2,S3 can be calculated as follows:

n=433=36

Thus, the number of distinct representative for the sets S1,S2,S3 is 36_.

(c)

To determine

To find: The number of system of distinct representatives for the sequence of set {1,2,3},{2,3,4},{1,2,4},{1,3,4},{2,3,4}.

(c)

Expert Solution
Check Mark

Answer to Problem 1SE

There is 0_ system of distinct representatives for the sequence of set {1,2,3},{2,3,4},{1,2,4},{1,3,4},{2,3,4}.

Explanation of Solution

Given:

The sequence of set is {1,2,3},{2,3,4},{1,2,4},{1,3,4},{2,3,4}.

Concept used:

The sequence of set S1,S2,,Sn is distinct representative if the sequence x1,x2,xn is exists such that xiSi for i=1,2,,n.

Here, the elements xi are all distinct.

Calculation:

The sequence of set can be written as follows:

S1={1,2,3}S2={2,3,4}S3={1,2,4}S4={1,3,4}S5={2,3,4}

The union of set S1,S2,S3 and S4 can be obtained as follows:

S1S2S3S4S5={1,2,3,4}

The total number of elements in the above set is 4 such that the elements can be arranged in 4! ways that is equal to 24.

The elements {1,2,3,4} can be arranged in 6 ways as follows:

S1={1,2,3,4}S2={1,2,4,3}S3={1,3,2,4}S4={1,3,4,2}S5={2,1,3,4}S6={4,2,3,1}

Similarly, there are 18 more ways to arrange the elements {1,2,3,4}.

The sequence of set is distinct representative if the above mentioned sequence satisfies the condition that xiSi.

The general form of the arranged sequences is as follows:

S={x1,x2,x3,x4}

The set S1={1,2,3,4} has the values of x1,x2,x3 and x4 are 1,2,3 and 4 respectively.

The first element of the set S1 is 1 that belongs to set S1, second element is 2 that belongs to set S2, third element is 3 that belongs to set S3 and fourth element is 4 that does not belong to set S4.

Therefore, the set S1={1,2,3,4} is not distinct representative.

Similarly, all the sets do not satisfy the condition xiSi.

Thus, there is 0_ system of distinct representatives for the sequence of set {1,4},{2},{2,3},{1,2,3}.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Chapter 6 Solutions

Discrete Mathematics

Ch. 6.1 - Prob. 11ECh. 6.1 - Prob. 12ECh. 6.1 - Prob. 13ECh. 6.1 - Prob. 14ECh. 6.1 - Prob. 15ECh. 6.1 - Prob. 16ECh. 6.1 - Prob. 17ECh. 6.1 - Prob. 18ECh. 6.1 - Prob. 19ECh. 6.1 - Prob. 20ECh. 6.1 - Prob. 21ECh. 6.1 - Prob. 22ECh. 6.1 - Let S1, S2, … , Sm and T1, T2, … , Tn be sequences...Ch. 6.1 - Prob. 27ECh. 6.1 - Prob. 28ECh. 6.1 - Prob. 29ECh. 6.1 - Prob. 30ECh. 6.2 - Prob. 1ECh. 6.2 - Prob. 2ECh. 6.2 - Prob. 3ECh. 6.2 - Prob. 4ECh. 6.2 - Prob. 5ECh. 6.2 - Prob. 6ECh. 6.2 - Prob. 7ECh. 6.2 - Prob. 8ECh. 6.2 - Prob. 9ECh. 6.2 - Prob. 10ECh. 6.2 - Prob. 11ECh. 6.2 - Prob. 12ECh. 6.2 - Prob. 13ECh. 6.2 - Prob. 14ECh. 6.2 - Prob. 15ECh. 6.2 - Prob. 16ECh. 6.2 - Prob. 17ECh. 6.2 - Prob. 18ECh. 6.2 - Prob. 19ECh. 6.2 - Prob. 20ECh. 6.2 - Prob. 21ECh. 6.2 - Prob. 22ECh. 6.2 - Prob. 23ECh. 6.2 - Prob. 24ECh. 6.2 - Prob. 25ECh. 6.2 - Prob. 26ECh. 6.2 - Find a graph in which a maximum matching has fewer...Ch. 6.2 - Prob. 32ECh. 6.3 - Prob. 1ECh. 6.3 - Prob. 2ECh. 6.3 - Prob. 3ECh. 6.3 - Prob. 4ECh. 6.3 - Prob. 5ECh. 6.3 - Prob. 6ECh. 6.3 - Prob. 7ECh. 6.3 - In Exercises 5–10, a matrix is given with an...Ch. 6.3 - Prob. 9ECh. 6.3 - Prob. 10ECh. 6.3 - Prob. 11ECh. 6.3 - Prob. 12ECh. 6.3 - Prob. 13ECh. 6.3 - Prob. 14ECh. 6.3 - Prob. 15ECh. 6.3 - Prob. 16ECh. 6.3 - Prob. 17ECh. 6.3 - Prob. 18ECh. 6.3 - Prob. 19ECh. 6.3 - Prob. 20ECh. 6.3 - Prob. 21ECh. 6.3 - Prob. 22ECh. 6.3 - Prob. 23ECh. 6.3 - Prob. 24ECh. 6.4 - Prob. 1ECh. 6.4 - Prob. 2ECh. 6.4 - Prob. 3ECh. 6.4 - Prob. 4ECh. 6.4 - Prob. 5ECh. 6.4 - Prob. 6ECh. 6.4 - Prob. 7ECh. 6.4 - Prob. 8ECh. 6.4 - Prob. 10ECh. 6.4 - Prob. 11ECh. 6.4 - Prob. 12ECh. 6.4 - Prob. 13ECh. 6.4 - Prob. 14ECh. 6.4 - Prob. 15ECh. 6.4 - Prob. 16ECh. 6.4 - Prob. 17ECh. 6.5 - Prob. 1ECh. 6.5 - Prob. 2ECh. 6.5 - Prob. 3ECh. 6.5 - Prob. 4ECh. 6.5 - Prob. 5ECh. 6.5 - Prob. 6ECh. 6.5 - Prob. 7ECh. 6.5 - Prob. 8ECh. 6.5 - Prob. 9ECh. 6.5 - Prob. 10ECh. 6.5 - Prob. 11ECh. 6.5 - Prob. 12ECh. 6.5 - Prob. 13ECh. 6.5 - Prob. 14ECh. 6.5 - Prob. 15ECh. 6 - Prob. 1SECh. 6 - Prob. 2SECh. 6 - Prob. 3SECh. 6 - Prob. 4SECh. 6 - Prob. 5SECh. 6 - Prob. 6SECh. 6 - Prob. 7SECh. 6 - Prob. 8SECh. 6 - Use the independent set algorithm to find a...Ch. 6 - Prob. 10SECh. 6 - Prob. 11SECh. 6 - Prob. 12SECh. 6 - Prob. 13SECh. 6 - Prob. 14SECh. 6 - Prob. 15SECh. 6 - Prob. 16SECh. 6 - Prob. 17SE
Knowledge Booster
Background pattern image
Math
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Text book image
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Text book image
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Text book image
Calculus Volume 1
Math
ISBN:9781938168024
Author:Strang, Gilbert
Publisher:OpenStax College
Text book image
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Text book image
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Text book image
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Minimum cuts and maximum flow rate; Author: Juddy Productions;https://www.youtube.com/watch?v=ylxhl1ipWss;License: Standard YouTube License, CC-BY