Scribd
Upload
29 views93 pages

Homework Q1

The document covers various concepts in combinatorics and probability, including the subtraction rule, the pigeonhole principle, permutations, combinations, and discrete probability. It explains the principles of conditional probability, independence, Bernoulli trials, and the calculation of expected value and variance. Additionally, it references a textbook for further reading on discrete mathematics.

Uploaded by

mhmtyvuzz01
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
29 views93 pages

Homework Q1

The document covers various concepts in combinatorics and probability, including the subtraction rule, the pigeonhole principle, permutations, combinations, and discrete probability. It explains the principles of conditional probability, independence, Bernoulli trials, and the calculation of expected value and variance. Additionally, it references a textbook for further reading on discrete mathematics.

Uploaded by

mhmtyvuzz01
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/ 93

HOMEWORK Q1

HOMERWORK Q2
HOMERWORK Q3
HOMEWORK Q4
HOMEWORK Q5
HOMEWORK Q6
HOMEWORK Q7
COUNTING
The Subtraction Rule (Inclusion–Exclusion for
Two Sets)

The subtraction rule is also known as the principle of inclusion–exclusion, especially when
it is used to count the number of elements in the union of two sets
The Pigeonhole Principle
A common type of problem asks for the minimum number of objects such that at least r
of these objects must be in one of k boxes when these objects are distributed among the boxes.
When we have N objects, the generalized pigeonhole principle tells us there must be at least r
objects in one of the boxes as long as N/k ≥ r. The smallest integer N with N/k > r − 1,
namely, N = k(r − 1) + 1, is the smallest integer satisfying the inequality N/k ≥ r. Could
a smaller value of N suffice? The answer is no, because if we had k(r − 1) objects, we could
put r − 1 of them in each of the k boxes and no box would have at least r objects.
Permutations

A permutation of a set of distinct objects is an ordered arrangement of these objects.


We also are interested in ordered arrangements of some of the elements of a set. An ordered
arrangement of r elements of a set is called an r-permutation
Combinations

An r-combination of elements of a set is an unordered selection of r elements from the set.


Thus, an r-combination is simply a subset of the set with r elements.
Permutations with Repetition
Combinations with Repetition
Discrete Probability

REMARK !!! The probability of an event can never be negative or more than one!
Probabilities of Complements and Unions of
Events
Probability Theory

The function p from the set of all outcomes of the sample space S is called a probability distribution.
Conditional Probability
Independence
PAIRWISE AND MUTUAL INDEPENDENCE
Bernoulli Trials and the Binomial Distribution
• Suppose that an experiment can have only two possible outcomes.
• For instance, when a bit is generated at random, the possible outcomes are 0 and
1.
• When a coin is flipped, the possible outcomes are heads and tails.
• Each performance of an experiment with two possible outcomes is called a
Bernoulli trial
• A Bernoulli trial is called a success or a failure
• Many problems can be solved by determining the probability of k successes when
an experiment consists of n mutually independent Bernoulli trials.
• (Bernoulli trials are mutually independent if the conditional probability of
success on any given trial is p, given any information whatsoever about the
outcomes of the other trials)
Random Variables
The Birthday Problem
Expected Value and Variance
• The expected value of a random variable is the sum over all elements
in a sample space of the product of the probability of the element
and the value of the random variable at this element.
• Variance tells us how spread out the values of this random variable
are
Linearity of Expectations
Independent Random Variables
Variance
Reference

• 1. DiscreteMathematicsanditsApplications (7th Edition) byKennethH.


Rosen(McGraw-Hill, Inc., New York, 2007)

You might also like