SlideShare a Scribd company logo
1 of 53
Download to read offline
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
 The difference is the number of ways the first object can be placed.
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
  The first object has a choice of 6 positions
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
  The first object has a choice of 6 positions
 Circle
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
  The first object has a choice of 6 positions
 Circle
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
  The first object has a choice of 6 positions
 Circle
                              In a circle there is no definite start or
                              finish of the circle.
Permutations
Case 4: Ordered Sets of n Objects, Arranged in a Circle
 What is the difference between placing objects in a line and placing
 objects in a circle?
  The difference is the number of ways the first object can be placed.
 Line



  In a line there is a definite start and finish of the line.
  The first object has a choice of 6 positions
 Circle
                              In a circle there is no definite start or
                              finish of the circle.
                              It is not until the first object chooses its
                              position that positions are defined.
Line




Circle
Line
           possibilities
           for object 1
Number of Arrangements  n

Circle
          possibilities
           for object 1
Number of Arrangements  1
Line                     possibilities
          possibilities for object 2
           for object 1
Number of Arrangements  n  n  1

Circle                  possibilities
          possibilities for object 2
          for object 1
Number of Arrangements  1  n  1
Line                      possibilities
          possibilities for object 2 possibilities
           for object 1                  for object 3

Number of Arrangements  n  n  1  n  2 

Circle                    possibilities
          possibilities for object 2 possibilities
          for object 1                   for object 3

Number of Arrangements  1  n  1  n  2 
Line                       possibilities
          possibilities for object 2 possibilities possibilities
           for object 1                  for object 3
                                                       for last object
Number of Arrangements  n  n  1  n  2    1

Circle                    possibilities
          possibilities for object 2 possibilities possibilities
          for object 1                   for object 3
                                                       for last object
Number of Arrangements  1  n  1  n  2    1
Line                       possibilities
          possibilities for object 2 possibilities possibilities
           for object 1                  for object 3
                                                       for last object
Number of Arrangements  n  n  1  n  2    1

Circle                    possibilities
          possibilities for object 2 possibilities possibilities
          for object 1                   for object 3
                                                       for last object
Number of Arrangements  1  n  1  n  2    1


                                                   n!
              Number of Arrangements in a circle 
                                                   n
Line                       possibilities
          possibilities for object 2 possibilities possibilities
           for object 1                  for object 3
                                                       for last object
Number of Arrangements  n  n  1  n  2    1

Circle                    possibilities
          possibilities for object 2 possibilities possibilities
          for object 1                   for object 3
                                                       for last object
Number of Arrangements  1  n  1  n  2    1


                                                   n!
              Number of Arrangements in a circle 
                                                   n
                                                 n  1!
e.g. A meeting room contains a round table surrounded by ten
     chairs.
    (i) A committee of ten people includes three teenagers. How
        many arrangements are there in which all three sit
        together?
e.g. A meeting room contains a round table surrounded by ten
     chairs.
    (i) A committee of ten people includes three teenagers. How
        many arrangements are there in which all three sit
        together?

  the number of ways the
   three teenagers can be
          arranged

     Arrangements  3!
e.g. A meeting room contains a round table surrounded by ten
     chairs.
    (i) A committee of ten people includes three teenagers. How
        many arrangements are there in which all three sit
        together?

  the number of ways the
   three teenagers can be           number of ways of arranging
          arranged                       8 objects in a circle
                                       (3 teenagers)  7 others
     Arrangements  3!  7!
