PERMUTATIONS & COMBINATIONS 1. Permutation and combination both are the process of arrangements. Permutation is the different arrangements of things from.

Slides:



Advertisements
Similar presentations
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
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.
Decisions, Decisions, Decisions
Combinations, Permutations, and the Fundamental Counting Principle.
Permutation and Combination
1 Learning Objectives for Section 7.4 Permutations and Combinations After today’s lesson you should be able to set up and compute factorials. apply and.
CSE115/ENGR160 Discrete Mathematics 04/17/12
Permutations & Combinations Section 2.4. Permutations When more than one item is selected (without replacement) from a single category and the order of.
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Probability Lesson: PR-4 Fundamental Counting Principle Fundamental Counting Principle Learning.
9.6 Counting Principles Permutations Combinations.
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.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 Counting Section 3-7 M A R I O F. T R I O L A Copyright © 1998, Triola, Elementary.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 Uncertainty: Data and Chance.
MATH 1107 Elementary Statistics Lecture 7 Combinations and Permutations.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Notes 9.1 – Basic Combinatorics. I. Types of Data 1.) Discrete Data – “Countable”; how many? 2.) Continuous Data – “uncountable”; measurements; you can.
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.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
13-1 Permutations and Combinations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Mathematics. Permutation & Combination - 2 Session.
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
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.
Permutations and Combinations
Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.
Part 2 – Factorial and other Counting Rules
Copyright © 2011 Pearson Education, Inc. Probability: Living with the Odds.
CHAPTER 10 Sequences, Induction, & Probability Sequences & Summation Notation Objectives –Find particular terms of sequence from the general term.
Ch Counting Techniques Product Rule If the first element or object of an ordered pair can be used in n 1 ways, and for each of these n1 ways.
Conditional Probability The probability that event B will occur given that A will occur (or has occurred) is denoted P(B|A) (read the probability of B.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Learning Objectives for Section 7.4 Permutations and Combinations
Methods of Counting By Dr. Carol A. Marinas Fundamental Counting Principle Event M can occur in m ways Event N can occur in n ways The event M followed.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
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.
Discrete Mathematics, 1st Edition Kevin Ferland Chapter 6 Basic Counting 1.
Unit VI Discrete Structures Permutations and Combinations SE (Comp.Engg.)
Counting Principles Multiplication rule Permutations Combinations.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Tell whether each event is dependent or independent 1. Selecting a name from a Chicago telephone book and.
I CAN: Use Permutations and Combinations
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Unit 8 Probability.
MATH 2311 Section 2.1.
Copyright © Cengage Learning. All rights reserved.
Permutations and Combinations
CS100: Discrete structures
Chapter 7 Logic, Sets, and Counting
Permutations and Combinations
Advanced Combinations and Permutations
Permutations and Combinations
MATH 2311 Section 2.1.
M.S COLLEGE OF ARTS ,SCIENCE ,COMMERCE AND BMS
MATH 2311 Section 2.1.
Presentation transcript:

PERMUTATIONS & COMBINATIONS 1

Permutation and combination both are the process of arrangements. Permutation is the different arrangements of things from a given lot taken one or more at a time. Whereas combination is the different sets or groups to be made out of a given lot. without repeating an element. Taking one or more of them at a time. Permutations and combination can be made out of a set of three elements {a,b,c}. It is possible to make different arrangements with the given elements. 2

3

4

In the rules of counting we have considered the possible choices of ‘R’ different objects from ‘N’ different objects or events, with or without repetition. In permutation we have different arrangements of certain number of objects, say ‘R’ at a time taken from ‘N’ different objects without the repetition of any given object in any one set more than once.To illustrate there are many permutations of ABC but none will be like ABB or AAA. For example: a book seller has received three new book A,B,C. He can place them in his showcase in any of the following 6 ways: ABC,ACB,BAC,BCA,CAB,CBA. 5

6

7

8

9

These are related with arrangement of objects as in the case of a sitting arrangement of members in a round- table conference. Here the arrangement does not change unless the order changes. In the circular arrangement, the relative position of the other objects depends on the position of the object placed first, it is only then the arrangement of the remaining objects is made. Therefore, the circular arrangement of ‘n’ objects will be in (n-1)! ways and not ‘n’ ways, when all the objects are considered for the purpose. Therefore, the cricular arrangemant of 5 persons will be in 4 ways, i.e. 4 × 3 × 2 × 1=24 ways. We now make use of the above principle in a slightly complex situation. 10

11

12

13

Combination are the groups which can be made by taking some or all of objects at a time. Thus in combination order does not matter, it is simply the identity of items in the selection that matters. A change in any one item will constitute a new combination. For example The number of different ways in which b people can arranged in a queue is a question of permutations where order matters. The number of different ways in which b people can sit in a committee of 3 is a question of combinations where order does not matter but the constitutuents of each selections do matter. However repetition in each combination is not allowed except otherwise stated. 14

The number of combinations of n different things taken r at a time, is same as the number of combinations of n different things taken (n-r) at a time. i.e. n c r = n c n-r ; where o<r<n. 15

16

17

18

19

1.The number of combinations of ‘n’ things taken ‘r’ at a time in which ‘p’ particular things always occur in n-p c r-p’ 2.The number of combinations ‘n’ things taken ‘r’ at a time in which ‘p’ particular things never occur is n-p c r 20

21

22

Form the discussion above we can say that although permutations and combinations are two types of arranging objects of a mathematical expression, there are some differents it their ways of arrangement. But in conclusion it can be said that, in mathematical terms permutations and combinations are very important because of their function of arranging odjects of a mathematical expression 23

1.Business Mathematics: => Dr. Md. Ferozzaman. 2.Business Mathematics:=>Md. Rafiqul Islam. 3.Business Mathematics:=> V.K. Kapoor. 4.Mathematics With Application in Management and Economics:=> Bowen 24