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

More from 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
 
11 x1 t16 01 area under curve (2013)
11 x1 t16 01 area under curve (2013)11 x1 t16 01 area under curve (2013)
11 x1 t16 01 area under curve (2013)Nigel Simmons
 
X2 t01 11 nth roots of unity (2012)
X2 t01 11 nth roots of unity (2012)X2 t01 11 nth roots of unity (2012)
X2 t01 11 nth roots of unity (2012)Nigel Simmons
 
X2 t01 10 complex & trig (2013)
X2 t01 10 complex & trig (2013)X2 t01 10 complex & trig (2013)
X2 t01 10 complex & trig (2013)Nigel Simmons
 
X2 t01 09 de moivres theorem
X2 t01 09 de moivres theoremX2 t01 09 de moivres theorem
X2 t01 09 de moivres theoremNigel Simmons
 

More from Nigel Simmons (20)

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)
 
11 x1 t16 01 area under curve (2013)
11 x1 t16 01 area under curve (2013)11 x1 t16 01 area under curve (2013)
11 x1 t16 01 area under curve (2013)
 
X2 t01 11 nth roots of unity (2012)
X2 t01 11 nth roots of unity (2012)X2 t01 11 nth roots of unity (2012)
X2 t01 11 nth roots of unity (2012)
 
X2 t01 10 complex & trig (2013)
X2 t01 10 complex & trig (2013)X2 t01 10 complex & trig (2013)
X2 t01 10 complex & trig (2013)
 
X2 t01 09 de moivres theorem
X2 t01 09 de moivres theoremX2 t01 09 de moivres theorem
X2 t01 09 de moivres theorem
 

Recently uploaded

Student login on Anyboli platform.helpin
Student login on Anyboli platform.helpinStudent login on Anyboli platform.helpin
Student login on Anyboli platform.helpinRaunakKeshri1
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docxPoojaSen20
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Sapana Sha
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...Marc Dusseiller Dusjagr
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesFatimaKhan178732
 
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfciinovamais
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104misteraugie
 
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991RKavithamani
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxheathfieldcps1
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationnomboosow
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionSafetyChain Software
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxmanuelaromero2013
 
Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17Celine George
 
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy ReformA Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy ReformChameera Dedduwage
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxiammrhaywood
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphThiyagu K
 

Recently uploaded (20)

Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
 
Student login on Anyboli platform.helpin
Student login on Anyboli platform.helpinStudent login on Anyboli platform.helpin
Student login on Anyboli platform.helpin
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docx
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and Actinides
 
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104
 
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991
Industrial Policy - 1948, 1956, 1973, 1977, 1980, 1991
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
 
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptxINDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communication
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
 
Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17
 
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy ReformA Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot Graph
 

12X1 T09 07 arrangements in a circle

  • 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