OCR Statistics 1. Probability. Section 2: Permutations and combinations. Factorials

Similar documents
Know how to add positive and negative numbers Know how to use the sign change key on a calculator

2 parts of the circle are shaded is called the numerator. the circle is divided into 7 equal parts

Introduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.

Probability. Key Definitions

Statistics Laboratory 7

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b

Question 1: How do you count choices using the multiplication principle?

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

Fundamentals of Probability

The factorial of a number (n!) is the product of all of the integers from that number down to 1.

How to Calculate the Probabilities of Winning the Nine Cash4Life Prize Levels:

6.1.1 The multiplication rule

Counting Methods and Probability

NAME DATE PERIOD. Study Guide and Intervention

D1 Probability of One Event

Nwheatleyschaller s The Next Step...Conditional Probability

Questions on Conditional Probability

1 Integers and powers

Principles of Counting

PROBABILITY. Example 1 The probability of choosing a heart from a deck of cards is given by

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Independent Events. If we were to flip a coin, each time we flip that coin the chance of it landing on heads or tails will always remain the same.

Now let s figure the probability that Angelina picked a green marble if Marc did not replace his marble.

Math 1116 Probability Lecture Monday Wednesday 10:10 11:30

7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count

Created by T. Madas COMBINATORICS. Created by T. Madas

Lesson 4: Calculating Probabilities for Chance Experiments with Equally Likely Outcomes

Chapter 10A. a) How many labels for Product A are required? Solution: ABC ACB BCA BAC CAB CBA. There are 6 different possible labels.

Algebra II- Chapter 12- Test Review

Chapter 1 The Major Scale

A1.2 Multiplying and Dividing with Decimals. A1.3 Fractions and Decimals. A1.4 Negative Numbers. A1.5 Operations wiith Negative Numbers

Lesson 4: Calculating Probabilities for Chance Experiments with Equally Likely Outcomes

Discrete Structures Lecture Permutations and Combinations

Name: 2016 Non Common Entrance Fourth Form Entry. Mathematics. Time Allowed: 60 minutes

CS1802 Week 9: Probability, Expectation, Entropy

The Human Fruit Machine

MATH 13150: Freshman Seminar Unit 4

Sets, Probability, Statistics I

Section The Multiplication Principle and Permutations

1. How to identify the sample space of a probability experiment and how to identify simple events

Problem Set 2. Counting

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

CIS 2033 Lecture 6, Spring 2017

1. Simplify 5! 2. Simplify P(4,3) 3. Simplify C(8,5) ? 6. Simplify 5

19.2 Permutations and Probability Combinations and Probability.

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

Paper B Numeracy Paper 11+ Candidate Number... This is a multiple-choice test. Please fill in the details on the multiple-choice answer sheet.


19.3 Combinations and Probability

Math 3201 Notes Chapter 2: Counting Methods

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

~ Pizzeria ~ The following developer is responsible for the declaration: Astro Corp.

Chapter 2 Math

Counting. Combinations. Permutations. September 15, Permutations. Do you really know how to count?

Park Forest Math Team. Meet #5. Self-study Packet

SMT 2014 Advanced Topics Test Solutions February 15, 2014

Chapter 4. Probability and Counting Rules. McGraw-Hill, Bluman, 7 th ed, Chapter 4

Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting

PERMUTATIONS AND COMBINATIONS

Axiomatic Probability

Theory of Probability - Brett Bernstein

JMC Number Questions

THE COUNTING PRINCIPLE Desiree Timmet Statistics South Africa

Speaking Notes for Grades 4 to 6 Presentation

Probability 1. Name: Total Marks: 1. An unbiased spinner is shown below.

MEP Practice Book ES5. 1. A coin is tossed, and a die is thrown. List all the possible outcomes.

Permutation. Lesson 5

MANIPULATIVE MATHEMATICS FOR STUDENTS

1. For which of the following sets does the mean equal the median?