e.g. A meeting room contains a round table surrounded by ten
     chairs.
    (i) A committee of ten people includes three teenagers. How
        many arrangements are there in which all three sit
        together?

  the number of ways the
   three teenagers can be           number of ways of arranging
          arranged                       8 objects in a circle
                                       (3 teenagers)  7 others
     Arrangements  3!  7!
                   30240
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!

     President can
    sit anywhere
    as they are 1st
     in the circle

   Ways (restrictions)  1
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
                        Secretary must
     President can
                         sit opposite
    sit anywhere
                          President
    as they are 1st
     in the circle

   Ways (restrictions)  1 1
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
                         Secretary must
    President can
                          sit opposite
    sit anywhere
                           President
    as they are 1st
                                       Ways remaining
      in the circle
                                         people can go
   Ways (restrictions)  1 1  8!
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
                         Secretary must
    President can
                          sit opposite
    sit anywhere
                           President
    as they are 1st
                                       Ways remaining
      in the circle
                                         people can go
   Ways (restrictions)  1 1  8!

                          11 8!
     PP & S opposite  
                            9!
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
                         Secretary must
    President can
                          sit opposite
    sit anywhere
                           President
    as they are 1st
                                       Ways remaining
      in the circle
                                         people can go
   Ways (restrictions)  1 1  8!

                          11 8!
     PP & S opposite  
                            9!
                          1
                       
                          9
(ii) Elections are held for Chairperson and Secretary.
     What is the probability that they are seated directly opposite each
     other?
    Ways (no restrictions)  9!
                         Secretary must
    President can
                          sit opposite
    sit anywhere
                           President
    as they are 1st
                                       Ways remaining
      in the circle
                                         people can go
                                                   Note: of 9 seats only
   Ways (restrictions)  1 1  8!
                                                     1 is opposite the
                                                         President
                          11 8!                    Popposite  
                                                                     1
     PP & S opposite  
                            9!                                       9
                          1                          Sometimes simple
                                                   logic is quicker!!!!
                          9
2002 Extension 1 HSC Q3a)
Seven people are to be seated at a round table
(i) How many seating arrangements are possible?
2002 Extension 1 HSC Q3a)
Seven people are to be seated at a round table
(i) How many seating arrangements are possible?
    Arrangements  6!
2002 Extension 1 HSC Q3a)
Seven people are to be seated at a round table
(i) How many seating arrangements are possible?
    Arrangements  6!
                  720
2002 Extension 1 HSC Q3a)
Seven people are to be seated at a round table
(i) How many seating arrangements are possible?
     Arrangements  6!
                   720

(ii) Two people, Kevin and Jill, refuse to sit next to each other. How
     many seating arrangements are then possible?
2002 Extension 1 HSC Q3a)
Seven people are to be seated at a round table
(i) How many seating arrangements are possible?
     Arrangements  6!
                   720

(ii) Two people, Kevin and Jill, refuse to sit next to each other. How
     many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
2002 Extension 1 HSC Q3a)
 Seven people are to be seated at a round table
 (i) How many seating arrangements are possible?
      Arrangements  6!
                    720

 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How
      many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
  the number of ways
Kevin & Jill are together

   Arrangements  2!
2002 Extension 1 HSC Q3a)
 Seven people are to be seated at a round table
 (i) How many seating arrangements are possible?
      Arrangements  6!
                    720

 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How
      many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
  the number of ways         number of ways of arranging
Kevin & Jill are together          6 objects in a circle
                                 (Kevin & Jill)  5 others
    Arrangements  2!  5!
2002 Extension 1 HSC Q3a)
 Seven people are to be seated at a round table
 (i) How many seating arrangements are possible?
      Arrangements  6!
                    720

 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How
      many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
  the number of ways         number of ways of arranging
Kevin & Jill are together          6 objects in a circle
                                 (Kevin & Jill)  5 others
    Arrangements  2!  5!
                    240
2002 Extension 1 HSC Q3a)
 Seven people are to be seated at a round table
 (i) How many seating arrangements are possible?
      Arrangements  6!
                    720

 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How
      many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
  the number of ways         number of ways of arranging
Kevin & Jill are together          6 objects in a circle
                                 (Kevin & Jill)  5 others
    Arrangements  2!  5!
                    240           Arrangements  720  240
                                                    480
2002 Extension 1 HSC Q3a)
 Seven people are to be seated at a round table
 (i) How many seating arrangements are possible?
      Arrangements  6!
                    720

 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How
      many seating arrangements are then possible?
Note: it is easier to work out the number of ways Kevin and Jill are
together and subtract from total number of arrangements.
  the number of ways         number of ways of arranging
