Anda di halaman 1dari 28

c c 


 ÷ 
|
¬  


 
   
   
 
 

  
        
   


 



 
!| 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-./01G 12c 1. c-

The counting principle is a lesson related to determining the


number of ways an experiment may happen. Determining the number of
ways an experiment may take place is usually done by mentioning the
events one by one, multiplication rule, permutation, and combination.

!| ¬-1G /1 12G--3-1G/1-4/1-

Mentioning the events one by one is the simplest understandable


way to determine the number of ways an experiment may take place.

+| ¬0G c .G /1 0-


Determining the number of ways of an experiment can always be
done by mentioning the event one by one. However, we will get q problem
if the vents are quite a lot. Quite a lot of Events can be solved faster by
multiplication rule.

. 
   

 5

Rhonda is going to attend a Valentine party. Now, she is preparing


her clothing. Rhonda has four dresses and three pairs of shoes. She is
going to pick one of them to be worn at the party. In how many different
ways could Rhonda pick her clothing?

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.

Anyway, we can easily answer the question by using this following


scheme.

   

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  

6| c- ¬0GG /1


ronsider the following illustration!
Several people of Intermath µ09 went to watch a movie in an XXI
studio. Each one got a ticket in row F. Fani got F6, Tya got F7, Riska got
F8, Yola got F9, Nurina got F10, Olive got F11, and Dian got F12.
rertainly, the order of the people was different.
The arrangement of the people by paying attention to the order is called


 .

 | 
1

 
The multiplication of n natural number in a set beginning from 1
is called factorial n and notated by n!. Thereby, factorial n is defined as
follows:
59!+88 :+ :! 

|
|
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


In general can be written that :

|
|
c  c  
÷ 
|
G     t 
l t ti     lt t t
t i iil lt  iil lt    t i :
§
 |
§ §

Ê | Ê
 
G    li l t ti lt¶   t 
l
t ti  ltt Br   :
BrrBBrBrrBrB
 li l t ti    lt i t  t   
   t  i t i l   t  t
 li l t    ll
 l i  t  il i  t t t   l lt   t t  i
li l t tiBrBr rB  l
i 
i rBBrrB  lt t 
 li l t ti  ltt Bri !"#!
 lit 
itt$
G  li l t ti  lti :

c || |

† |   G 
  t  jt  i
i  t   i  t i t t i 
 ll  i ti G i  i  i t  t ti
 t  
 tt %&  l   
   it ltt B r
 t ti t   t Br  rB  i t Bt i 
i ti t   t  Br  rB  t      t 
i ti t t
G  i ti  6t i t '  t tii 
itt
r6| 
G  l i i:



 |   G  - - G

|
|
c c  
 ÷ 
