Looking for a Tutor Near You?

Post Learning Requirement »
x
x

Direction

x

Ask a Question

x

Hire a Tutor

Note On Counting Principles Permutations And Combinations

Loading...

Published in: Mathematics
100 Views

Practice problems with Solutions

Mukul D / Dubai

6 years of teaching experience

Qualification: Bachelor's of Engineering

Teaches: Chemistry, Mathematics, SAT, ACT, Maths

Contact this Tutor
  1. Counting Principles 2008-2014 HL with MS Ia. [3 marks] Fifteen boys and ten girls sit in a single line. In how many ways can they be seated in a single line so that the boys and girls are in two separate groups? 1b. [3 marks] Two boys and three girls are selected to go the theatre. In how many ways can this selection be made? 2a. [3 marks] On Saturday, Alfred and Beatrice play 6 different games against each other. In each game, one of the two wins. The probability that Alfred wins any one of these games is i. 80 Show that the probability that Alfred wins exactly 4 of the games is 243 . 2b. [4 marks] (i) Explain why the total number of possible outcomes for the results of the 6 games is 64. (ii) By expanding (1 + a:) and choosing a suitable value for x, prove 64 c ) + c ) + c ) + (36) + c ) + c ) + c ) (iii) State the meaning of this equality in the context of the 6 games played. 2c. [9 marks] The following day Alfred and Beatrice play the 6 games again. Assume that the probability that Alfred wins any one of these games is still i. (i) Find an expression for the probability Alfred wins 4 games on the first day and 2 on the second 6 day. Give your answer in the form r where the values of r, s and t are to be found. (ii) Using your answer to (c) (i) and 6 similar expressions write down the probability that Alfred wins a total of 6 games over the two days as the sum of 7 probabilities. (12) = 6 (iii) Hence prove that 6 1 2d. [6 marks] 6 2 6 3 6 4 6 5 6 6 Alfred and Beatrice play n games. Let A denote the number of games Alfred wins. The expected E(A) = ± r value of A can be written as (i) Find the values of a and b. (ii) By differentiating the expansion of (l + , prove that the expected number of games Alfred wins is 3 . 3a. [3 marks] Three boys and three girls are to sit on a bench for a photograph. Find the number of ways this can be done if the three girls must sit together. 3b. [4 marks] Find the number of ways this can be done if the three girls must all sit apart. 4a. [4 marks] (i) Express the sum of the first n positive odd integers using sigma notation.
  2. 2 (ii) Show that the sum stated above is n (iii) Deduce the value of the difference between the sum of the first 47 positive odd integers and the sum of the first 14 positive odd integers. 4b. [7 marks] A number of distinct points are marked on the circumference of a circle, forming a polygon. Diagonals are drawn by joining all pairs of non-adjacent points. (i) Show on a diagram all diagonals if there are 5 points. n(n—3) if there are n points, wheren > 2. (ii) Show that the number of diagonals is 2 (iii) Given that there are more than one million diagonals, determine the least number of points for which this is possible. 5.[5 marks] Six people are to sit at a circular table. Two of the people are not to sit immediately beside each other. Find the number of ways that the six people can be seated. 6.[4 marks] Find the number of ways in which seven different toys can be given to three children, if the youngest is to receive three toys and the others receive two toys each. 2
  3. Counting Principles 2008-2014 HL MS Ia. [3 marks] Markscheme number of arrangements of boys is 15! and number of arrangements of girls is 10! (Al) 15! X 10! X 9.49 X 1018) MIAI total number of arrangements is Note: If 2 is omitted, award (AI)MIAO. [3 marks] Examiners report A good number of correct answers were seen to this question, but a significant number of candidates forgot to multiply by 2 in part (a) and in part (b) the most common error was to add the combinations rather than multiply them. 1b. [3 marks] Markscheme number of ways of choosing two boys is 10 3 (Al) 15 2 and the number of ways of choosing three girls is (125) = 12600 number of ways of choosing two boys and three girls is MIAI [3 marks] Examiners report A good number of correct answers were seen to this question, but a significant number of candidates forgot to multiply by 2 in part (a) and in part (b) the most common error was to add the combinations rather than multiply them. 2a. [3 marks] Markscheme ' 3 (Ml) 6 4 = 15 Al 24 80 — 15 x 36 243 AG [3 marks] Examiners report This question linked the binomial distribution with binomial expansion and coefficients and was generally well done. (a) Candidates need to be aware how to work out binomial coefficients without a calculator 2b. [4 marks] Markscheme (i) 2 outcomes for each of the 6 games or 2 = 64 RI 3
  4. (ii) Al Note: Accept notation orl 4- 6T + 15x2 + 20æ3 + 15x4 + 6x5 + setting x = 1 in both sides of the expression RI Note: Do not award RI if the right hand side is not in the correct form. 64 c ) + c ) + c ) + (36) + c ) + c ) + c ) A G (iii) the total number of outcomes = number of ways Alfred can win no games, plus the number of ways he can win one game etc. RI [4 marks] Examiners report This question linked the binomial distribution with binomial expansion and coefficients and was generally well done. (b) (ii) A surprising number of candidates chose to work out the values of all the binomial coefficients (or use Pascal's triangle) to make a total of 64 rather than simply putting 1 into the left hand side of the expression. 2c. [9 marks] Markscheme (i) Let Y) be the probability that Alfred wins x games on the first day and y on the second. P(4, 2) = MIAI Al r = 2 or (ii) P(Tota1 6) = P(O, 6) + PCI, 5) + P(2, 4) + P(3, 3) + P(4, 2) + P(5, 1) + P(6, 0) (Ml) 16 A2 Note: Accept any valid sum of 7 probabilities. ( 02 (46 Y c Y (iii) use of (can be used either here or in (c)(ii)) P(wins 6 out of 12) therefore [9 marks] 26 12 6 Al 12 6 12 Al AG
  5. Examiners report This question linked the binomial distribution with binomial expansion and coefficients and was generally well done. 2d. [6 marks] Markscheme (a = 2, b 3) MIAI Note: MOAO for a = 2, b = 3 without any method. ra:r I (ii) (sigma notation not necessary) AIAI (if sigma notation used also allow lower limit to be r = 0) letx=2M1 n3n-1=E n rx-I r multiply by 2 and divide by 3n (Ml) [6 marks] Examiners report This question linked the binomial distribution with binomial expansion and coefficients and was generally well done. (d) This was poorly done. Candidates were not able to manipulate expressions given using sigma notation. 3a. [3 marks] Markscheme the three girls can sit together in 3! = 6 ways (Al) this leaves 4 'objects' to arrange so the number of ways this can be done is 4! (MI) so the number of arrangements is 6 X 4! 144A1 [3 marks] Examiners report Some good solutions to part (a) and certainly fewer completely correct answers to part (b). Many candidates were able to access at least partial credit, if they were showing their reasoning. 3b. [4 marks] Markscheme Finding more than one position that the girls can sit (Ml) Counting exactly four positions (Al) number of ways = 4 X 3! X 3! 144 MIAI N2 [4 marks] Examiners report 5
  6. Some good solutions to part (a) and certainly fewer completely correct answers to part (b). Many candidates were able to access at least partial credit, if they were showing their reasoning. 4a. [4 marks] Markscheme E (2k - 1) (or equivalent) Al (2n — 1) Note: Award AO for or equivalent. (ii) EITHER n(n+l) 2 OR OR THEN n MIAI — 1)2) (using Sn — 1) (using Sn — — (2u1 + (n — l)d)) MIAI — (ul + un)) MIAI (iii) 47 [4 marks] 142 — 2013M Examiners report In part (a) (i), a large number of candidates were unable to correctly use sigma notation to express the sum of the first n positive odd integers. Common errors included summing 2n — I from 1 to n and specifying sums with incorrect limits. Parts (a) (ii) and (iii) were generally well done. 4b. [7 marks] Markscheme (i) EITHER a pentagon and five diagonals Al OR five diagonals (circle optional) Al (ii) Each point joins to n - 3 other points. Al a correct argument forn n — 3) RI a correct argument for 2 RI 3) > 1000000 (iii) attempting to solve 2 for n. (Ml) n > 1415.7 (Al) n 1416M [7 marks] Examiners report Parts (b) (i) and (iii) were generally well done. In part (b) (iii), many candidates unnecessarily simplified their quadratic when direct GDC use could have been employed. A few candidates gave n > 1416 as their final answer. While some candidates displayed sound reasoning in part (b) (ii), many candidates unfortunately adopted a 'proof by example' approach. 5.[5 marks] 6
  7. Markscheme EITHER with no restrictions six people can be seated in 5! 120 ways Al we now count the number of ways in which the two restricted people will be sitting next to each other call the two restricted people PI and P2 they sit next to each other in two ways Al the remaining people can then be seated in 4! ways Al the six may be seated PI andP2 next to each other) in 2 X 4! :. with PI and ( P2 not next to each other the number of ways [5 marks] OR person PI seated at table in 1 way Al P2 then sits in any of 3 seats (not next to PI ) MIAI the remaining 4 people can then be seated in 4! ways Al 48 ways MI 120 -48 — 72 Al . . number ways with PI not nexttoP2 = 3 X 4! = 72 ways Al N3 Note: If candidate starts with 6! instead of 5! , potentially leading to an answer of 432, do not penalise. [5 marks] Examiners report Very few candidates provided evidence of a clear strategy for solving such a question. The problem which was set in a circular scenario was no more difficult than an analogous linear one. 6.[4 marks] Markscheme the number of ways of allocating presents to the first child is multiplying by Note: Award MI for multiplication of combinations. Al [4 marks] 7