How many ways are there to select a first prize

This preview shows page 37 - 45 out of 70 pages.

: How many ways are there to select a first-prizewinner, a second prize winner, and a third-prize winnerfrom100different people who have entered a contest?Solution:P(100,3) =100∙ 99 ∙98=970,20037
Solving Counting Problems by CountingPermutationsExample: Suppose a saleswoman has to visit eightdifferent cities. She must begin her trip in a specifiedcity, but she can visit the other seven cities in anyorder.How many possible orders exist?Solution: The first city is chosen, and the rest are orderedarbitrarily. Hence the orders are:7! = 7654321 = 5040If you need to find the tour with the shortest path that visitsall the cities, do you need to consider all 5040 paths?38
Theorem: Ifnis a positive integer andris an integerwith 1rn, then there are࠵౷࠵?࠵ಏ࠵?,࠵ಓ࠵?=n(n1)(n2)∙∙∙(nr+ 1)=࠵౛࠵?!࠵౛࠵?−࠵౟࠵?!r-permutations of a set with n distinct elements.Proof: Use the product rule.The first element can be chosen innways.The second element can be chosen inn1 ways,..until there are (n(r1)) ways to choose the lastelement.Note: P(n,0) = 1. There is only one way to order zeroelements.39
Solving Counting Problems byCounting PermutationsExample: How many permutations of the lettersABCDEFGHcontain the stringABC?Solution: We solve this problem by counting thepermutations of six objects,ABC,D,E,F,G, andH.6! = 654321 = 72040
CombinationsDefinition: Anr-combinationof elements of a set is anunorderedselection ofrelements from the set.Anr-combination is a subset withrelements.The number ofr-combinations of a set with n distinctelements is denoted byC(n,r).Notation:࠵శ࠵?࠵౛࠵?,࠵౟࠵?=࠵౛࠵?࠵౟࠵?is called abinomial coefficient.41
Example: CombinationsS= {a,b,c,d}{a,c,d} is a 3-combination from S.It is the same as {d,c,a} since the order does notmatter.C(4,2) = 6The 2-combinations of set {a,b,c,d} are six subsets:{a,b}, {a,c}, {a,d}, {b,c}, {b,d}, and {c,d}.42
CombinationsTheorem: The number ofr-combinations of a set withnelements,nr0, isProof:The P(n,r) r-permutations of the set can be obtained byforming theC(n,r) r-combinations and thenordering the elements in each which can be done inr! waysBy the product ruleP(n,r) =C(n,r) ∙r!The resultfollows.43
44Useful identities࠵శ࠵?࠵౛࠵?,࠵౟࠵?=࠵ృ࠵?࠵౛࠵?,࠵౟࠵?࠵౟࠵?!࠵ృ࠵?࠵౛࠵?,࠵౟࠵?=࠵శ࠵?࠵౛࠵?,࠵౟࠵?⋅ ࠵౟࠵?!࠵శ࠵?࠵౛࠵?,࠵౟࠵?=࠵శ࠵?࠵౛࠵?,࠵౛࠵? − ࠵౟࠵?

Upload your study docs or become a

Course Hero member to access this document

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 70 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
NoProfessor

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture