SlideShare a Scribd company logo
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
           possibilit ies
           for object 1
Number of Arrangements  n

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

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

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

Circle                   possibilit ies
          possibilit ies for object 2 possibilit ies
           for object 1                  for object 3

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

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

Circle                   possibilit ies
          possibilit ies for object 2 possibilit ies possibilit ies
           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                     possibilit ies
          possibilit ies for object 2 possibilit ies possibilit ies
           for object 1                  for object 3
                                                      for last object
Number of Arrangements  n  n  1  n  2 1

Circle                   possibilit ies
          possibilit ies for object 2 possibilit ies possibilit ies
           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

Goodbye slideshare
Goodbye slideshareGoodbye slideshare
Goodbye slideshare
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
 
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
 

More from Nigel Simmons (20)

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

Recently uploaded

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
siemaillard
 
The Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official PublicationThe Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official Publication
Delapenabediema
 
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER  FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...TESDA TM1 REVIEWER  FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
EugeneSaldivar
 
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp NetworkIntroduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
TechSoup
 
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
MysoreMuleSoftMeetup
 
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHatAzure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Scholarhat
 
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with MechanismOverview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
DeeptiGupta154
 
Operation Blue Star - Saka Neela Tara
Operation Blue Star   -  Saka Neela TaraOperation Blue Star   -  Saka Neela Tara
Operation Blue Star - Saka Neela Tara
Balvir Singh
 
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion DesignsDigital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
chanes7
 
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana BuscigliopptxGroup Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
ArianaBusciglio
 
Language Across the Curriculm LAC B.Ed.
Language Across the  Curriculm LAC B.Ed.Language Across the  Curriculm LAC B.Ed.
Language Across the Curriculm LAC B.Ed.
Atul Kumar Singh
 
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of LabourNormal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Wasim Ak
 
Synthetic Fiber Construction in lab .pptx
Synthetic Fiber Construction in lab .pptxSynthetic Fiber Construction in lab .pptx
Synthetic Fiber Construction in lab .pptx
Pavel ( NSTU)
 
Model Attribute Check Company Auto Property
Model Attribute  Check Company Auto PropertyModel Attribute  Check Company Auto Property
Model Attribute Check Company Auto Property
Celine George
 
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Nguyen Thanh Tu Collection
 
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptxA Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
thanhdowork
 
Best Digital Marketing Institute In NOIDA
Best Digital Marketing Institute In NOIDABest Digital Marketing Institute In NOIDA
Best Digital Marketing Institute In NOIDA
deeptiverma2406
 
Unit 2- Research Aptitude (UGC NET Paper I).pdf
Unit 2- Research Aptitude (UGC NET Paper I).pdfUnit 2- Research Aptitude (UGC NET Paper I).pdf
Unit 2- Research Aptitude (UGC NET Paper I).pdf
Thiyagu K
 
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th SemesterGuidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Atul Kumar Singh
 
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdfUnit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Thiyagu K
 

Recently uploaded (20)

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
 
The Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official PublicationThe Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official Publication
 
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER  FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...TESDA TM1 REVIEWER  FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
 
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp NetworkIntroduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
 
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
 
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHatAzure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
 
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with MechanismOverview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
 
Operation Blue Star - Saka Neela Tara
Operation Blue Star   -  Saka Neela TaraOperation Blue Star   -  Saka Neela Tara
Operation Blue Star - Saka Neela Tara
 
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion DesignsDigital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
 
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana BuscigliopptxGroup Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
 
Language Across the Curriculm LAC B.Ed.
Language Across the  Curriculm LAC B.Ed.Language Across the  Curriculm LAC B.Ed.
Language Across the Curriculm LAC B.Ed.
 
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of LabourNormal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
 
Synthetic Fiber Construction in lab .pptx
Synthetic Fiber Construction in lab .pptxSynthetic Fiber Construction in lab .pptx
Synthetic Fiber Construction in lab .pptx
 
Model Attribute Check Company Auto Property
Model Attribute  Check Company Auto PropertyModel Attribute  Check Company Auto Property
Model Attribute Check Company Auto Property
 
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
 
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptxA Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
 
Best Digital Marketing Institute In NOIDA
Best Digital Marketing Institute In NOIDABest Digital Marketing Institute In NOIDA
Best Digital Marketing Institute In NOIDA
 
Unit 2- Research Aptitude (UGC NET Paper I).pdf
Unit 2- Research Aptitude (UGC NET Paper I).pdfUnit 2- Research Aptitude (UGC NET Paper I).pdf
Unit 2- Research Aptitude (UGC NET Paper I).pdf
 
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th SemesterGuidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th Semester
 
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdfUnit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
 

12X1 T09 07 arrangements in a circle (2010)

  • 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 possibilit ies for object 1 Number of Arrangements  n Circle possibilit ies for object 1 Number of Arrangements  1
  • 13. Line possibilit ies possibilit ies for object 2 for object 1 Number of Arrangements  n  n  1 Circle possibilit ies possibilit ies for object 2 for object 1 Number of Arrangements  1  n  1
  • 14. Line possibilit ies possibilit ies for object 2 possibilit ies for object 1 for object 3 Number of Arrangements  n  n  1  n  2 Circle possibilit ies possibilit ies for object 2 possibilit ies for object 1 for object 3 Number of Arrangements  1  n  1  n  2
  • 15. Line possibilit ies possibilit ies for object 2 possibilit ies possibilit ies for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2 1 Circle possibilit ies possibilit ies for object 2 possibilit ies possibilit ies for object 1 for object 3 for last object Number of Arrangements  1  n  1  n  2 1
  • 16. Line possibilit ies possibilit ies for object 2 possibilit ies possibilit ies for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2 1 Circle possibilit ies possibilit ies for object 2 possibilit ies possibilit ies 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 possibilit ies possibilit ies for object 2 possibilit ies possibilit ies for object 1 for object 3 for last object Number of Arrangements  n  n  1  n  2 1 Circle possibilit ies possibilit ies for object 2 possibilit ies possibilit ies 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