The document discusses different mathematical concepts regarding permutations and combinations:
1) It provides examples of calculating the number of permutations when some elements are the same, as well as when elements are partitioned into subsets.
2) It also gives the formula for calculating the number of combinations of selecting r objects out of n without regard to order.
3) Examples are presented on applying these concepts to problems involving arranging players by class, assigning students to hotel rooms, and selecting game cartridges from collections.
The document discusses different mathematical concepts regarding permutations and combinations:
1) It provides examples of calculating the number of permutations when some elements are the same, as well as when elements are partitioned into subsets.
2) It also gives the formula for calculating the number of combinations of selecting r objects out of n without regard to order.
3) Examples are presented on applying these concepts to problems involving arranging players by class, assigning students to hotel rooms, and selecting game cartridges from collections.
The document discusses different mathematical concepts regarding permutations and combinations:
1) It provides examples of calculating the number of permutations when some elements are the same, as well as when elements are partitioned into subsets.
2) It also gives the formula for calculating the number of combinations of selecting r objects out of n without regard to order.
3) Examples are presented on applying these concepts to problems involving arranging players by class, assigning students to hotel rooms, and selecting game cartridges from collections.
The document discusses different mathematical concepts regarding permutations and combinations:
1) It provides examples of calculating the number of permutations when some elements are the same, as well as when elements are partitioned into subsets.
2) It also gives the formula for calculating the number of combinations of selecting r objects out of n without regard to order.
3) Examples are presented on applying these concepts to problems involving arranging players by class, assigning students to hotel rooms, and selecting game cartridges from collections.
• Consider the following letters {a, b, c} with 6 permutations abc, acb, bac, cab, bca, and cba. • If b and c are both equal to x, then the new set of 6 permutations will be the following: axx, axx, xax, xax, xxa, and xxa. (Only 3 are distinct)
• Considering four different letters {a, b, c, d}, if we let a=b=x, and
c=d=y, then then the number of distinct permutations will be xxyy, xyxy, yxxy, yyxx, xyyx, and yxyx. • (4!/(2!*2!) = 6 distinct permutations) Theorem 2.4 (Page 69)
•The number of distinct permutations of n
things of which n1 are of one kind, n2 of a second kind, . . . , nk of a kth kind is
𝑛! 𝑛1! 𝑛2! 𝑛3! … 𝑛𝑘! EXAMPLE 2.20 (page 69) • In a college football training session, the defensive coordinator needs to have 10 players standing in a row. Among these 10 players, there are 1 freshman, 2 sophomores, 4 juniors, and 3 seniors. How many different ways can they be arranged in a row if only their class level will be distinguished
10! = 𝟏𝟐, 𝟔𝟎𝟎 1! 2! 4! 3! Theorem 2.5 (Page 69-70) • Consider the following letters {a,e,i,o,u}, the possible partition of into two cells in which the first cell contains 4 elements and the second cell 1 element are the following: • {(a, e, i, o), (u)} • {(a, i, o, u), (e)} • {(e, i, o, u), (a)} • {(a, e, o, u), (i)} • {(a, e, i, u), (o)}.
Note: There are 5 ways to partition a set of elements into two subsets, or cell, containing 4 elements in the first cell and 1 element in the second. Theorem 2.5 (Page 69-70) EXAMPLE 2.21 (page 70) • In how many ways can 7 graduate students be assigned to 1 triple and 2 double hotel rooms during a conference? Theorem 2.6 (Page 70) • In many problems, we are interested in the number of ways of selecting r objects from n without regard to order. These selections are called COMBINATIONS. • A combination is actually a partition with two cells, the one cell containing the r objects selected and the other cell containing the (n−r) objects that are left. • The number of such combinations, denoted by Theorem 2.6 (Page 70) • The number of combinations of n distinct objects taken r at a time is EXAMPLE 2.22 (pages 70-71) • A young boy asks his mother to get 5 Game-Boy TM cartridges from his collection of 10 arcade and 5 sports games. How many ways are there that his mother can get 3 arcade and 2 sports games?
• The number of ways of selecting • The number of ways of selecting
3 cartridges from 10 is 2 cartridges from 5 is
• Using the multiplication rule (Rule 2.1) with n1 = 120 and n2 = 10, we have (120)(10) = 1200 ways. EXAMPLE 2.23 (page 71) • How many different letter arrangements can be made from the letters in the word S-T-A-T-I-S-T-I-C-S
