Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    L2 H S4 Counting CommiteesandCombinations

    Uploaded by

    kyleguo21
    This document provides solutions to counting and probability problems involving factorials, permutations, and combinations. It includes step-by-step workings for multi-part problems involving arranging objects, selecting committees from groups, and choosing books from different categories.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    L2 H S4 Counting CommiteesandCombinations

    Uploaded by

    kyleguo21
    8 views3 pages
    This document provides solutions to counting and probability problems involving factorials, permutations, and combinations. It includes step-by-step workings for multi-part problems involving arranging objects, selecting committees from groups, and choosing books from different categories.

    Original Title

    L2_H_S4_Counting_CommiteesandCombinations

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides solutions to counting and probability problems involving factorials, permutations, and combinations. It includes step-by-step workings for multi-part problems involving arranging objects, selecting committees from groups, and choosing books from different categories.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    8 views3 pages

    L2 H S4 Counting CommiteesandCombinations

    Uploaded by

    kyleguo21
    This document provides solutions to counting and probability problems involving factorials, permutations, and combinations. It includes step-by-step workings for multi-part problems involving arranging objects, selecting committees from groups, and choosing books from different categories.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    L2 Counting and probability 4.

    Solutions

    1. These are pretty trivial so no calculation steps will be shown


    (a) 8
    (b) 56
    (c) 21
    (d) 21
    (e) 136
    (f) 136
    (g) 1
    (h) 128
    (i) 1
    (j) 128
    (k) 135
    (l) 135
    (m) 1
    (n) 1
    (o) 969
    (p) 969
    (q) 7315
    (r) 7315
    (s) 32
    (t) 64
    (u) 196
    (v) 196
    (w) 672
    (x) 672
    (y) 136

    1
    (z) 136
    2.
    (a) n n!
    =1
    
    0 = 0!n!
    (b) n n!
    
    1 = 1!(n−1)! =n

    (c) n n! (n−1)(n)
    
    2 = 2!(n−2)! = 2

    (d) n
     n
     (n−1)(n)
    n−2 = 2 = 2

    (e) n n
     
    n−1 = 1 = n

    (f) n n
     
    n = 0 =1
    (g) n n n n
       
    r − n−r = r − r =0
    3.
    (a)
    i. 25 × 24 × 23 = 13800 ways (each leader position is dierent, and
    hence the order matters)
    ii. 25
    3 = 2300 ways (each leader is now the same, and therefore,
    

    the order does not matter)


    (b)
    i. 83 = 56 ways (order does not matter)
    

    ii. The same problem as problem 12 a) for last week, now we use
    combinations
    2 -8 = 20 ways
    8
    

    (c)
    i. 12
    = 220 ways (order does not matter)
    
    3
    ii. 12
    -12 = 54 ways
    
    2
    (d)
    i. There are 6 possibilities for the value for the rst button, 5 pos-
    sibilities for the second and 4 for the third.
    Therefore the answer is 6 × 5 × 4 = 120 ways
    ii. There are 62 = 15 ways to choose the rst 2 buttons.
    

    After choosing the rst 2 buttons, there are 4 buttons remaining.


    Therefore, there are 4 ways to pick the 3rd button
    Multiply them together: 15 × 4 = 60 ways
    iii. There are 6 choices for the rst button,
    There are 5 buttons remaining and we choose 2 of them (since
    order doesn't matter when pressed  together)
    Therefore, the answer is: 6 × 52 = 60 ways
    (note that ii and iii have the same answer, see if you can gure
    out why this is the case)

    2
    iv. This is just 63 =20 ways since the order doesn't matter when
    

    clicking the buttons


    (e)
    i. Books are distinct, therefore, the answer is 9! = 362880 ways
    ii. Treat the math books as a single book (like a bundle), we have
    5 books and there will be 5! ways of arranging them.
    Within the bundle, there are 5! ways to arrange the math books.
    Therefore, the answer is 5! × 5!= 14400 ways
    iii. The solution is 6! × 4! = 17280 ways, the idea is the exact same
    as part ii
    iv. There are 2 ways at which this is possible: 4 English books then
    5 math books or 5 math books then 4 English books. Each way
    has 5! × 4! ways to arrange within the bundles. Finally, multiply
    this by 2 (the 2 ways possible) to get 5760 as the nal answer.
    (f)
    i. There are 9 books and we choose 5 books from the 9 books: 9
    
    5
    = 126 ways
    ii. 5 math books, we choose 5 of them: 55 = 1 way
    

    iii. 4 English books, we choose 4 of them: 44 = 1 way


    

    iv. Choose 2 books from the 5 math books: 52 = 10 ways


    

    Choose 2 books from the 4 English books: 42 = 6 ways


    

    Combine them: 10 × 6 = 60 ways

    You might also like