Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.

Slides:



Advertisements
Similar presentations
4-1 Chapter 4 Counting Techniques.
Advertisements

© 2010 Pearson Education, Inc. All rights reserved Chapter 9 9 Probability.
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
Combinations We should use permutation where order matters
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Expected value a weighted average of all possible values where the weights are the probabilities of each outcome :
Permutations and Combinations
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
Permutation and Combination
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
6.4 Permutations and combinations For more complicated problems, we will need to develop two important concepts: permutations and combinations. Both of.
Math 2 Honors - Santowski
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
Chapter 4 Lecture 4 Section: 4.7. Counting Fundamental Rule of Counting: If an event occurs m ways and if a different event occurs n ways, then the events.
Dr. Fowler AFM Unit 7-7 Permutations and Combinations.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Mathematics. Permutation & Combination - 2 Session.
NO ONE CAN PREDICT TO WHAT HEIGHTS YOU CAN SOAR
Counting Techniques. Multiplication Rule of Counting If a task consists of a sequence of choices in which there are p selections for the first choice,
ESSENTIAL COUNTING RULES Example: A certain two-symbol code consists of a letter in the first position and a digit in the second position. Give some elements.
Permutation and Combination
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
 Counting CSCA67 Fall, 2012 Nov. 12, 2012 TA: Yadi Zhao
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
CSNB143 – Discrete Structure
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
Discrete Mathematics Lecture # 25 Permutation & Combination.
1 If a task is made up of multiple operations (activities or stages that are independent of each other) the total number of possibilities for the multi-step.
Counting Principles Multiplication rule Permutations Combinations.
Lesson 0.4 (Counting Techniques)
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
7.3 Combinations Math A combination is a selection of a group of objects taken from a larger pool for which the kinds of objects selected is of.
3.2 Combinations.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations and Combinations PSSA Unit. Permutations A permutation of the letters abc is all of their possible arrangements: abc acb bac bca cab cba.
Choosing items from a larger group, when the order does not matter. This is different than permutations in chapter 11.2 – items had to be in a certain.
Permutations and Combinations
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Warm up A Ferris wheel holds 12 riders. If there are 20 people waiting in line, how many different ways can 12 people ride it? You may write your answer.
Textbooks (required): A First course in Probability (8th Ed), Sheldon Ross.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 4.5.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Combinations By Mr Porter. Definition: Combination Selections. The number of unordered selections of r items form n items (that is the number of combinations.
LEARNING OUTCOMES : a. understand combinations of a set of objects. b. determine the number of ways to form combinations of r objects from n objects Click.
4-1 Chapter 4 Counting Techniques.
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
A First course in Probability (8th Ed), Sheldon Ross
Counting Methods and Probability Theory
Copyright © Cengage Learning. All rights reserved.
3! ways, and 2! ways, so Permutations where some objects are repeated
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Presentation transcript:

Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order does not matter. Formula: The number of combinations of n objects, taken k at a time is given by the formula

Introduction to probability (2) Combinations التوافيق The quantity is read “n choose k” Example: Corollary

Introduction to probability (2) Recognizing combinations and permutations is not always simple and easy; permutations are arrangements therefore, order is important while the order does not matter in a combination. The situation will need to be analyzed to determine if order matters. Example: The litters A, B, C can be arranged in six different ways as : ABC, ACB, BAC,BCA,CAB and CBA As:

Introduction to probability (2) As: Because the order of litters makes each one different; however, the six are the same in terms of combinations. Each group of three litters consists of the same litters, A, B, and C is the same in each. There are 6 permutations but only one combination of the three litters, taken three at a time.

Introduction to probability (2) Remark: 1. Use permutations if a problem calls for the number of arrangements of objects and different orders are to be counted. 2. Use combinations if a problem calls for the number of ways of selecting objects and the order of selecting is not counting.

Introduction to probability (2) Examples: In a class there are 27 boys and 14 girls, the teacher wants to select 1 boy and 1 girl to represent the class for a function. In how many ways can the teacher make this selection? Solution: Here the teacher is to perform two operations as: Selecting a boy from among the 27 boys and Selecting a girl from among the 14 girls. Then the teacher makes this selection by

Introduction to probability (2) In how many ways 3 mathematic books, 4history books, 3 chemistry books and 2 biology books can be arranged on a shelf so that all books of the same subjects are together? Solution: We will take books a particular subject as one unit. Then all the four types can be arranged as 4!=24. Mathematic books can be arranged as: 3! = 6. History books can be arranged as: 4! = 24. Chemistry books can be arranged as: 3! = 6. Biology books can be arranged as: 2! = 2. Then the total number of ways =

Introduction to probability (2) There are four bus routes between A and B; and three bus routes between B and C. a man can travel round trip in number of ways by bus from A to C via B. if he doesn’t want to use a bus route more than once. In how many ways can he make round trip? Solution: There are 4 bus routes from A to B and 3 routes from B to C. therefore, there are ways to go from A to C. it is round trip so the man will travel back from C to A via B. it is restricted that man cannot use same bus routs from C to B and from B to A more than once. Thus there are routes for return journey. Therefore the required number is

Introduction to probability (2) In how many ways a committee consisting of 3 men and 2 women, can be chosen from 7 men and 5 women? Solution: Out of 7 men there are 3 men can be chosen in 7C3 ways as:

Introduction to probability (2) Out of 5 women there are 2 women can be chosen as 5C2 ways as: Then the committee can be chosen in

Introduction to probability (2) 1.Ten different letters of alphabet are given words with 5 letters are formed from these given letters. Then the number of words which have at least one letter repeated? Solution: Number of 5 letters words (with condition that a letter can be repeated) =

Introduction to probability (2) Again number of words using 5 different letters is 10P5 The required number = total number of words – Total number of words in which no letter is repeated = = 69760