Kevin & Jill are together          6 objects in a circle
                                 (Kevin & Jill)  5 others
    Arrangements  2!  5!
                    240           Arrangements  720  240
                                                    480
1995 Extension 1 HSC Q3a)
   A       B        C       D       E       F        G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
1995 Extension 1 HSC Q3a)
   A       B        C       D       E       F        G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
                                        With replacement
                                   Use Basic Counting Principle
1995 Extension 1 HSC Q3a)
   A        B        C      D       E       F        G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
                                   Use Basic Counting Principle
1995 Extension 1 HSC Q3a)
   A        B        C      D       E       F        G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
              512                 Use Basic Counting Principle
1995 Extension 1 HSC Q3a)
   A        B        C      D       E        F       G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
              512                 Use Basic Counting Principle

(ii) How many different codes are possible if letters cannot be
     repeated and their order is important?
1995 Extension 1 HSC Q3a)
   A        B        C      D       E        F       G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
              512                 Use Basic Counting Principle

(ii) How many different codes are possible if letters cannot be
     repeated and their order is important?

                                         Without replacement
                                          Order is important
                                             Permutation
1995 Extension 1 HSC Q3a)
   A        B        C      D       E        F       G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
              512                 Use Basic Counting Principle

(ii) How many different codes are possible if letters cannot be
     repeated and their order is important?

        Codes 8P3                       Without replacement
                                          Order is important
                                             Permutation
1995 Extension 1 HSC Q3a)
   A        B        C      D       E        F       G       H
A security lock has 8 buttons labelled as shown. Each person using
the lock is given a 3 letter code.
(i) How many different codes are possible if letters can be repeated
    and their order is important?
       Codes  8  8  8                With replacement
              512                 Use Basic Counting Principle

(ii) How many different codes are possible if letters cannot be
     repeated and their order is important?

        Codes 8P3                       Without replacement
               336                       Order is important
                                             Permutation
(iii) Now suppose that the lock operates by holding 3 buttons down
      together, so that the order is NOT important.
      How many different codes are possible?
(iii) Now suppose that the lock operates by holding 3 buttons down
      together, so that the order is NOT important.
      How many different codes are possible?

                                           Without replacement
                                           Order is not important
                                               Combination
(iii) Now suppose that the lock operates by holding 3 buttons down
      together, so that the order is NOT important.
      How many different codes are possible?

           Codes 8C3                      Without replacement
                                           Order is not important
                                               Combination
(iii) Now suppose that the lock operates by holding 3 buttons down
      together, so that the order is NOT important.
      How many different codes are possible?

           Codes 8C3                      Without replacement
                                           Order is not important
                  56
                                               Combination
(iii) Now suppose that the lock operates by holding 3 buttons down
      together, so that the order is NOT important.
      How many different codes are possible?

           Codes 8C3                        Without replacement
                                             Order is not important
                  56
                                                 Combination




                        Exercise 10I; odds

More Related Content

Viewers also liked

11 x1 t04 07 3d trigonometry (2012)
11 x1 t04 07 3d trigonometry (2012)11 x1 t04 07 3d trigonometry (2012)
11 x1 t04 07 3d trigonometry (2012)
Nigel Simmons
 
11X1 T07 05 t results (2011)
11X1 T07 05 t results (2011)11X1 T07 05 t results (2011)
11X1 T07 05 t results (2011)
Nigel Simmons
 
11X1 T06 06 line through pt of intersection
11X1 T06 06 line through pt of intersection11X1 T06 06 line through pt of intersection
11X1 T06 06 line through pt of intersection
Nigel Simmons
 
X2 T07 05 powers of functions (2011)
X2 T07 05 powers of functions (2011)X2 T07 05 powers of functions (2011)
X2 T07 05 powers of functions (2011)
Nigel Simmons
 
11X1 T05 01 permutations I (2011)
11X1 T05 01 permutations I (2011)11X1 T05 01 permutations I (2011)
11X1 T05 01 permutations I (2011)
Nigel Simmons
 
11X1 T09 05 product rule (2011)
11X1 T09 05 product rule (2011)11X1 T09 05 product rule (2011)
11X1 T09 05 product rule (2011)
Nigel Simmons
 
