More counting + pigeonhole principle BT Section 1.6, Rosen, Section - PowerPoint PPT Presentation

More counting + pigeonhole principle BT Section 1.6, Rosen, Section 7.5 Inclusion-exclusion

review Permutations: Number of ways to order n distinct objects. n ! = n · ( n − 1) · · · 2 · 1 Combinations: Number of ways to choose r things from n things ✓ n ◆ n ! = r !( n − r )! r

quick review of cards • 52 total cards • 13 different ranks : 2,3,4,5,6,7,8,9,10,J,Q,K,A • 4 different suits : Hearts, Clubs, Diamonds, Spades

the sleuth’s criterion (Rudich) For each object constructed it should be possible to reconstruct the unique sequence of choices that led to it! Example: How many ways are there to choose a 5 card hand that contains at least 3 aces? ✓ 4 ◆ ✓ 49 ◆ Choose 3 aces, then choose 2 · cards from remaining 49. 3 2

the sleuth’s criterion (Rudich) For each object constructed it should be possible to reconstruct the unique sequence of choices that led to it! Example: How many ways are there to choose a 5 card hand that contains at least 3 aces? ✓ 4 ◆ ✓ 49 ◆ Choose 3 aces, then choose 2 · cards from remaining 49. 3 2 ✓ 4 ◆ ✓ 48 ◆ ✓ 4 ◆ ✓ 48 ◆ + · · 3 2 4 1

counting cards ✓ 52 ◆ • How many possible 5 card hands? 5 • A “straight” is five consecutive rank cards of any suit. How many possible straights? 10 · 4 5 = 10 , 240 • How many flushes are there? ✓ 13 ◆ 4 · = 5 , 148 5

more counting cards • How many straights that are not flushes? 10 · 4 5 − 10 · 4 = 10 , 200 • How many flushes that are not straights? ✓ 13 ◆ 4 · − 10 · 4 = 5 , 108 5

inclusion/exclusion principle A A B C B |A ∪ B ∪ C| = |A ∪ B| = |A| + |B| + |C| |A|+|B|-|A ∩ B| -|A ∩ B|-|A ∩ C|-|B ∩ C| + |A ∩ B ∩ C| General: + singles - pairs + triples - quads + ...

more counting cards • How many hands have at least three cards of one rank ( three of a kind )? ✓ 4 ◆ ✓ 48 ◆ 13 · + 13 · 48 = 59 , 280 · 3 2 • How many hands are straights or flushes or three of a kind? Inclusion/exclusion: Flushes + Straights + 3OfKind – (Flushes AND Straights) – (Flushes AND 3OfKind) – (Straights AND 3OFKind) + (Flushes AND Straights AND 3OfKind)

pigeonhole principle

pigeonhole principle If there are n pigeons in k holes and n > k , then some hole contains more than one pigeon . d n/k e More precisely, some hole contains at least pigeons. Prove that there are two people in London who have the same number of hairs on their head. - Londoners have between 0 and 999,999 hairs on their heads. - There are more than 1,000,000 people in London …

friending pigeons There are many people in this room, some of whom are friends, some of whom are not … Prove that some two people have the same number of friends. Pigeons: Pigeonholes: Rule for assigning pigeon to pigeonhole:

More counting + pigeonhole principle BT Section 1.6, Rosen, Section - PowerPoint PPT Presentation

More counting + pigeonhole principle BT Section 1.6, Rosen, Section 7.5 Inclusion-exclusion review Permutations: Number of ways to order n distinct objects. n ! = n ( n 1) 2 1 Combinations: Number of ways to choose r things

CS 210 Foundations of Computer Science Debdeep Mukhopadhyay Counting-II Pigeonhole Principle

Lecture 25: The Pigeonhole Principle, Permutations and Combinations Dr. Chengjiang Long

Section 6. 2 The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19

Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 1.

Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Winter 2019 Prof. Tesler Ch. 1.

CS 220: Discrete Structures and their Applications counting by complement, inclusion exclusion,

Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of

Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of

The pigeonhole principle Marymount Manhattan College April 14, 2010 Outline Introduction 1

Counting Rules, etc Product Rule Generalized Product Rule Division Rule Bijection

