Distributions.

Slides:



Advertisements
Similar presentations
Generalized Permutations & Combinations: Selected Exercises.
Advertisements

The Pigeonhole Principle
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
Recursively Defined Functions
The Pigeonhole Principle
Chapter 5 Section 4 The Multiplication Principle.
Talking Letters Consonants Lessons 1 - 5
Permutation and Combination
Math 106 – Exam #3 - Review Problems 1. (a) (b) (c) (d) A room contains 90 men where 25 are wearing a hat, 34 are wearing a coat, 33 are wearing a pair.
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,
The Pigeonhole Principle
Chapter 9 Generating functions Yen-Liang Chen Dept of Information Management National Central University.
Chapter 6.1 Generating Functions
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.
Arrangements & Selections with Repetition
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.
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
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 20, Monday, October 20.
Tucker, Section 5.41 Section 5.4 Distributions By Colleen Raimondi.
Permutations and Combinations
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
These letters are the kings and queens of Alphabet School.
More Counting Lecture 13 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.
More Counting Lecture 16: Nov 9 A B …… f. This Lecture We will study how to define mappings to count. There will be many examples shown. Bijection rule.
Review of 5.1, 5.3 and new Section 5.5: Generalized Permutations and Combinations.
Any well-defined collection of objects and each object of the collection is an element or member of the set.
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
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Chapter 3 Permutations and combinations
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Elementary Combinatorics Combinatorics  Deals with enumeration (counting) techniques and related algebra.  Basis of counting XSet |X|No. of elements.
COMBINATIONS AND PERMUTATIONS
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Counting Methods Topic 4: Permutations with Restrictions.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
There are 3 horses (labeled A, B and C) racing for different places. Draw tree diagram to show 1. In how many ways can the horses be placed as 1 st, 2.
Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Elimination Round 3 2 nd Annual WSMA Math Bowl April 28, 2012 This test material is copyright © 2012 by the Washington Student Math Association and may.
When all the objects are not distinct objects
Discrete Mathematics Lecture # 25 Permutation & Combination.
Name _____________________________________________ Week of__________________ Find the matching stamp and stamp your letter in the box.
11.1C Finding the Number of Permutations….. with Repeats
Counting.
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
TODAY WE ARE GOING TO PLAY….. “NAME THAT PROPERTY!”
CS Lecture 8 Developing Your Counting Muscles.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Chapter 9.
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.
Distributions. Basic Model for Distributions of Distinct Objects The following problems are equivalent: Distributing n distinct objects into b distinct.
Football Neil Marco and Cooper Fox. FACT 1 The line judge is in charge of timing the game. The line judge is in charge of timing the game.
The Pigeonhole Principle. Pigeonhole principle The pigeonhole principle : If k is a positive integer and k+1 or more objects are placed into k boxes,
Main Menu Main Menu (Click on the topics below) Pigeonhole Principle Example Generalized Pigeonhole Principle Example Proof of Pigeonhole Principle Click.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Counting Overview ICS 6D Sandy Irani. Balls into Bins Distinguishable Balls Indistinguishable Balls No restrictions on the number of balls per bin At.
UNIT 5 Fundamental principles of counting
Counting by Complement and the Inclusion/Exclusion Principle
Today we are going to play…..
COCS DISCRETE STRUCTURES
Generalized Permutations & Combinations: Selected Exercises
Permutations and Combinations
Permutations and Combinations
Arrangements & Selections with Repetition
Arrangements & Selections with Repetition
Section 12.8 The Counting Principle and Permutations
The Counting Principle and Permutations
More Counting A B … f Lecture 16: Nov 9.
I have 0 Jelly Beans I need Jelly Beans.
Presentation transcript:

Distributions

Basic Model for Distributions of Distinct Objects The following problems are equivalent: Distributing n distinct objects into b distinct boxes Stamping 1 of the b different box numbers on each of the n distinct objects. There are bn such distributions. If bi objects go in box i, then there are P(n; b1, b2, …, bb) distributions.

