÷
|
¬
!| c
!" #
$%
#
$
| G
$
$$
&
G'
$
| (
$
$$
)
$| (
$$
)
|
$$
*
)
| G
$$
G
$$
#
#
$$
#
#
+| c
+"
| G
"
"
"
G
#
,
* $
$$
In the study of probability, an
is a process or
investigation from which results are observed or recorded. An
is
a possible result of an experiment. A
is the set of all
possible outcomes in the experiment. It is usually denoted by the letter ©.
Sample space can be written using the set notation, { }.
-
! Tossing a coin
Possible outcomes are head or tail.
Sample space, © = {head, tail}.
|
|
c c
÷
|
| G-./01G12c 1.c-
.
5
Let the four dresses be D1, D2, D3, and D4, whereby the three
shoes be S1, S2, and S3. If the question above is answered by mentioning
one by one, then the result which possibly happens is:
! + 6
B1 B1S1 B1S2 B1S3
B2 B2S1 B2S2 B2S3
B3 B3S1 B3S2 B3S3
B4 B4S1 B4S2 B4S3
|
|
c c
÷
|
So, the number of different ways Rhonda can pick up her clothing
is 12 ways.
4 ways 3 ways
So, the number of different ways Rhonda can pick up her clothing is 4 x 3
ways = 12 ways.
The completion using the last method is called determining the
number of an experiment by multiplication rule. Thereby, the
multiplication rule can be defined as follows
If the first place can be filled place with n1 way, the second place n2 way,
the nk way, so the number of ways to fill the available kth places is :
! 7+787
|
|
c c
÷
|
The expression 6 × 5 × 4 × 3 × 2 × 1 = can be written as 6!
which is read as ³six factorial.´
In general, n! is the product of all the counting numbers
beginning with 6 and counting backwards to 1. We define 0! to be 1.
D
Find the value of each expression:
a) 3!
b) 0!
c) 5!
d) 1!
e) 3! + 2!
f)
a) 3! = 3 × 2 × 1 = 6
b) 0! = 1
c) 5! = 5 × 4 × 3 × 2 × 1 = 120
d) 1! = 1
e) 3! + 2! = (3 × 2 × 1) + (2 × 1) = 8
f)
$| c
c"
A permutation is an arrangement, or listing, of objects in which
the order is important. In the previous lesson, we looked at examples
of the number of permutations of 6 things taken 6 at a time. In this
lesson, we will consider the number of permutations of 6 things
taken at a time.
In general P (6, ) means that the number of permutations
of 6 things taken at a time. We can either use reasoning to solve these
types of permutation problems or we can use the permutation formula.
|
|
c c
÷
|
The formula for permutation is
| c
Permutation of two letters of A,B,r are AB, BA, Ar, rA, Br,
rB. Here the letters are not reccurently used. If the letters may be
used reccurently, so the result becomes : AA, AB, Ar, BA, BB, Br,
rA, rB, and rr.
So, the number of reccuring permutations, of 3 letters A,B, and r
taken 2 times is 9.
This calculation can also be done by the folowing way:
1.| The first letter can be filled with A, B, r (3 ways)
2.| Because the use of letter may recur, so the second letter can also be
filled with A, B, r. Based on the rule of available place filling, the
quantity of the whole order is : 3 x 3 = 32
In general it can be written that:
The permutation quantity of r element which is taken from the
available n elements is Pb(n, k) = nk
| c
#'
For example you dry 5 shirts, and two of them are identical
uniform shirts. rertainly you know that if the shirts are different, then
the shirts can be ordered into 5! Permutation, however because there
are identical shirts, so what is the way to determine the number of
arrangements.
So the number of permutations of 3 letters of the word ADA is
m
3 permutations, that comes from = = = 3
|
|
c c
÷
|
G t
l t ti ltt
t
t
iiil
ltiil
lt
t i:
§
|
§ §
Ê | Ê
G li
l t
ti lt¶ t
l
t
ti lttBr
:
BrrBBrBrrBrB
li
l t
ti
lt i t t
t it i
l t
t
li
l t
ll
l i t il i t
t t
l lt
t
t i
li
lt
tiBrBr
rB
l
i
irBBrrB
lt
t
li
lt
ti lttBri!"#!
lit
itt$
G li
lt
ti lti:
c || |
| G
t jt i
i t i t it
t i
ll
i
ti G i i i t t
ti
t
tt%&
l
it lttB
r
t
ti t
t Br
rB
i t Bt i
i
ti t
t Br
rB
t
t
itit
t
G i
ti 6t it
'
t
tii
itt
r6|
G l
ii:
| G
- -
G
|
|
c c
÷
|
In an experiment, #
is the result that we are interested in.
The probability of an event {, written ({), is defined as
-
+| -
c $$
|
|
c c
÷
|
GÊÊ
l i t t ti
l
ilit
t G
l
t ti
l
ilit
ti
D
t
i(
l)l
l
ll
l%i
t t ti
l
ilit tti
l
l
G
)l
lG t
lt
)
G
tt
l (
lG t tt
lt
(
| -;-G- -< -
t
* ilt t
liti&t
tiit
lt i
lititiilt
t
llt t ¶ il
il
ti
t
&t i&t
ti
l iilit/
ilitit
tt
&iti
itti
t
l
ilit + t
&it i + t &t
+ti:
D ||c|||
D |||
t
i"((ti
ti
&tt i ,
6||
|
|
c c
÷
|
+/,
"((
%-+&/,&"((.(
i
iit
"((tit
&t i,
.(ti
|
- -
G
t
t
tt
tt lti
t
t t
ti
ll
t
%
t
B
l
l
Bt t
ii
%t &l
ti
t
it i l
:
V Ê
| --
G- -
G
%&
li
ti
l
G tt
ti
t ttitilli
l
i
lllt
t
it
t¶
¶i
lttt t ll
i
li:
%t
iti
it
t:
|
|
c c
÷
|
¶ilttt
li:
| G-;---
G
Dt
Ê Êi t
t
t t
ti% &
li
t
i it
t
il i t
ttt
t
il
tt
tiiil
li
il
t
i
l
t t t
G t
t
ll&lit
{
t
ll &li t t t
ilit
{
it
ilit
ii{/
G t
B
llt
ll&lii :
t t
B
t
ll&lit :
|
|
c c
÷
|
Recall that when two events, A and B, are dependent, the
probability of both occurring is
P ( A and B) = P( A) × P( B given A)
or P( A and B) = P( A) × P( B | A)
If we divide both sides of the equation by P({) we get
G
$
G
# $
6
"
"
# $
"
$
$
G"
>"
$
$
$
"
| .
$
-!
Since a dice has six spots which are 1, 2, 3, 4, 5, and 6, whereby a coin
has two sides which are tail (T) and head (H), then the possible outcomes are
1T, 2T, 3T, 4T, 5T, 6T, 1H, 2H, 3H, 4H, 5H, and 6H. Thereby, the number of
ways the results may happen is 12.
|
|
c c
÷
|
-
Ê#
#
Ê
-
Ê#
li
* it
"t-
li
i it
t0
lti:
%&
lt it
BBB"B*
t t t
r r r" t ti
i
tii t t
t lt
i il
i:
|
|
c c
÷
|
t &
lt
t
it ti
i
'it
ll
i
it G
*
"
G
li
it
t *"
-
Ê#
#
G
t
t
t
' lt
&"/"&*
)
-
Êo#
|
|
c c
÷
|
G
0
Because the usage of digit may recur, so each box can be filled by 1, 2, 3, and 4 (4
ways). Thereby, the amount of numbers that can be arranged
= 4 x 4 x 4 = 64
G
0
= 4 x 3 x 2 = 24 numbers
c
6
66
-!
This problem can be solved with the rule of filling the available places as
follows:
|
|
c c
÷
|
Ê Ê Ê Ê Ê Ê
3
,
.
G & tt
ill
3
%
&
llt tt ill
t tt
l ill
,
tti illt tt
l ill
.
t t
ti" 3ltti:
3"34,4.(
t lt
&i
ti
lt
ti
ll
:
-
Ê#
#
, '*
|
|
c c
÷
|
For the first letter, there are 5 possible choices. After that letter is chosen, there
are 4 possible choices. Finally, there are 3 possible choices.
5 × 4 × 3 = 60
0
The problem involves 5 things (A, B, r, D, E) taken 3 at a time.
There are 210 possible ways to choose a president, a treasurer and a secretary be
chosen from among 7 candidates
-!
Determine the quantity of odd numbers which consist of four digits which can be
formed of digits 1, 2, 3, 4, 5 if the odd and even numbers may not flank each other
and the usage of digit.
a.| Does not recure
b.| May recur
|
|
c c
÷
|
B
t
t l
'
t t t
i:
|| | D||| D|||| || |
| B
t
iittt
tit
i
i:
"&/&",&/&,*
| B
t
iit
t
tit
i
i:
"&/&""&/&"3
-
Ê#
| 2t
| M
#
ti'
t tit
tt "iit *
il
liit
ill
t
t
t*
'"
it
iittt t
t "iit
*
il
liit
ti
ll
:
i t
iit
t t
t " iit
*
il
liitt
it
ti
|
|
c c
÷
|
Ê
% Ê&Ê
Ê'
ÊÊÊ
-
Ê#
-
t
ti t ltt
t ltt t
B B0
#
-
it t
B
li't
itt ii
i:
-
Ê#
-
t
ti t ltt
t
' t ltt
20
lti:
t
i t
t:
m m
""
m m
t
ti
22222 2
-
t
iil
i:
{ {| { {| { {|
{{| {{| {{|
{{ | |{{ | |{{ |
|
|
c c
÷
|
t t
ti " ltt t
2 i " t
ti
m
t
t "
-
Êo#
#
."
Ê
-
Ê#
%i l t
t
t t
l -
t
0
lti:
..#!*&"&&*
t
t
i
*'i
D
ltt
ti't
.#iit(#5it
6
i i ti't
t iit i
t
ii0
6
l
ili ti't
t iitit i
t
ii0
©
|
|
c c
÷
|
There are 10 digits to be taken 5 at a time.
a) Using the formula:
D
In how many ways can a coach choose three swimmers from among five
swimmers?
There are 5 swimmers to be taken 3 at a time.
Using the formula:
|
|
c c
÷
|
n(©) = number of outcomes in © = 6
The probability of an event is a number from 0 to 1 that measures the chance that
an event will occur. In this lesson, we will look into experimental probability and
theoretical probability.
|
|
c c
÷
|
-ÊÊ
-
Ê#
#
R
t
ti
(ti
G &it
l
ilit tti
l
l t
i
-Ê Ê Ê'Ê
-
Ê#
t
i"((ti
ti
&tt i ,
#
i
iit"((tit
&t i,
.(ti
-
Ê#
t
i"((ti
ti
&tt i ,
#
+/,
"((
%-+&/,&"((.(
i
iit
"((tit
&t i,
.(ti
|
|
c c
÷
|
.
#
-!
A number is chosen at random from a set of whole numbers from 1 to 50.
ralculate the probability that the chosen number is not a perfect square.
Let A be the event of choosing a perfect square.
Let A be the event that the number chosen is not a perfect square.
A = {1, 4, 9, 16, 25, 36, 49}
Number of elements in A, n(A) = 7
Total number of elements, n(S) = 50
D
The probabilities of three teams A, B and r winning a badminton competition are
|
|
c c
÷
|
©
ill
i7Br
ill
i
it B
ill
i7it B
ill
i
-&Ê-&Ê
D
tit
ilit
i
i
.0
©
-
Ê#
#
G
ll
t
':
G
ll
it
lt
t
tt
llt
it
ll
|
|
c c
÷
|
:
:
ÊÊÊ Ê&Ê
D
G
t
it
ltt
ll
l
it
t
li'
%it
ilitt
t:
i't ltt81¶
8R¶
Bt ltt
8 ¶
Bt ltt
l
©
|
ilitt
t i'1
R
D !" #
iit
t
i it
ilit ttit
.¶
|
|
c c
÷
|
.
-#
-!
Susan took two tests. The probability of her passing both tests is 0.6. The
probability of her passing the first test is 0.8. What is the probability of her
passing the second test given that she has passed the first test?
-+
What is the probability that the total of two dice will be greater than 9,
given that the first die is a 5?
Let A = first die is 5
Let B = total of two dice is greater than 9
P (A) =
Possible outcomes for A and B: (5, 5), (5, 6)
P (A and B) =
-6
What is the probability that the total of two dice will be greater than 9, given that
the first dice is a 5?
|
|
c c
÷
|
t itii.
tBtt
l t
ii
tt
5
|
|
c c
÷
|
(/ --Gc /G4/ -1/ 2.//
NAME :
rLASS :
FINDING THE FORMULA OF PERMUTATION
How many permutation is there from a group of 3 letters A, B, r, that taken:
Multiplication
Rule | | | | |
|
= ... x ´ x ´ =´x´ =´
=´ =´
Factorial Total of Total of Total of
(the form from permutation= ´ permutation= ´ permutation= ´
multiplication
rule can be =
Ô ÔÔ Ô
=
Ô Ô Ô
=
Ô Ô
Ô Ô Ô
written as Ô Ô Ô
factorial) = (equation 1) = (equation 2) = (equation 3)
n is the number of all letters. And k is the number of letter that taken.
The denominator of each equation can be obtained from the relation between
n and k that is
= ( ´ - ´.)!
In general it can be written that:
The number of permutation of k element of n different element is
Ô
P (n, k)= Ô
|
|