lec12 - STATISTICS 13 STATISTICS Lecture 12 Oct. 22, 2010...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
STATISTICS 13 STATISTICS 13 STATISTICS 13 Lecture 12 Lecture 12 Oct. 22, 2010 Oct. 22, 2010
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Review Basic concepts of probability Counting: -mn rule -Permutations rule
Background image of page 2
Counting: Combinations The number of ways you can choose r objects without regarding order from n distinct objects )! ( ! ! r n r n P P C r r n r n r
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: Candidates Suppose we want to form a two-member committee from five candidates Adam, Bette, Carl, David, Elle , how many different committees are possible? Answer: Note that unlike the “ranking” problem, here the order of choice/selection is not important --what’s the difference compared to the ranking problem?
Background image of page 4
Example : Cards 5 cards on the table : How many different ways to select 3 cards to form a 3-card hand
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Cards (Cont.) 5 cards randomly drawn from a full deck of 52 without replacement to form a 5-card hand A flush is a hand of playing cards where all cards are of the same suit (spades, hearts, clubs, diamonds).
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 19

lec12 - STATISTICS 13 STATISTICS Lecture 12 Oct. 22, 2010...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online