Course Learning Outcomes for Unit V

Empirical (or statistical) probability) is based on. The empirical probability of an event E is the frequency of event E.

Equivalent Fractions

CHAPTER 3 DECIMALS. EXERCISE 8 Page Convert 0.65 to a proper fraction may be written as: 100. i.e = =

How to Calculate the Probabilities of Winning the Nine Mega Millions Prize Levels:

Permutations and Combinations

PS 3.8 Probability Concepts Permutations & Combinations

50 Counting Questions

Name: Class: Date: 6. An event occurs, on average, every 6 out of 17 times during a simulation. The experimental probability of this event is 11

MATH STUDENT BOOK. 7th Grade Unit 6

elements in S. It can tricky counting up the numbers of

Lesson 6: Using Tree Diagrams to Represent a Sample Space and to Calculate Probabilities

W = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}

MIND ACTION SERIES THE COUNTING PRINCIPLE AND PROBABILITY GRADE

FOURTH LECTURE : SEPTEMBER 18, 2014

Permutations and Combinations

2008 Cedar Ridge Test Solutions

Combinatorics. Chapter Permutations. Counting Problems

Probability. Dr. Zhang Fordham Univ.

TJP TOP TIPS FOR IGCSE STATS & PROBABILITY

Bayes stuff Red Cross and Blood Example

(Children s e-safety advice) Keeping Yourself Safe Online

STATISTICAL COUNTING TECHNIQUES

CONTENTS CONTENTS PAGES 11.0 CONCEPT MAP A. PERMUTATIONS a EXERCISE A B. COMBINATIONS a EXERCISE B PAST YEAR SPM

Finite Mathematics MAT 141: Chapter 8 Notes

Lesson 10: Understanding Multiplication of Integers

Chapter 5 Probability

DISCRETE STRUCTURES COUNTING

4.1 What is Probability?

Simple Counting Problems

Transcription:

OCR Statistics Probability Section 2: Permutations and combinations Notes and Examples These notes contain subsections on Factorials Permutations Combinations Factorials An important aspect of life is setting up a password for entry into a computer network. Let us look at the possible arrangements we can have in a few simple examples. Example A 6 letter password can be made using each of the letters P, Q, R, X, Y and Z once. The first letter can be chosen in 6 ways. Once we have chosen this letter we cannot use it again, So the second letter can be chosen in 5 ways. The third letter can be chosen in 4 ways. The fourth letter can be chosen in 3 ways. The fifth letter can be chosen in 2 ways. This leaves us with only letter. The sixth letter can be chosen in way. Altogether the 6 letters can be arranged in 6 5 4 3 2 ways, or 6! ways and, 6! = 720. This means the chances of somebody guessing a password made up in this way are 720. Check that you know how to work out factorials on your calculator. Some calculators have a! key; in others it will be found on a menu. MEI, 23/06/09 /8

Example 2 A 5 letter password can be made using each of the letters P, Q, R, X, Y and Z as many times as we like. The first letter can be chosen in 6 ways. The second letter can also be chosen in 6 ways, as we can repeat the first letter. The third letter can be chosen in 6 ways. The fourth letter can be chosen in 6 ways. The fifth letter can be chosen in 6 ways. Altogether we have 6 6 6 6 6 or 6 5 ways. 6 5 = 7776. This means the chances of somebody guessing a password made up in this way are 7776. Note that when we can replace the letter (or object) it is not a factorial problem. Example 3 A password can be made consisting of 3 letters followed by 3 numbers. The first 3 letters are selected using each of the letters A, T and Z once. The numbers are selected from 0, and 2, using each of the numbers once. The first letter can be chosen in 3 ways. Once we have chosen this letter we cannot use it again, So the second letter can be chosen in 2 ways. The third letter can be chosen in way. The first number can be chosen in 3 ways. Once we have chosen this number we cannot use it again, So the second number can be chosen in 2 ways. The third number can be chosen in way. Altogether, the 3 letters can be arranged in 3 2 ways = 6 ways. Altogether, the 3 numbers can be arranged in 3 2 ways = 6 ways. Altogether, the 3 letters and 3 numbers can be arranged in 6 6 ways = 36 ways. Note:. In general the number of ways of placing n different objects in a line is n! where n! n ( n ) ( n 2)... 32. n must be a positive integer in this context. MEI, 23/06/09 2/8