11X1 T06 05 perpendicular distance (2011)
11X1 T06 05 perpendicular distance (2011)11X1 T06 05 perpendicular distance (2011)
11X1 T06 05 perpendicular distance (2011)
Nigel Simmons
 
11X1 T16 05 volumes (2011)
11X1 T16 05 volumes (2011)11X1 T16 05 volumes (2011)
11X1 T16 05 volumes (2011)
Nigel Simmons
 
12X1 T05 05 integration with inverse trig (2011)
12X1 T05 05 integration with inverse trig (2011)12X1 T05 05 integration with inverse trig (2011)
12X1 T05 05 integration with inverse trig (2011)
Nigel Simmons
 
11 x1 t02 06 relations & functions (2012)
11 x1 t02 06 relations & functions (2012)11 x1 t02 06 relations & functions (2012)
11 x1 t02 06 relations & functions (2012)
Nigel Simmons
 
X2 T03 05 rectangular hyperbola (2011)
X2 T03 05 rectangular hyperbola (2011)X2 T03 05 rectangular hyperbola (2011)
X2 T03 05 rectangular hyperbola (2011)
Nigel Simmons
 
X2 T01 05 de moivres theorem (2011)
X2 T01 05 de moivres theorem (2011)X2 T01 05 de moivres theorem (2011)
X2 T01 05 de moivres theorem (2011)
Nigel Simmons
 
11X1 T10 03 second derivative (2011)
11X1 T10 03 second derivative (2011)11X1 T10 03 second derivative (2011)
11X1 T10 03 second derivative (2011)
Nigel Simmons
 
11X1 T03 05 regions in the plane (2011)
11X1 T03 05 regions in the plane (2011)11X1 T03 05 regions in the plane (2011)
11X1 T03 05 regions in the plane (2011)
Nigel Simmons
 
12X1 T08 02 general binomial expansions (2011)
12X1 T08 02 general binomial expansions (2011)12X1 T08 02 general binomial expansions (2011)
12X1 T08 02 general binomial expansions (2011)
Nigel Simmons
 
11X1 T14 06 sum of a geometric series (2011)
11X1 T14 06 sum of a geometric series (2011)11X1 T14 06 sum of a geometric series (2011)
11X1 T14 06 sum of a geometric series (2011)
Nigel Simmons
 
12X1 T03 04 integrating trig (2011)
12X1 T03 04 integrating trig (2011)12X1 T03 04 integrating trig (2011)
12X1 T03 04 integrating trig (2011)
Nigel Simmons
 
11X1 T13 02 angle theorems 1 (2011)
11X1 T13 02 angle theorems 1 (2011)11X1 T13 02 angle theorems 1 (2011)
11X1 T13 02 angle theorems 1 (2011)
Nigel Simmons
 
11 x1 t14 12 applications of ap & gp (2013)
11 x1 t14 12 applications of ap & gp (2013)11 x1 t14 12 applications of ap & gp (2013)
11 x1 t14 12 applications of ap & gp (2013)
Nigel Simmons
 
X2 t02 04 forming polynomials (2012)
X2 t02 04 forming polynomials (2012)X2 t02 04 forming polynomials (2012)
X2 t02 04 forming polynomials (2012)
Nigel Simmons
 

Viewers also liked (20)

11 x1 t04 07 3d trigonometry (2012)
11 x1 t04 07 3d trigonometry (2012)11 x1 t04 07 3d trigonometry (2012)
11 x1 t04 07 3d trigonometry (2012)
 
11X1 T07 05 t results (2011)
11X1 T07 05 t results (2011)11X1 T07 05 t results (2011)
11X1 T07 05 t results (2011)
 
11X1 T06 06 line through pt of intersection
11X1 T06 06 line through pt of intersection11X1 T06 06 line through pt of intersection
11X1 T06 06 line through pt of intersection
 
X2 T07 05 powers of functions (2011)
X2 T07 05 powers of functions (2011)X2 T07 05 powers of functions (2011)
X2 T07 05 powers of functions (2011)
 
