CCM 4300 Lecture 1 Computer Networks: Wireless and Mobile Communication Systems. Permutations and Combinations Dr E. Ever School of Engineering and Information.

Slides:

Advertisements

Similar presentations

Counting and Factorial. Factorial Written n!, the product of all positive integers less than and equal to n. Ex: Evaluate.

Advertisements

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.

Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.

Decisions, Decisions, Decisions

Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.

Combinations We should use permutation where order matters

Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.

6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.

6.7 – Permutations and Combinations

5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.

8-2:Permutations and Combinations English Casbarro Unit 8.

6.2 Find Probability Using Permutations. Vocabulary n factorial: product of integers from 1 to n, written as n! 0! = 1 Permutation: arrangement of objects.

1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.

7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.

7.3 Permutation or Combination 4/12/2013. In the last lesson (combination) we learned about possible number of combinations where the order in which things.

Permutations and Combinations

October 13, 2009 Combinations and Permutations.

© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.

March 10,  Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound.

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.

Whiteboardmaths.com © 2004 All rights reserved

2.2 Permutations (Textbook Section 4.6). Recall Factorial Notation  The number of ways to arrange n objects into n spots is n! (read “!” a “factorial”)

Arrangements How many ways can I arrange the following candles?

Permutations and Combinations

Discrete Mathematics Lecture # 25 Permutation & Combination.

Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.

6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!

Lesson 0.4 (Counting Techniques)

Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.

Warm up How many possible pizzas could you make with 3 types of meats, 2 types of cheeses, and 2 types of sauces? 5 * 4 * 3 * 2 * 1 =

 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.

EXAMPLE 2 Use a permutations formula Your band has written 12 songs and plans to record 9 of them for a CD. In how many ways can you arrange the songs.

WARM-UP Evaluate each expression. 1.8! P 5 14! 10!4! 40, ,120.

Permutations and Combinations

Probability and Counting Rules 4-4: Counting Rules.

Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.

SECTION 5.4 COUNTING. Objectives 1. Count the number of ways a sequence of operations can be performed 2. Count the number of permutations 3. Count the.

Permutations and Combinations

Permutations and Combinations

Copyright © 2016, 2013, and 2010, Pearson Education, Inc.

Counting Methods and Probability Theory

6.7 – Permutations and Combinations

Permutations and Combinations

Chapter 0.4 Counting Techniques.

8.3 Counting Apply the fundamental counting principle

Lesson 4.6! Part 1: Factorial Notation!

4 Probability Lesson 4.8 Combinations and Probability.

Permutations and Combinations

Permutations and Combinations

Lesson 11-1 Permutations and Combinations

Permutations and Combinations

6-7 Permutations and Combinations

Permutation & COmbination

Permutations and Combinations

Counting Methods and Probability Theory

Permutations and Combinations

Bellwork Practice Packet 10.3 B side #3.

Combinations & Permutations (4.3.1)

Applied Combinatorics, 4th Ed. Alan Tucker

Permutations and Combinations

Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.

Permutations and Combinations

Chapter 11: Further Topics in Algebra

Lecture 7: Permutations and Combinations

Permutations and Combinations

Presentation transcript:

CCM 4300 Lecture 1 Computer Networks: Wireless and Mobile Communication Systems. Permutations and Combinations Dr E. Ever School of Engineering and Information Sciences

Definitions in brief Permutation of a number of objects is the number of different ways they can be ordered. Combinations, one does not consider the order in which objects were chosen or placed. Permutations, position important Combinations, chosen important.

A simple example Suppose you have to put some pictures on the wall, and suppose you only have two pictures: A and B. You could hang them in order : Or In this case, for permutations the order of events is important: order 1 is different from order 2. For combinations, it does not matter which picture was hung first (A, B = B, A). A B A B

Lets try it with three pictures (1) A B C A C B B A C C B A C B A C A B

For the first picture you had a choice of three. For the second picture you had a choice of two. Then you have the last picture. Written algebraically this is 3 × 2 × 1. For large numbers this is factorial notation is used. Lets try it with three pictures (2) What happens if there are 10 pictures and three of them can be hanged? For the first picture you had a choice of ten. For the second picture you had a choice of nine. Then you have eight pictures remaining for the last position. Written algebraically this is 10 × 9 × 8= 720.

Formula for the number of possible permutations 10! = 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = To choose 3 pictures from a set of 10 pictures the first three terms (10 × 9 × 8) are used. The remaining ones (7 × 6 × 5 × 4 × 3 × 2 × 1) are not used. The formula for the number of possible permutations of k objects from a set of n:

Combinations (1) The order of the pictures is not important. Consider the hanging of the three pictures A,B,C, we had six permutations. Three pictures were the same in the each permutation They were only one combination. The three pictures made one set, and the same is true for each group of three pictures.

What happens if there are 10 pictures and three of them can be hanged? If we take the first three pictures (1, 2 and 3) we could arrange these in six different ways (permutations) 3! Likewise for all the other sets of three pictures; each set of three can be arranged in six different ways. Since each set of three chosen can be arranged in 3! different ways. The number of sets of three (i.e. the number of combinations) is 720 ÷ 3! = 120. Combinations (2)

Combinations (3) The formula for the number of possible combinations of r objects from a set of n objects.