2. We can simplify factorial expressions when adding or dividing. Just use the definition of the factorial. (See Example 4 below). 3.! = But also 0! =. Make sure that you memorise this! Example 4 Simplify the following: 6! (i) 3! (ii) 6! + 4! 6! 6 5 4 3 2 (i) 6 5 4 20 3! 32 (ii) 6! 4! (65432) (432) 30(43 2) (432) 3(4 3 2) 34! Note the 3 2 can be cancelled Note the common factor of (4 3 2 ) Do not worry if you have problems on this section. These extra examples are to help you get through Exercise 5A, say questions and 5. This extra information on factorials will be useful for module C. Permutations Example 5 A 6 letter password can be made using any of the letters L, M, N, O, P, Q, R, X, Y and Z once. The first letter can be chosen in 0 ways. Once we have chosen this letter we cannot use it again, So the second letter can be chosen in 9 ways. The third letter can be chosen in 8 ways. The fourth letter can be chosen in 7 ways. The fifth letter can be chosen in 6 ways. The sixth letter can be chosen in 5 ways. Altogether the 6 letters can be arranged in: 0 9 8 7 6 5 = 5200 ways. MEI, 23/06/09 3/8

So the chance somebody will access the site using your password is: 5200 We can calculate this in another way. 098765 432 098765 432 0! 0! or 4! (0 6)! This has been multiplied by 432, so also must be divided by 432 Example 6 A 5 letter password can be made using any of the letters A, B, C, D, E, F and G once. The first letter can be chosen in 7 ways. Once we have chosen this letter we cannot use it again, So the second letter can be chosen in 6 ways. The third letter can be chosen in 5 ways. The fourth letter can be chosen in 4 ways. The fifth letter can be chosen in 3 ways. Altogether the 5 letters can be arranged in 7 6 5 4 3 = 2520 ways. So the chance somebody will access the site using your password is: 2520 We can calculate this in another way. 765432 76543 2 7! 7! or 2! (7 5)! This has been multiplied by 2, so also must be divided by 2 We call this a permutation. In general the number of permutations, n P r, of r objects from n is given by: n P r n( n ) ( n 2)... ( n r ) n n! This can also be written as Pr ( n r)! Example 7 A password can be made consisting of 3 letters followed by 3 numbers. The first 3 letters are selected using any of the letters A, B, C,.Y and Z once. The numbers are selected using any of the numbers 0,, 2,.8, and 9 once. MEI, 23/06/09 4/8

: The letters can be chosen in 26 P 3 ways. 26 P 3 = 26! 26! or 23! (26 3)! The numbers can be chosen in 0 P 3 ways. 0 P 3 = 0! 0! or 7! (0 3)! Altogether we can arrange the letters and numbers in 26 P 3 0 P 3 = 232000 ways. Combinations It is often the case that we are not concerned with the order in which items are chosen, only which ones are picked. Let us amend the previous Example to illustrate this. Example 8 A six a-side football team is to be selected from the players L, M, N, O, P, Q, R, X, Y and Z. How many possible selections are there? Note in this case we are interested in the 6 players selected, not the order. A team featuring L, M, N, X, Y and Z, is the same as the team X, Y, Z, L, M and N. If the order mattered, the number of arrangements would be 0 P 6 However, as the order does not matter we have to work out the number of repeated selections. From the earlier section on factorials, we remember that 6 objects can be arranged in 6! ways. So this means that we need to divide by 6! So the number of selections is: 0 P 6 0! or = 6! (0 6)! (6!) = 20 We call this a combination. In general the number of combinations, n r n n! by: r r!( n r)! or n C r, of r objects from n is given MEI, 23/06/09 5/8