11X1 T05 01 permutations I (2011)
11X1 T05 01 permutations I (2011)11X1 T05 01 permutations I (2011)
11X1 T05 01 permutations I (2011)
 
11X1 T09 05 product rule (2011)
11X1 T09 05 product rule (2011)11X1 T09 05 product rule (2011)
11X1 T09 05 product rule (2011)
 
11X1 T06 05 perpendicular distance (2011)
11X1 T06 05 perpendicular distance (2011)11X1 T06 05 perpendicular distance (2011)
11X1 T06 05 perpendicular distance (2011)
 
11X1 T16 05 volumes (2011)
11X1 T16 05 volumes (2011)11X1 T16 05 volumes (2011)
11X1 T16 05 volumes (2011)
 
12X1 T05 05 integration with inverse trig (2011)
12X1 T05 05 integration with inverse trig (2011)12X1 T05 05 integration with inverse trig (2011)
12X1 T05 05 integration with inverse trig (2011)
 
11 x1 t02 06 relations & functions (2012)
11 x1 t02 06 relations & functions (2012)11 x1 t02 06 relations & functions (2012)
11 x1 t02 06 relations & functions (2012)
 
X2 T03 05 rectangular hyperbola (2011)
X2 T03 05 rectangular hyperbola (2011)X2 T03 05 rectangular hyperbola (2011)
X2 T03 05 rectangular hyperbola (2011)
 
X2 T01 05 de moivres theorem (2011)
X2 T01 05 de moivres theorem (2011)X2 T01 05 de moivres theorem (2011)
X2 T01 05 de moivres theorem (2011)
 
11X1 T10 03 second derivative (2011)
11X1 T10 03 second derivative (2011)11X1 T10 03 second derivative (2011)
11X1 T10 03 second derivative (2011)
 
11X1 T03 05 regions in the plane (2011)
11X1 T03 05 regions in the plane (2011)11X1 T03 05 regions in the plane (2011)
11X1 T03 05 regions in the plane (2011)
 
12X1 T08 02 general binomial expansions (2011)
12X1 T08 02 general binomial expansions (2011)12X1 T08 02 general binomial expansions (2011)
12X1 T08 02 general binomial expansions (2011)
 
11X1 T14 06 sum of a geometric series (2011)
11X1 T14 06 sum of a geometric series (2011)11X1 T14 06 sum of a geometric series (2011)
11X1 T14 06 sum of a geometric series (2011)
 
12X1 T03 04 integrating trig (2011)
12X1 T03 04 integrating trig (2011)12X1 T03 04 integrating trig (2011)
12X1 T03 04 integrating trig (2011)
 
11X1 T13 02 angle theorems 1 (2011)
11X1 T13 02 angle theorems 1 (2011)11X1 T13 02 angle theorems 1 (2011)
11X1 T13 02 angle theorems 1 (2011)
 
11 x1 t14 12 applications of ap & gp (2013)
11 x1 t14 12 applications of ap & gp (2013)11 x1 t14 12 applications of ap & gp (2013)
11 x1 t14 12 applications of ap & gp (2013)
 
X2 t02 04 forming polynomials (2012)
X2 t02 04 forming polynomials (2012)X2 t02 04 forming polynomials (2012)
X2 t02 04 forming polynomials (2012)
 

More from Nigel Simmons

12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)
Nigel Simmons
 
11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)
Nigel Simmons
 
11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)
Nigel Simmons
 
12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)
Nigel Simmons
 
11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)
Nigel Simmons
 
12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)
Nigel Simmons
 
12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)
Nigel Simmons
 
12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)
Nigel Simmons
 
X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)
Nigel Simmons
 
X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)
Nigel Simmons
 
X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)
Nigel Simmons
 
X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)
Nigel Simmons
 
11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)
Nigel Simmons
 
11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)
Nigel Simmons
 
11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)
Nigel Simmons
 
11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)
Nigel Simmons
 
11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)
Nigel Simmons
 
11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)
Nigel Simmons
 

More from Nigel Simmons (20)

