Arrangements & Selections with Repetition

Slides:

Advertisements

Similar presentations

4.5 Generalized Permutations and Combinations

Advertisements

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.

The Division Rule Theorem: Suppose a set A has n elements and is partitioned by the collection {A 1, A 2,..., A p }, where each partition set has m elements.

Counting Tools ● Enumeration ● Multiplication ● Addition ● Negation.

CSE115/ENGR160 Discrete Mathematics 04/17/12

Chapter 9 Generating functions Yen-Liang Chen Dept of Information Management National Central University.

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.

CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting.

4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.

Counting Techniques: r-combinations with

More Counting Lecture 16: Nov 9 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.

4/2/03Tucker, Section 5.31 How many ways to arrange the six letters b, a, n, a, n, a ? Arrangements and Selections With Repetitions Six places: __ __ __.

1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.

Counting Elements in a List How many integers in the list from 1 to 10? How many integers in the list from m to n? (assuming m

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.

1 Permutations and Combinations CS/APMA 202 Epp section 6.4 Aaron Bloomfield.

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.

Ch. 8 & 9 – Linear Sorting and Order Statistics What do you trade for speed?

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.

Exam 1 Review 5.1, , 8.1, 8.2.

7.4 Generating Functions Definition 1: The generation function for the sequence a 0, a 1,...,a k,... of real numbers is the infinite series G(x) = a 0.

Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.

1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.

Counting. Why counting  Determine the complexity of algorithms To sort n numbers, how many instructions are executed ?  Count the number of objects.

1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,

Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.

Chapter The Basics of Counting 5.2 The Pigeonhole Principle

Generalized Permutations and Combinations

Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.

Permutations and Combinations

Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.

Elementary Combinatorics Combinatorics  Deals with enumeration (counting) techniques and related algebra.  Basis of counting XSet |X|No. of elements.

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.

2 Permutations and Combinations Lesson 8 HAND OUT REFERENCE SHEET AND GO OVER IT.

Chapter 7 Advance Counting Techniques. Content Recurrence relations Generating function The principle of inclusion-exclusion.

Chapter 6, Counting and Probability

1 Binomial Coefficients CS 202 Epp, section ??? Aaron Bloomfield.

Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.

1 Counting by Mapping Lecture 15: Nov 4 A B …… f.

Counting nCr = n!/r!(n-r)!=nC(n-r) This equation reflects the fact that selecting r items is same as selecting n-r items in forming a combination from.

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,

Counting Principles Multiplication rule Permutations Combinations.

5.5 Generalized Permutations and Combinations

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.

Copyright © Peter Cappello 2011 Simple Arrangements & Selections.

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.

Distributions. Basic Model for Distributions of Distinct Objects The following problems are equivalent: Distributing n distinct objects into b distinct.

My Penguin Math Book By:. I see How many penguins do you see? Count them and type the number in the box penguins.

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.

Operations on Sets Union of Sets Intersection of Sets

Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.

Fall 2002CMSC Discrete Structures1 Combinations An r-combination of elements of a set is an unordered selection of r elements from the set. Thus,

COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.

Section 6.3. Section Summary Permutations Combinations.

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.

The Pigeonhole Principle

COCS DISCRETE STRUCTURES

Generalized Permutations & Combinations: Selected Exercises

Permutations and Combinations

CS100: Discrete structures

Arrangements & Selections with Repetition

Arrangements & Selections with Repetition

Permutations and Combinations

Basic Counting.

Basic Counting Lecture 9: Nov 5, 6.

Presentation transcript:

Arrangements & Selections with Repetition

Arrangements with Unlimited Repetition Enumerating r-permutations from a set of n objects with repetition, denoted, U(n, r) = nr. What does this number remind you of? Example: There are 25 true/false questions on an examination. How many different ways can a student fill in answers, if she can also leave the answer blank?

Arrangements with Limited Repetition Generalizing the MISSISSIPPI example: Theorem 1: If there are r1 objects of type 1, r2 of type 2, …, rm of type m, where r1 + r2 + . . . + rm = n, then the # of arrangements of these n objects, denoted P(n; r1 , r2 , …, rm ) , is

We have n positions to distribute the objects. Select r1 of them to position the objects of type 1. n - r1 positions remain with rm-1 types of objects. Repeat. (Use an induction argument)

Proof Use the product rule: Phase 1: pick the positions for the type 1 objects There are nCr1 ways to do that. Phase 2: pick the positions for the type 2 objects There are (n - r1)Cr2 ways to do that. And so on … Phase m: pick the positions for the type m objects There are (n - r1 - r2 - …- rm-1)Crm ways to do that.

Example How many ways can 23 different books be given to 5 students so that 2 students get 4 books each, and the other 3 get 5 books each? Use the product rule: 1. Pick the 2 students of 5 who receive 4 books. 2. Distribute the books to the students. I.e., pick the 4 books for student1, pick the 4 books for student2, pick the 5 books for student3, … The answer thus is 5C2  P(23;4,4,5,5,5).

Example How many 8-digit sequences are there involving exactly 6 different digits? Use the product rule: 1. Pick the 6 digits to be used. 2. For any given 6 digits, count the sequences

For a given 6 digits, count the sequences Use the sum rule Partition the answers according to the 2 possible distribution of the 6 digits. 1 digit is used 3 times; the other 5 are used once 2 digits are used twice; the other 4 are used once Count the solutions for each distribution. Pick the digit to be used 3 times; arrange the digits. Pick the digits to be used twice; arrange the digits.

Selections with Unlimited Repetition Key to this kind of problem: Knowing how to count the number of n-bit binary strings with exactly r 1s: nCr. We want to count the number of distinct selections of 12 items from identical: Palm Pilots Nokia cell phones IBM Think Pads Uzi machine guns.

For example, 1 possible such selection is: 1 Palm Pilot 0 Nokia cell phones 10 IBM Think Pads 1 Uzi machine gun As a string, we could represent this selection as: P//IIIIIIIIII/U

How would we represent as a string the selection: 2 Palm Pilot 3 Nokia cell phones 6 IBM Think Pads 1 Uzi machine gun If we agree on an order of item types, we could represent this selection as 00/000/000000/0

Each string with 12 0s and 3 /s corresponds to 1 selection. Each such selection corresponds to 1 such string. Thus, the problem is equivalent to asking “How many (12 + 4 - 1)-bit binary strings are there with exactly 3 1s?” There are (12 + 4 - 1)C3 = (12 + 4 - 1)C12 such strings.

Selection with Unlimited Repetition: Equivalent Formulations The number of r-combinations of n distinct objects with unlimited repetition. nonnegative integer solutions to x1 + x2 + . . . + xr = n. ways to distribute n balls into r numbered boxes. (n + r - 1)-bit binary strings with exactly r-1 1s. (n + r - 1)C(r -1) = (n + r - 1)Cn

Example How many ways are there to pick 10 balls from unlimited piles of identical red, blue, and black balls, and 1 green, 1 orange, and 1 yellow ball?

Example How many ways are there to pick 10 balls from unlimited piles of identical red, blue, and black balls, and 1 green, 1 orange, and 1 yellow ball? Partition the solution set into those that use 1, 2, or 3 of the “limited edition (LE)” balls. For a given part, use the product rule: count the ways to pick the LE ball[s] count the ways to pick the rest of the balls.

Example How many ways are there to pick 20 recreational drug items from: beers, joints, jolts, original bottles of coke (which contained cocaine) If you must have at least 2 beers, 3 joints, 1 jolt, & 3 cokes?

This is equivalent to asking how many different selections are there of 20 - 2 - 3 - 1 - 3 = 11 items: (11 + 4 - 1)C(4 - 1).