Probability

Vipinosa,
Permutation
Josell
Velasco,
Klarisse
Gaila, Diana
Pacot,

What is
Permutation
There are basically two types of permutation
1. Permutations with Repetition - These are the easiest
? to calculate.
When we have n things to choose from ...
we have n choices each time!
When choosing r of them, the
permutations are:
n n ... (r times)
(In other words, there are n possibilities for
the first choice, THEN there are n possibilites for the
second choice, and so on, multplying each time.)
Which is easier to write down using an exponent of r:
n n ... (r times) = nr

2. Permutations without Repetition - In this case, we have

to reduce the number of available choices each time.
For example, what order could 16 pool balls be in?
After choosing, say, number "14" we can't choose it again.
So, our first choice has 16 possibilites, and our next choice has 15
possibilities, then 14, 13, etc. And the total permutations are:
16 15 14 13 ... = 20,922,789,888,000
But maybe we don't want to choose them all, just 3 of them, so that is
only:
16 15 14 = 3,360
In other words, there are 3,360 different ways that 3
pool balls could be arranged out of 16 balls.
Without repetition our choices get reduced each time.

Thefactorialfunction(symbol:!)justmeanstomultiplyaseriesofdescending
naturalnumbers.Examples:
4!=4321=24
7!=7654321=5,040
1!=1
Note:itisgenerallyagreedthat0!=1.Itmayseemfunnythatmultiplyingnonumbers
togethergetsus1,butithelpssimplifyalotofequations.

So, when we want to select all of the billiard balls the permutations are:
16! = 20,922,789,888,000
But when we want to select just 3 we don't want to multiply after 14. How do
we do that? There is a neat trick ... we divide by 13! ...
Doyousee?16!/13!=161514

16 15
14 13
=
16

15

14
12 ...

13
12 ...

= 3,360

The
formulais
written:
wherenisthenumberofthingsto
choosefrom,andwechooserof
them
(Norepetition,ordermatters)

Examples:
Our "order of 3 out of 16 pool balls example" is:
16!
(16-3)!

20,922,789,88
= 8,000
=

3,360
6,227,020,800

16!
13!

(which is just the same as: 16 15 14 = 3,360)

How many ways can first and second place be awarded to 10 people?
(which is just the same as: 10 9 = 90)

10!

10!

=
(10 8!
2)!

3,628,80
0
40,320

=
90

ProbabilityandPermutations
* When dealing with probability and permutations, it is
important to know if the problem deals with
replacement, or without replacement. For example, "with
replacement" would be drawing an ace from a deck of cards and
then replacing the ace in the deck before drawing a second card.
"Without replacement" would be drawing the ace and not replacing
it in the deck before drawing the second card.
Probability
formula:

Wheren(S) is the
number of
elements in the
space andn(E) is
the number of
outcomes in the
event.

Examples:
1. Two cards are drawn at random from a standard deck of 52
cards, without replacement. What is the probability that both cards
drawn are queens?
event the way to draw 2 cards out of a

possible 4 queens

total the way to draw 2 cards from a deck

of 52cards
=43 = 12 = 1
52512652 221

2. Mrs. Dela Cruz has to correct papers for three different classes:
Algebra, Geometry, and Trig. If Mrs. Dela Cruz corrects the papers for
each class at random, what is the probability she corrects Algebra papers
first?
There is only one way to correct Algebra papers first.
Then, there are 2P2 ways to correct the other two sets of
papers.
The "total" - three class sets of papers 3P3 .

=121=2=1
32163

3. A card is drawn from a deck of standard cards and then replaced in the
deck. A second card is then drawn and replaced. What is the probability that
a queen is drawn each time?
On the first draw, the probability of getting one of the four queens in the deck
is 4 out of 52 cards. Because the queen is replaced into the deck, the
probability of getting a queen on the second draw remains the same. Using
the counting principle we have:
P(draw 2 queens) = P(queen on first draw) P(queen on second
draw)

END.