Goodbye slideshare UPDATE
Goodbye slideshare UPDATEGoodbye slideshare UPDATE
Goodbye slideshare UPDATE
 
Goodbye slideshare
Goodbye slideshareGoodbye slideshare
Goodbye slideshare
 
12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)12 x1 t02 02 integrating exponentials (2014)
12 x1 t02 02 integrating exponentials (2014)
 
11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)11 x1 t01 03 factorising (2014)
11 x1 t01 03 factorising (2014)
 
11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)11 x1 t01 02 binomial products (2014)
11 x1 t01 02 binomial products (2014)
 
12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)12 x1 t02 01 differentiating exponentials (2014)
12 x1 t02 01 differentiating exponentials (2014)
 
11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)11 x1 t01 01 algebra & indices (2014)
11 x1 t01 01 algebra & indices (2014)
 
12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)12 x1 t01 03 integrating derivative on function (2013)
12 x1 t01 03 integrating derivative on function (2013)
 
12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)12 x1 t01 02 differentiating logs (2013)
12 x1 t01 02 differentiating logs (2013)
 
12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)12 x1 t01 01 log laws (2013)
12 x1 t01 01 log laws (2013)
 
X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)X2 t02 04 forming polynomials (2013)
X2 t02 04 forming polynomials (2013)
 
X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)X2 t02 03 roots & coefficients (2013)
X2 t02 03 roots & coefficients (2013)
 
X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)X2 t02 02 multiple roots (2013)
X2 t02 02 multiple roots (2013)
 
X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)X2 t02 01 factorising complex expressions (2013)
X2 t02 01 factorising complex expressions (2013)
 
11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)11 x1 t16 07 approximations (2013)
11 x1 t16 07 approximations (2013)
 
11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)11 x1 t16 06 derivative times function (2013)
11 x1 t16 06 derivative times function (2013)
 
11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)11 x1 t16 05 volumes (2013)
11 x1 t16 05 volumes (2013)
 
11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)11 x1 t16 04 areas (2013)
11 x1 t16 04 areas (2013)
 
11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)11 x1 t16 03 indefinite integral (2013)
11 x1 t16 03 indefinite integral (2013)
 
11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)11 x1 t16 02 definite integral (2013)
11 x1 t16 02 definite integral (2013)
 

Recently uploaded

Recently uploaded (20)

PANDITA RAMABAI- Indian political thought GENDER.pptx
PANDITA RAMABAI- Indian political thought GENDER.pptxPANDITA RAMABAI- Indian political thought GENDER.pptx
PANDITA RAMABAI- Indian political thought GENDER.pptx
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)
 
AIM of Education-Teachers Training-2024.ppt
AIM of Education-Teachers Training-2024.pptAIM of Education-Teachers Training-2024.ppt
AIM of Education-Teachers Training-2024.ppt
 
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - EnglishGraduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
 
Introduction to TechSoup’s Digital Marketing Services and Use Cases
Introduction to TechSoup’s Digital Marketing  Services and Use CasesIntroduction to TechSoup’s Digital Marketing  Services and Use Cases
Introduction to TechSoup’s Digital Marketing Services and Use Cases
 
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptxCOMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
OS-operating systems- ch05 (CPU Scheduling) ...
OS-operating systems- ch05 (CPU Scheduling) ...OS-operating systems- ch05 (CPU Scheduling) ...
OS-operating systems- ch05 (CPU Scheduling) ...
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
What is 3 Way Matching Process in Odoo 17.pptx
What is 3 Way Matching Process in Odoo 17.pptxWhat is 3 Way Matching Process in Odoo 17.pptx
What is 3 Way Matching Process in Odoo 17.pptx
 
REMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptxREMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptx
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
dusjagr & nano talk on open tools for agriculture research and learning
dusjagr & nano talk on open tools for agriculture research and learningdusjagr & nano talk on open tools for agriculture research and learning
dusjagr & nano talk on open tools for agriculture research and learning
 
Details on CBSE Compartment Exam.pptx1111
Details on CBSE Compartment Exam.pptx1111Details on CBSE Compartment Exam.pptx1111
Details on CBSE Compartment Exam.pptx1111
 