Unit #6: Hash functions and the Pigeonhole principle CPSC 221: Algorithms and Data Structures

Lower bounds for width-restricted with Lemmas The Pigeonhole clause learning Principle The

Fundamental Principle of Counting Theorem 1 (Fundamental Principle of Counting) . If we have to

Counting CS1200, CSE IIT Madras Meghana Nasre March 26, 2020 CS1200, CSE IIT Madras Meghana

Counting CS1200, CSE IIT Madras Meghana Nasre April 2, 2020 CS1200, CSE IIT Madras Meghana

Counting Multiplication Principle: Two finite sets A and B . Count the number of pairs { ( a , b )

PIGEON HOLE PRINCIPLE Pigeon Hole Principle If f : [ m ] [ n ] then there exists i [ n ]

EHEALTH COMMISSION MEETING DECEMBER 12TH, 2018 DECEMBER AGENDA Call to Order Roll Call and

Lecture 9: The CKY parsing algorithm Julia Hockenmaier juliahmr@illinois.edu 3324 Siebel

Counting First rule of counting: Product Rule If S is a set of sequences of length k for

and let f : N - n > r = IRl, I N 1 = R be a mapping. Then there exists some a E R with 1 f

If it takes a pigeon only 75% as much energy to fly over land as over water, what path will it

Functions Jason Filippou CMSC250 @ UMCP 06-22-2016 Jason Filippou (CMSC250 @ UMCP) Functions

Comparison of Pixel Correlation Induced by Space-Filling Curves on 2D Image Data Stphane

More counting + pigeonhole principle BT Section 1.6, Rosen, Section - PowerPoint PPT Presentation

More counting + pigeonhole principle BT Section 1.6, Rosen, Section 7.5 Inclusion-exclusion review Permutations: Number of ways to order n distinct objects. n ! = n ( n 1) 2 1 Combinations: Number of ways to choose r things

CS 210 Foundations of Computer Science Debdeep Mukhopadhyay Counting-II Pigeonhole Principle

Lecture 25: The Pigeonhole Principle, Permutations and Combinations Dr. Chengjiang Long

Section 6. 2 The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19

Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 1.

Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Winter 2019 Prof. Tesler Ch. 1.

CS 220: Discrete Structures and their Applications counting by complement, inclusion exclusion,

Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of

Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of

The pigeonhole principle Marymount Manhattan College April 14, 2010 Outline Introduction 1

Counting Rules, etc Product Rule Generalized Product Rule Division Rule Bijection

Unit #6: Hash functions and the Pigeonhole principle CPSC 221: Algorithms and Data Structures

Lower bounds for width-restricted with Lemmas The Pigeonhole clause learning Principle The

Fundamental Principle of Counting Theorem 1 (Fundamental Principle of Counting) . If we have to

Counting CS1200, CSE IIT Madras Meghana Nasre March 26, 2020 CS1200, CSE IIT Madras Meghana

Counting CS1200, CSE IIT Madras Meghana Nasre April 2, 2020 CS1200, CSE IIT Madras Meghana

Counting Multiplication Principle: Two finite sets A and B . Count the number of pairs { ( a , b )

PIGEON HOLE PRINCIPLE Pigeon Hole Principle If f : [ m ] [ n ] then there exists i [ n ]

EHEALTH COMMISSION MEETING DECEMBER 12TH, 2018 DECEMBER AGENDA Call to Order Roll Call and

Lecture 9: The CKY parsing algorithm Julia Hockenmaier juliahmr@illinois.edu 3324 Siebel

Counting First rule of counting: Product Rule If S is a set of sequences of length k for

and let f : N - n &gt; r = IRl, I N 1 = R be a mapping. Then there exists some a E R with 1 f

If it takes a pigeon only 75% as much energy to fly over land as over water, what path will it

Functions Jason Filippou CMSC250 @ UMCP 06-22-2016 Jason Filippou (CMSC250 @ UMCP) Functions

Comparison of Pixel Correlation Induced by Space-Filling Curves on 2D Image Data Stphane

and let f : N - n > r = IRl, I N 1 = R be a mapping. Then there exists some a E R with 1 f