b.lect6 - Outline Counting Techniques Lecture 6 Chapter 2:...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: Outline Counting Techniques Lecture 6 Chapter 2: Introduction to Probability Michael Akritas Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Counting Techniques Why Count? The Product Rules Permutations Combinations Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Thus, for the probability of a particular sample being selected, we need to know Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Thus, for the probability of a particular sample being selected, we need to know I How many samples of size n can be formed from N units? Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Thus, for the probability of a particular sample being selected, we need to know I How many samples of size n can be formed from N units? The answer to this questions is the number of combinations of n objects selected from N , Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Thus, for the probability of a particular sample being selected, we need to know I How many samples of size n can be formed from N units? The answer to this questions is the number of combinations of n objects selected from N , denoted by ( N n ) , and equals N n = N ! n !( N- n )! , where k ! = 1 2 k . Michael Akritas Lecture 6 Chapter 2: Introduction to Probability Outline Counting Techniques Why Count? The Product Rules Permutations Combinations First, in s.r. sampling from a population of N units every group of n has the same chance of being selected. Thus, for the probability of a particular sample being selected, we need to know I How many samples of size n can be formed from N units?...
View Full Document

Page1 / 61

b.lect6 - Outline Counting Techniques Lecture 6 Chapter 2:...

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

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