We can illustrate the use of combinations in a more complex situation. Example 9 4 representatives are chosen from a teaching group consisting of 2 boys and 8 girls. (i) Calculate the total number of ways they can be chosen. (ii) Calculate the number of ways of getting each of these selections: - 4 boys and 0 girls - 3 boys and girl - 2 boys and 2 girls - boy and 3 girls - 4 girls. This is a combination problem as we are not interested in the order of selection. (i) Choosing 4 students from the group of 20 students can be done in: 20 ways = 4845 ways. 4 (ii) 4 boys and 0 girls: 2 Selecting 4 boys from 2 is 4 2 Number of selections = = 495 4 2 3 boys and girl: Selecting 3 boys from 2 is 3 8 Selecting girl from 8 is 2 8 Number of selections = 3 = 760 2 2 boys and 2 girls: Selecting 2 boys from 2 is 2 8 Selecting 2 girls from 8 is 2 2 8 Number of selections = = 848 2 2 2 boy and 3 girls: Selecting boy from 2 is 8 Selecting 3 girls from 8 is 3 MEI, 23/06/09 6/8

Number of selections = 2 8 = 672 3 8 4 girls and 0 boys: Selecting 4 girls from 8 is 4 8 Number of selections = = 70 4 Check: Total number of selections is: 495+ 760 + 848 + 672 +70 = 4845 The next example is an examination style question. Example 0 I have a box of chocolates with 0 different chocolates left in it. Of these, there are 6 which I particularly like. However, I intend to offer my three friends one chocolate each before I eat the rest. How many different selections of chocolates can I be left with after my friends have chosen? Show that 36 of these selections leave me with exactly 5 chocolates which I particularly like. How many selections leave me with: (i) (ii) (iii) all 6 of the chocolates that I particularly like? exactly 4 of the chocolates that I particularly like? exactly 3 of the chocolates that I particularly like? Assuming my friends choose at random, what is the most likely outcome, and what is the probability of that outcome? I start with 0 chocolates. I give one to each of my 3 friends. I am left with 7 chocolates. 0 The number of selections left is: 7 = 20 From these 7 chocolates, if I am left with 5 chocolates that I particularly like then I must also be left with 2 that I do not like. 6 5 chocolates from the 6 that I like can be selected in: = 6 ways 5 4 2 chocolates from the 4 that I do not like can be selected in: = 6 ways 2 6 6 = 36 ways, as required. MEI, 23/06/09 7/8

(i) (ii) (iii) From these 7 chocolates, if I am left with 6 chocolates that I particularly like, then I must also be left with that I do not like. 6 6 chocolates from the 6 that I like can be selected in: = way 6 4 chocolate from the 4 that I do not like can be selected in: = 4 ways 4 = 4 ways From these 7 chocolates, if I am left with 4 chocolates that I particularly like, then I must also be left with 3 that I do not like. 6 4 chocolates from the 6 that I like can be selected in: = 5 ways 4 4 3 chocolates from the 4 that I do not like can be selected in: = 4 ways 3 5 4 = 60 ways From these 7 chocolates, if I am left with 3 chocolates that I particularly like, then I must also be left with 4 that I do not like. 6 3 chocolates from the 6 that I like can be selected in: = 20 ways 3 4 4 chocolates from the 4 that I do not like can be selected in: = way 4 20 = 20 ways The most likely outcome is that I am left with 4 chocolates that I particularly like. There are 60 ways of getting 4 chocolates that I particularly like. With 7 chocolates left I can be left with 6, 5, 4 or 3 which I like, as there are 4 which I do not like. There are altogether: 4 + 36 + 60 + 20 = 20 selections. The probability that I get 4 sweets that I like 60 20 2 MEI, 23/06/09 8/8