5.5 Generalized Permutations and Combinations

Slides:



Advertisements
Similar presentations
5.3 Permutations and Combinations
Advertisements

4.5 Generalized Permutations and Combinations
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
Counting Chapter 6 With Question/Answer Animations.
Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
THE BASIC OF COUNTING Discrete mathematics KNURE, Software department, Ph , N.V. Bilous.
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
CSE115/ENGR160 Discrete Mathematics 04/17/12
Permutations r-permutation (AKA “ordered r-selection”) An ordered arrangement of r elements of a set of n distinct elements. permutation of a set of n.
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.
Combinations We should use permutation where order matters
Counting Techniques: r-combinations with
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
Tucker, Section 5.41 Section 5.4 Distributions By Colleen Raimondi.
4.4.2 Combinations of multisets
Quiz 4 Counting: 4.3, 4.4, 4.5. Quiz4: May 5, pm Your answers should be expressed in terms of factorials and/or powers. Imagine you want to.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Main Menu Main Menu (Click on the topics below) Permutations with Some repetitions Example r-Combinations with Some repetitions Example Permutations and.
How many ways are there to pass through city A where the arrows represent one-way streets? Answer: mn ways The counting principal: Suppose two experiments.
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinatorics.
Review of 5.1, 5.3 and new Section 5.5: Generalized Permutations and Combinations.
Counting. Why counting  Determine the complexity of algorithms To sort n numbers, how many instructions are executed ?  Count the number of objects.
The Basics of Counting Section 6.1.
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Generalized Permutations and Combinations
Quiz 3 Counting: 4.3, 4.4, 4.5. Quiz3: April 27, pm Your answers should be expressed in terms of factorials and/or powers. A lonely gambler.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Counting, Permutations, & Combinations. A counting problem asks “how many ways” some event can occur. Ex. 1: How many three-letter codes are there using.
Chapter 3 Permutations and combinations
2 Permutations and Combinations Lesson 8 HAND OUT REFERENCE SHEET AND GO OVER IT.
CSE 221: Algorithms and Data Structures Lecture #10 Counting: Easy as 1, 2, C(3,1) Steve Wolfman 2009W1 1.
Aim #10-7: How do we use the permutation formula? A permutation is an ordered arrangement of items that occurs when: No item is used more than once. The.
Combinations A combination is an unordered collection of distinct elements. To find a combination, the general formula is: Where n is the number of objects.
Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Ch Counting Principles. Example 1  Eight pieces of paper are numbered from 1-8 and placed in a box. One piece of paper is drawn from the box, its.
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 4 Counting.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Counting Principles Multiplication rule Permutations Combinations.
Counting.
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Chapter 6 With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 5 Counting 歐亞書局.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Counting Overview ICS 6D Sandy Irani. Balls into Bins Distinguishable Balls Indistinguishable Balls No restrictions on the number of balls per bin At.
Section 6.3. Section Summary Permutations Combinations.
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
Discrete Mathematics Counting.
Counting, Permutations, & Combinations
CSE15 Discrete Mathematics 04/19/17
Sequences, Series, and Probability
CSC-2259 Discrete Structures
Generalized Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Counting, Permutations, & Combinations
CS100: Discrete structures
PROBABILITY AND STATISTICS
CSE 321 Discrete Structures
Counting, Permutations, & Combinations
Presentation transcript:

5.5 Generalized Permutations and Combinations Permutations with Repetition Theorem 1: The number of r-permutations of a set of n objects with repetition allowed is nr . Example 1: How many strings of length r can be formed from the English alphabet?

Combinations with Repetition Theorem 2: There are C(n+r-1, r) = C(n+r-1, n-1) r-combinations from a set with n elements when repetition of elements is allowed. Example 4: Suppose that a cookie shop has four different kinds of cookies. How many different ways can six cookies be chosen? Assume that only the type of cookie, and not the individual cookies or the order in which they are chosen, matters. Example 5: How many solutions does the equation x1 + x2 + x3 = 11 have, where x1, x2, and x3 are nonnegative integers? HW: Example 3,(p.372)

Combinations with Repetition Example 6: What is the value of k after the following pseudocode has been executed? k :=0 for i1 := 1 to n for i2 := 1 to i1 : for im := 1 to im-1 k :=k+1

Combinations with Repetition

Permutations with Indistinguishable Objects Some elements may be indistinguishable in counting problems. When this is the case , care must be taken to avoid counting things more than once. Consider example 7. Example 7: How many different strings can be made by reordering the letters of the word SUCCESS?

Permutations with Indistinguishable Objects Theorem 3: The number of different permutations of n objects, where there are n1 indistinguishable objects of type 1, n2 indistinguishable objects of type 2,. . . , and nk indistinguishable objects of type k, is n! /(n1! n2! ‥nk!)

Distributing Objects into Boxes Distinguishable Objects and Distinguishable Boxes We first consider the case when distinguishable objects are placed into distinguishable boxes. Consider example 8 in which the objects are cards and the boxes are hands of players. Theorem 4: The number of ways to distribute n distinguishable objects into k distinguishable boxes so that ni objects are placed into box i, i=1, 2, . . .,k, equals n! /(n1! n2!‥nk!) Example 8: How many ways are there to distribute hands of 5 cards to each of four players from the standard deck of 52 cards?

Distributing Objects into Boxes Indistinguishable Objects and Distinguishable Boxes example 9: How many ways are there to place 10 indistinguishable balls into eight distinguishable bins?

Distributing Objects into Boxes Distinguishable Objects and Indistinguishable Boxes Example 10: How many ways are there to put four different employees into three indistinguishable offices, when each office can contain any number of employees?

Distributing Objects into Boxes Indistinguishable Objects and Indistinguishable Boxes Example 11: How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books?