Simple, Complex, and Compound Sentences Exercises.pdf
Simple, Complex, and Compound Sentences Exercises.pdfSimple, Complex, and Compound Sentences Exercises.pdf
Simple, Complex, and Compound Sentences Exercises.pdf
 
Play hard learn harder: The Serious Business of Play
Play hard learn harder:  The Serious Business of PlayPlay hard learn harder:  The Serious Business of Play
Play hard learn harder: The Serious Business of Play
 
Model Attribute _rec_name in the Odoo 17
Model Attribute _rec_name in the Odoo 17Model Attribute _rec_name in the Odoo 17
Model Attribute _rec_name in the Odoo 17
 

11X1 T05 05 arrangements in a circle (2011)

  • 1. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle?
  • 2. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed.
  • 3. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line
  • 4. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line
  • 5. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line.
  • 6. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line. The first object has a choice of 6 positions
  • 7. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line. The first object has a choice of 6 positions Circle
  • 8. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line. The first object has a choice of 6 positions Circle
  • 9. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line. The first object has a choice of 6 positions Circle In a circle there is no definite start or finish of the circle.
  • 10. Permutations Case 4: Ordered Sets of n Objects, Arranged in a Circle What is the difference between placing objects in a line and placing objects in a circle? The difference is the number of ways the first object can be placed. Line In a line there is a definite start and finish of the line. The first object has a choice of 6 positions Circle In a circle there is no definite start or finish of the circle. It is not until the first object chooses its position that positions are defined.
  • 12. Line possibilities for object 1 Number of Arrangements  n Circle possibilities for object 1 Number of Arrangements  1
  • 13. Line possibilities possibilities for object 2 for object 1 Number of Arrangements  n  n  1 Circle possibilities possibilities for object 2 for object 1 Number of Arrangements  1  n  1
  • 14. Line possibilities possibilities for object 2 possibilities for object 1 for object 3 Number of Arrangements  n  n  1  n  2  Circle possibilities possibilities for object 2 possibilities for object 1 for object 3 Number of Arrangements  1  n  1  n  2 
  • 15. Line possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2    1 Circle possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  1  n  1  n  2    1
  • 16. Line possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2    1 Circle possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  1  n  1  n  2    1 n! Number of Arrangements in a circle  n
  • 17. Line possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2    1 Circle possibilities possibilities for object 2 possibilities possibilities for object 1 for object 3 for last object Number of Arrangements  1  n  1  n  2    1 n! Number of Arrangements in a circle  n  n  1!
  • 18. e.g. A meeting room contains a round table surrounded by ten chairs. (i) A committee of ten people includes three teenagers. How many arrangements are there in which all three sit together?
  • 19. e.g. A meeting room contains a round table surrounded by ten chairs. (i) A committee of ten people includes three teenagers. How many arrangements are there in which all three sit together? the number of ways the three teenagers can be arranged Arrangements  3!
  • 20. e.g. A meeting room contains a round table surrounded by ten chairs. (i) A committee of ten people includes three teenagers. How many arrangements are there in which all three sit together? the number of ways the three teenagers can be number of ways of arranging arranged 8 objects in a circle (3 teenagers)  7 others Arrangements  3!  7!
  • 21. e.g. A meeting room contains a round table surrounded by ten chairs. (i) A committee of ten people includes three teenagers. How many arrangements are there in which all three sit together? the number of ways the three teenagers can be number of ways of arranging arranged 8 objects in a circle (3 teenagers)  7 others Arrangements  3!  7!  30240
  • 22. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other?
  • 23. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9!
  • 24. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! President can sit anywhere as they are 1st in the circle Ways (restrictions)  1
  • 25. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! Secretary must President can sit opposite sit anywhere President as they are 1st in the circle Ways (restrictions)  1 1
  • 26. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! Secretary must President can sit opposite sit anywhere President as they are 1st Ways remaining in the circle people can go Ways (restrictions)  1 1  8!
  • 27. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! Secretary must President can sit opposite sit anywhere President as they are 1st Ways remaining in the circle people can go Ways (restrictions)  1 1  8! 11 8! PP & S opposite   9!
  • 28. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! Secretary must President can sit opposite sit anywhere President as they are 1st Ways remaining in the circle people can go Ways (restrictions)  1 1  8! 11 8! PP & S opposite   9! 1  9
  • 29. (ii) Elections are held for Chairperson and Secretary. What is the probability that they are seated directly opposite each other? Ways (no restrictions)  9! Secretary must President can sit opposite sit anywhere President as they are 1st Ways remaining in the circle people can go Note: of 9 seats only Ways (restrictions)  1 1  8! 1 is opposite the President 11 8!  Popposite   1 PP & S opposite   9! 9 1 Sometimes simple  logic is quicker!!!! 9
  • 30. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible?
  • 31. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!
  • 32. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720
  • 33. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible?
  • 34. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements.
  • 35. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements. the number of ways Kevin & Jill are together Arrangements  2!
  • 36. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements. the number of ways number of ways of arranging Kevin & Jill are together 6 objects in a circle (Kevin & Jill)  5 others Arrangements  2!  5!
  • 37. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements. the number of ways number of ways of arranging Kevin & Jill are together 6 objects in a circle (Kevin & Jill)  5 others Arrangements  2!  5!  240
  • 38. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements. the number of ways number of ways of arranging Kevin & Jill are together 6 objects in a circle (Kevin & Jill)  5 others Arrangements  2!  5!  240 Arrangements  720  240  480
  • 39. 2002 Extension 1 HSC Q3a) Seven people are to be seated at a round table (i) How many seating arrangements are possible? Arrangements  6!  720 (ii) Two people, Kevin and Jill, refuse to sit next to each other. How many seating arrangements are then possible? Note: it is easier to work out the number of ways Kevin and Jill are together and subtract from total number of arrangements. the number of ways number of ways of arranging Kevin & Jill are together 6 objects in a circle (Kevin & Jill)  5 others Arrangements  2!  5!  240 Arrangements  720  240  480
  • 40.
  • 41. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important?
  • 42. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? With replacement Use Basic Counting Principle
  • 43. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement Use Basic Counting Principle
  • 44. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement  512 Use Basic Counting Principle
  • 45. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement  512 Use Basic Counting Principle (ii) How many different codes are possible if letters cannot be repeated and their order is important?
  • 46. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement  512 Use Basic Counting Principle (ii) How many different codes are possible if letters cannot be repeated and their order is important? Without replacement Order is important Permutation
  • 47. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement  512 Use Basic Counting Principle (ii) How many different codes are possible if letters cannot be repeated and their order is important? Codes 8P3 Without replacement Order is important Permutation
  • 48. 1995 Extension 1 HSC Q3a) A B C D E F G H A security lock has 8 buttons labelled as shown. Each person using the lock is given a 3 letter code. (i) How many different codes are possible if letters can be repeated and their order is important? Codes  8  8  8 With replacement  512 Use Basic Counting Principle (ii) How many different codes are possible if letters cannot be repeated and their order is important? Codes 8P3 Without replacement  336 Order is important Permutation
  • 49. (iii) Now suppose that the lock operates by holding 3 buttons down together, so that the order is NOT important. How many different codes are possible?
  • 50. (iii) Now suppose that the lock operates by holding 3 buttons down together, so that the order is NOT important. How many different codes are possible? Without replacement Order is not important Combination
  • 51. (iii) Now suppose that the lock operates by holding 3 buttons down together, so that the order is NOT important. How many different codes are possible? Codes 8C3 Without replacement Order is not important Combination
  • 52. (iii) Now suppose that the lock operates by holding 3 buttons down together, so that the order is NOT important. How many different codes are possible? Codes 8C3 Without replacement Order is not important  56 Combination
  • 53. (iii) Now suppose that the lock operates by holding 3 buttons down together, so that the order is NOT important. How many different codes are possible? Codes 8C3 Without replacement Order is not important  56 Combination Exercise 10I; odds