{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

T102 SECTION 9.5 Permut & Combin


Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ey have 4 types of salads, 5 different entrees, and 6 yummy desserts? If you are given a list of 5 TV shows and are asked to list your top 3 choices, how many ways could you do this? How many different ID numbers are there if each is made up of 2 letters followed by 3 digits? Suppose the letter and digits cannot be repeated? Suppose the first letter must be I, for Indiana, and the letters and digits cannot be repeated? In a horse race with 8 horses, how many different finishes (win, place, show) are possible? (THIS IS ALSO A PERMUTATION) In how many ways can president, vice‐president, secretary, and treasurer be chosen from a group of 10 people if no person can hold more than 1 office? (THIS IS ALSO A PERMUTATION) II. PERMUTATIONS A. PERMUTATIONS OF UNLIKE OBJECTS A permutation is an arrangement of things in a definite order, with no repeats. List all possible arrangements of the following sets: Sets Arrangements of size n(S) Number of Arrangements S = {a, b} {ab, ba} When n(S) = 2 S = {a, b, c} {abc, acb, bac, bca, cab, cba} When n(S) = 3 S = {a, b, c, d} { abcd, abdc, acbd, acdb, adbc, adcb, bacd, badc,...
View Full Document

{[ snackBarMessage ]}