STATS 2D03 Lecture Notes - Lecture 3: Gamma Function, Npr

• School: McMaster University
• Department: Statistics
• Course: STATS 2D03
• Professor: David Lozinski

Document Summary

If we introduce indistinguishable elements where order does not matter . Example : we have 5 presenters and 3 breaks in a schedule . First imagine that the breaks are indistinguishable : break 1=1-3. If the breaks are indistinguishable these 2 arrangements would be identical . 8 ! arrangements we would have the above arrangement appear. Therefore if the objects are indistinguishable , the number of ways to order them is : Example : a dj plays 8 fast songs , How many ways can he arrange the genres total arrangements distinguishable. # of ways to arrange-06! of ways to arrange. I ! z# of ways to arrange chicken dance. Definition : combinator ics are sets where order does not matter. Example : how many different poker hands ( of 5 cards ) can be dealt from a standard deck of. 52 cards ? of ways order matters : 52 .