|
In an experiment,  #
is the result that we are interested in.
The probability of an event {, written ({), is defined as

!|   -#


 

There will always be a result in each experiment. The set of all


results that might happen in an experiment is called   , and it
is notated by S. Each member in the sample space S is called sample point.
An #
is a sub set of sample space and is defined as the set of results
obtained in an experiment.

-

Determine the sample space of the experiment of tossing a coin


once.

 
 

The possible outcomes is a head (H) or a tail (T).

So, the sample space S = {H, T}

+| -
c $$


One way to find the probability of an event is to conduct an


experiment.
D 
A bag contains 10 red marbles, 8 blue marbles and 2 yellow
marbles. Find the experimental probability of getting a blue marble.

 
Take a marble from the bag. Record the color and return the
marble. Repeat a few times (maybe 10 times). rount the number of times
a blue marble was picked (Suppose it is 6).
The experimental probability of getting a blue marble from the bag
is

|
|
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 l G  t    lt 
)
G   tt l ( l G  t  tt lt 
(



 | -;-G-  -< - 
 t  * il t  t li ti& t tii t 
 lt  i lititi   ilt t llt t ¶  il 
 il
ti  t & t i & t ti
 
 l   iilit/  iliti t  t t
   & iti  itti  t  l  
 ilit   + t      & it i  +  t  & t
 +ti :

 D ||c|||


D |||
 
t 
 i"((ti  
 ti 
& tt  i ,


6||

|
|
c  c  
÷ 
|
+/, "((
%-+&/,&"((.(
i  ii t 
"((ti t 
& t i, 
.(ti 

 |    - - G
 t
t    t t 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 tti  tilli  l i  ll lt
t i t t¶
 ¶i   lttt t  ll
i li :



%t   iti  it t:




|
|
c  c  
÷ 
|
 ¶i  lttt  li :



 | G-;--- G
Dt   
 Ê Êi  t   t  t t 
ti% &  li 
t   i it     t il  i t
t tt    t il  tt  tiiil li  il
t 
    i
   l    
 t t  t  
G  t   t ll&l it 
 {    t ll &l i t  t  t   ilit
 { i t   ilit   ii {/ 
G t  B  llt ll&l ii :




 t t  B t ll&l it :

{ !{ " 



o |  -- - G-- G
Dt  ÊÊÊ i  t  t    t  t
tt  t   t % &  li  t 
  i  
it t i t t
t t  ltt
t i
 {    i t t  t  t   ilit
 { i t   ilit   ii { 
{
 !{  


† |  G -- G
 G   ilit    t i i t t t 
t  l i  ll  
- Ê 

|
|
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

6c 6" #


 
=.  
    # $  
›| G     


*  
    # 
$ 
>| c #
 
  
 
G   

  
  
 
 



 


 
     

 

G   
  $  

 G      #  $  
  6  
 
  "
      



 
   
 
  "
    #  $ 





 
   
   "   
   
  
  $ 
  
 

    
  $  G "    >"

    
  $  
 $   $  

 

 

  

  "


  


 
 
| . 
  $  
-!

A dice and a coin are thrown simultaneously. In how many different


ways may the results happen?

 
 

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  
÷ 
|
-
Ê#

% itRill t llit



 %Rill
tB - ll t llit 
 -
  
  t '
 itB - llt  Rill 

 #

B t & l  tiit  tit  t


'ti
 i Rill  B  - ll    
  t  it l
 G 
 ilt  " "t  
 

i  t '  itB - llt  Rilli ,
 

 
Ê

-
Ê#
li * it  "t  -
 
  li
  i  it  
t  0
lti:
%&  lt   it  BBB"B* t t t   
r r r"   t   ti  i  
  tii t  t  
 t  lt
i   il  i :

 r r r"

B Br Br Br"


B Br Br Br"
B" B"r B"r B"r"
B* B*r B*r B*r"

t  
 li 
   it t  i 
 

|
|
c  c  
÷ 
|
t &  lt t 
it  ti i  'it 
ll
i  
 it G  
*
  "
 

G    
  li  
   it  t    *"
 

 

-
Ê#

G  i t   l t      t ll i t



  
lt1  t llit 
   t it 

   1 t i 


 -
 i t
  
t ' lt 0

 #

G  
 t t t ' lt 

&"/"&*
 )
 

-
Êo#

2ti t  t       t  iit  t t       t 


iit " *i :

| G   iit 

| G   iit t

|
|
c c  
 ÷ 
|
 
 

a. The usage of digit may recur

   G  0 


4 ways 4 ways 4 ways

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

b. The usage of digit may not recur

   G  0 


4 ways 3 ways 2 ways

Thus, the amount of numbers that can be arranged

= 4 x 3 x 2 = 24 numbers

The hundreds box can be filled by 1, 2, 3, 4 (4 ways). Since the usage of


digit may not recur, then one digit which has been placed in the hundreds box may
not occupy the tens and unit boxes. For example the hundreds box has been filled
by 1, so the tens box can only be filled by 2, 3, 4 (3 ways). Suppose the tens box
is filled by 2, then the unit box can only be filled by 3 and 4 (2 ways).

c

 

 
 6


 66
-!

How many permutations are there from a group of 7 letters, a, b, c, d, e, f,


and g if we take 3 letters at a time? (Permutation 3 of 7 letters)

 
 

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" 3ltt i :

3"34,4.(


t  lt  &  i ti lt ti  ll
:

-
Ê#

ili ,t %  l ititt ili


-
 
  t itt ilit  i t 0

 #

, '*

t  i t t  itt ilii   ",(


 

-
Êo#
li  l ti 
it t ltt  t   illtt  Br2 
D 
   i t t ti    t   ltt       i   ltt i 
 t 0
© 

$Ê
$#

|
|
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 60 different permutations for the license plate.


D  
In how many ways can a president, a treasurer and a secretary be chosen from
among 7 candidates?
©  6
0    
For the first position, there are 7 possible choices. After that candidate is chosen,
there are 6 possible choices. Finally, there are 5 possible choices.
7 × 6 × 5 = 210
0  

  
The problem involves 7 candidates 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   iit t t  tit 
i 
 i :
"&/&",&/&,*
| B   t      iit     t   tit    
i 
 i :
"&/&""&/&"3

-
Ê#

2ti t  t    


i   i t   t  iit  t t   
  " *i t   iit :

| 2 t

| M 

 #

ti '
 t  tit tt   "iit  *  il liit 
ill
  t  t t* '"

it   iit  tt t  t   "iit 
  *  il liit  ti  ll
:

 

 i t      iit     t  t  t       " iit 
  *  il liit   t  i t ti

|
|
c  c  
÷ 
|
Ê
% Ê&Ê
Ê'
ÊÊÊ 

-
Ê#

-
   t ti    t  ltt        t  ltt    t 

B B0

 #

 t B i t lB Bt 


t:

-
 it t
B  li't 
itt ii 
 i:

t     t ti    " ltt   t 


 B B i  " t ti 
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#

%. ll " t   t l tt


 l-
 
  
t tt  i ll ti l0

 #

." 

t  i ll  ti li(


 


Ê


-
Ê#
 %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 iit it iΠt 
   
ii0
© 


|
|
c c  
 ÷ 
|
There are 10 digits to be taken 5 at a time.
a) Using the formula:

The chances of winning are 1 out of 252.


b) Since the order matters, we should use permutation instead of combination.
P(10, 5) = 10 x 9 x 8 x 7 x 6 = 30240
The chances of winning are 1 out of 30240.

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:

The coach can choose the swimmers in 10 ways.



c $$
/  -#

-!
When a fair dice is thrown, what is the probability of getting?
a) The number 5
b) A number that is a multiple of 3
c) A number that is greater than 6
d) A number that is less than 7
©  6
A  die is an unbiased die where each of the six numbers is '  to
turn up.
© = {1, 2, 3, 4, 5, 6}
a) Let { = event of getting the number 5 = {5}
Let n({) = number of outcomes in event { = 1

|
|
c c  
 ÷ 
|
n(©) = number of outcomes in © = 6

b) Let  = event of getting a multiple of 3


Multiple of 3 = {3, 6}

c) Let  = event of getting a number greater than 6


There is no number greater than 6 in the sample space ©
 ={}

A probability of a means the event will # occur.


d) Let ñ = event of getting a number less than 7
Numbers less than 7 = {1, 2, 3, 4, 5, 6}

A probability of ! means the event will  occur.


-+
Each of the letters HELLO is written on a card. A card is chosen at random from
the bag. What is the probability of getting the letter µL ?
 
 
Since the card is    
, it means that each card has the same chance
of being selected.
S = {H, E, L 1, L 2, O} There are two cards with the letter µL
Let A = event of getting the letter µL = {L 1, L 2}

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  
÷ 
|

-ÊÊ

 
-
Ê#

   t i  (   l  ) l  l    ll


  l  %i t 
& it l  ilit tti l l

 #

G '  l t  

Rt l tt  l

R  t  
ti  (ti 

rtt  ti  l l


 i'  iti ,

G & it l  ilit tti l l t  i 

-Ê Ê Ê'Ê
-
Ê#
 
t  i"((ti  
 ti 
& tt  i , 

 #




i  ii t "((ti t 
& t i, 
.(ti 

-
Ê#
 
t 
 i"((ti  
 ti 
& tt  i , 

 #
+/, "((
%-+&/,&"((.(
i  ii t 
"((ti t 
& 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

The probability that the number chosen is not a perfect square is



-+
.
What is the probability of not getting a white ball?

  

D  
The probabilities of three teams A, B and r winning a badminton competition are

ralculate the probability that


a) Either A or B will win
b) Either A or B or r will win
c) None of these teams will win
d) Neither A nor B will win

|
|
c  c  
÷ 
|
© 





ill
i7Br
ill
i
it B
ill
i7it B
ill
i

 
-&Ê-&Ê 
D  
Πti t   ilit  i 
i  .0


© 







-
Ê#

G  t  ll   


it ll i &G
 ll  t ' 
t &2tit   ilitt tt  ll  it  l!

 #

G
 ll  t ':

G
 ll  it  lt  t tt
 ll t

it ll 

|
|
c  c  
÷ 
|
:

:

i B t ll&l it :

t   ilitt tt  ll  it  li 

ÊÊÊ Ê&Ê 

D  
G
 t      
it   ltt        ll
  l  it   t
  



   l i'     %it   ilitt t:
  i't ltt 81¶ 8R¶
Bt ltt  8 ¶
Bt ltt  
l 
© 

|  ilitt t  i'1 R

|  ilitt tt ltt   

|  ilitt tt ltt  


l 


D !" #
  ii t 
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 i tii .

tBtt l t
ii  tt 5

 ilt   B:...,

























|
|
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:

1.| 3 letters at a time


2.| 2 letters at a time
3.| 1 letter at a time
3 letters at a time 2 letters at a time 1 letter at a time
n= k= n= k= n= k=
rounting one | ABr | AB | A
by one | ´. | ´. | ´.
| ´. | ´. | ´.
| ´. | ´.
| ´. | ´.
| ´. | ´.

So, the total of So, the total of So, the total of


permutation is ´ permutation is ´ permutation is ´

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)= Ô
 

|
|

Anda mungkin juga menyukai