Basic Model for Distributions of Identical Objects The following problems are equivalent: Distribute n identical objects into b distinct boxes Draw n objects with repetition from b object types. There are (n + b - 1)Cn such distributions of the n identical objects.

Example 1 A quarterback of a football team has a repertoire of 20 plays, and executes 60 plays per game. A frequency distribution is a graph of how many time each play was called during a game. How many frequency distributions are there?

Example 2 How many ways are there to assign 1,000 “Justice” Department lawyers to 5 different antitrust cases? How many, if 200 lawyers are assigned to each case?

Example 3 How many ways are there to distribute 40 identical jelly beans among 4 children: Without restriction? With each child getting 10 beans? With each child getting at least 1 bean?

Example 3 How many ways are there to distribute 40 identical jelly beans among 4 children: Without restriction? (40 + 4 - 1)C40 With each child getting 10 beans? 1 With each child getting at least 1 bean? (40 - 4 + 4 - 1)C(4 - 1)

Example 4 How many ways are there to distribute: 18 chocolate doughnuts 12 cinnamon doughnuts 14 powdered sugar doughnuts among 4 policeman, if each policeman gets at least 2 doughnuts of each kind?

Example 4 It is the same number of ways to distribute: 18 - 8 chocolate doughnuts 12 - 8 cinnamon doughnuts 14 - 8 powdered sugar doughnuts among 4 policeman without restriction.

Example 4 It is the same number of ways to distribute among 4 policeman without restriction : 18 - 8 chocolate doughnuts C(10 + 4 - 1, 4 - 1) 12 - 8 cinnamon doughnuts C(4 + 4 - 1, 4 - 1) 14 - 8 powdered sugar doughnuts C(6 + 4 - 1, 4 - 1)

Example 5 How many ways are there to arrange the 26 letters of the alphabet so that no pair of vowels appear consecutively? (Y is considered a consonant).

Example 5 How many ways are there to arrange the 26 letters of the alphabet with no pair of vowels appearing consecutively? (Y is a consonant). There are 6 boxes around the vowels. The interior 4 have at least 1 consonant. Use the product rule: Arrange the vowels: 5! Distribute the consonant positions among the 6 boxes: C(21 - 4 + 6 - 1, 6 - 1) Arrange the consonants: 21!

Example 6 How many integer solutions are there to x1 + x2 + x3 = 0, with xi  -5?

Example 6 How many integer solutions are there to x1 + x2 + x3 = 0, with xi  -5? The same as that for x1 + x2 + x3 = 15, with xi  0.

Example 7 How many ways are there to distribute k balls into n distinct boxes (k < n) with at most 1 ball in any box, if: The balls are identical? The balls are distinct?

Example 8 How many arrangements of MISSISSIPPI are there with no consecutive Ss?

Example 8 How many arrangements of MISSISSIPPI are there with no consecutive Ss? There are 5 boxes around the 4 Ss. The middle 3 have at least 1 letter. Use the product rule: Distribute the positions of the non-S letters among the 5 boxes. Arrange the non-S letters.

Example 9 How many ways are there to distribute 8 balls into 6 distinct boxes with the 1st 2 boxes collectively having at most 4 balls, if: The balls are identical?

Example 9 How many ways are there to distribute 8 balls into 6 distinct boxes with the 1st 2 boxes collectively having at most 4 balls, if: The balls are identical? Partition the distributions into sets where the 1st 2 boxes have exactly k balls, for k = 0, …, 4.

Example 9 How many ways are there to distribute 8 balls into 6 distinct boxes with the 1st 2 boxes collectively having at most 4 balls, if: The balls are distinct?

Example 9 How many ways are there to distribute 8 balls into 6 distinct boxes with the 1st 2 boxes collectively having at most 4 balls, if: The balls are distinct? Partition the distributions into sets where the 1st 2 boxes have exactly k balls, for k = 0, …, 4. For each k: pick the balls that go into the 1st 2 boxes distribute them; distribute the 8 - k other balls into the other 4 boxes.