Scribd
Upload
22 views

1 Counting Methods: Discussion-3 Name

This document discusses counting methods and probability. It covers: 1) Counting methods for discrete sample spaces with equally likely outcomes, including the multiplication principle and types of sampling. 2) Ordered sampling with and without replacement, including permutations and their formulas. 3) Unordered sampling without replacement, also called combinations, and their formula using binomial coefficients. 4) It provides two example probability problems and hints for solving them using counting principles.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

1 Counting Methods: Discussion-3 Name

This document discusses counting methods and probability. It covers: 1) Counting methods for discrete sample spaces with equally likely outcomes, including the multiplication principle and types of sampling. 2) Ordered sampling with and without replacement, including permutations and their formulas. 3) Unordered sampling without replacement, also called combinations, and their formula using binomial coefficients. 4) It provides two example probability problems and hints for solving them using counting principles.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Discussion-3

Name:

1 Counting Methods
- Counting methods can be used for discrete sample spaces with equally likely
outcomes.
- For such a finite sample space S, the probability of an event A is
|A|
P (A) = |S|

1.1 Multiplication Principle


- The principle is given as
Suppose that we perform r experiments such that the kth experiment
has nk possible outcomes, for k = 1,2,· · · ,r. Then there are a total of
n1 ×n2 ×n3 ×· · ·×nr possible outcomes for the sequence of r experiments.
- Sampling- Choosing an element from a set. We draw a sample at random from
a given set in which each element of set has equal chance of being chosen.
1. With replacement- While drawing multiple samples from a set, if we put
each element back after each draw, we call it sampling with replacement.
It also means repetition allowed.
2. Without replacement- While drawing multiple samples, we do not put
each element back after every draw, i.e repetitions not allowed.
3. Ordered- Sampling in which ordering matters.
4. Unordered- Sampling in which ordering does not matter.

2 Ordered Sampling with Replacement


- We need to make k draws from a set of n-elements in which ordering matters
and there is repetition.
- Thus the total number of ways of choosing k objects from a set with n elements
when ordering matters and repetition is allowed

n × n × ... × n = nk .
2.1 Ordered Sampling without Replacement: Permutations
- When ordering matters and repetitions are not allowed, the total number of
ways of choosing k objects from a set with n elements is given as

n × (n − 1) × ... × (n − k + 1).

- This is referred to as k-permutations of an n-element set:

Pkn = n × (n − 1) × ... × (n − k + 1).

- Note that for k > n, we have Pkn = 0 and if k = n,

Pnn = n × (n − 1) × ... × 1.

- Pnn is equal to n! and is pronounced as n factorial.

- In general
The number of k-permutations of n distinguishable objects is given by

n!
Pkn = (n−k)!
, for 0 ≤ k ≤ n.

- Common notations for k-permutations of an n-element set include Pn,k ,nP k, etc.

2
3 Problem
1. If k people are at a party, what is the probability that at least two of them have
the same birthday? Suppose that there are n = 365 days in a year and all days
are equally likely to be the birthday of a specific person.

Hint: Let A be the event that at least two people have the same birthday. First
note that if k > n, then P (A) = 1; so, let’s focus on the more interesting case
where k ≤ n. The phrase “at least” suggests that it might be easier to find the
probability of the complement event, P (Ac ). This is the event that no two people
have the same birthday ...

3
4 Unordered Sampling without Replacement:
Combinations
- We want to make k draws from a set of n-elements in which ordering does
not matter and repetition is not allowed.
- This means that we have to chose a k-element subset of A, and is also called
k-combination of the set A.
- The number of k-element subsets of A is given by nk and is read as n


choose k.
- The difference between nk and Pkn is in the ordering.


- For any k-element subset of A, we can order the elements in k! ways. Thus
Pkn = nk × k!


n n!

k
= k!(n−k)!
n

- If k > n, then k
= 0.
- In general
The number of k-combinations of an n-element set is given by
n n!

k
= k!(n−k)! , for 0 ≤ k ≤ n.

n

- k
is also called the binomial
 coefficient; as the coefficients in the bino-
mial theorem are given by nk .
- The binomial theorem states that for an integer n ≥ 0, we have
n  
n
X n k n−k
(a + b) = a b .
k=0
k

- n choose k is also denoted as Cn,k , C(n, k), nCk, etc.

n

4.1 Interpretation of k
n

We can interpret k
as
The total number of ways to divide n distinct objects into two groups
A and B such that group A consists of k objects and group B consists
n

of n − k objects is k .

4
5 Problem
2. I have 10 Algebra books and 20 probability books. I choose 5 books at random.
What is the probability that I choose more than 2 probability books?

You might also like