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

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

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

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

View Full Document
Review Basic concepts of probability Counting: -mn rule -Permutations rule
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

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

View Full Document
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?
Example : Cards 5 cards on the table : How many different ways to select 3 cards to form a 3-card hand

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

View Full Document
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).
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/18/2010 for the course STA 13 taught by Professor Samaniego during the Spring '10 term at UC Davis.

### 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
Ask a homework question - tutors are online