The Pigeonhole Principle 6/11/20151. The Pigeonhole Principle In words: –If n pigeons are in fewer than n pigeonholes, some pigeonhole must contain at.

Slides:

Advertisements

Similar presentations

The Pigeon hole problem

Advertisements

22C:19 Discrete Math Counting Fall 2011 Sukumar Ghosh.

MAT 2720 Discrete Mathematics

The Pigeonhole Principle College of Information Technology & Design

Practice Quiz 3 Recursive Definitions Relations Basic Counting Pigeonhole Principle Permutations & Combinations Discrete Probability.

COUNTING AND PROBABILITY

Application: The Pigeonhole Principle Lecture 37 Section 7.3 Wed, Apr 4, 2007.

Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.

Quiz highlights Probability of the song coming up after one press: 1/N. Two times? Gets difficult. The first or second? Or both? USE THE MAIN HEURISTICS:

Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =

Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.

PIGEONHOLE PRINCIPLE. Socks You have a drawer full of black and white socks. Without looking in the drawer, how many socks must you pull out to be sure.

Assume f: A  B and g: B  C are functions. Which are defined? (1) f  g (2) g  f(3) both(4) neither.

Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.

Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.

Functions f( ) = A B Lecture 15: Nov 4.

Costas Busch - RPI1 Standard Representations of Regular Languages Regular Languages DFAs NFAs Regular Expressions Regular Grammars.

Discrete Math for CS Chapter 5: Functions. Discrete Math for CS New Relation Operations: Given R, a relation on A x B, we define the inverse relation,

Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.

Fall 2015 COMP 2300 Discrete Structures for Computation

Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.

1 Lecture 3 (part 2) Functions – Pigeonhole Principle Reading: Epp Chp 7.4.

1 Relations and Functions Chapter 5 1 to many 1 to 1 many to many.

Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.

Lecture 6: Signal Processing III EEN 112: Introduction to Electrical and Computer Engineering Professor Eric Rozier, 2/25/13.

Week 7 - Friday.  What did we talk about last time?  Set disproofs  Russell’s paradox  Function basics.

Math 170 Project #11 Part 2 Jeffrey Martinez Bianca Orozco Omar Monroy.

Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.

3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.

Elements of Combinatorics (Continuation) 1. Pigeonhole Principle Theorem. If pigeons are placed into pigeonholes and there are more pigeons than pigeonholes,

Symmetry Problem What is the sum of the values 1 to 100? Hint: Look for the symmetry!

Functions Reading: Chapter 6 (94 – 107) from the text book 1.

Chapter 5 – Relations and Functions. 5.1Cartesian Products and Relations Definition 5.1: For sets A, B  U, the Cartesian product, or cross product, of.

R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 4 Counting methods and the pigeonhole principle.

CSNB143 – Discrete Structure

CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.

WEEK 1 You have 10 seconds to name…

Discrete Structures Combinations. Order Doesn’t Matter In the previous section, we looked at two cases where order matters: Multiplication Principle –

5.2 The Pigeonhole Principle

Discrete Structures Counting (Ch. 6)

Menu Traditional Menu Other Menu Nasi LemakBeef Burger Roti Canai Potatoes Chip Capati French Bread Mee Goreng Drink : Coffee, Tea, Coke and Pepsi.

1 Chapter 2 Pigeonhole Principle. 2 Summary Pigeonhole principle –simple form Pigeonhole principle –strong form Ramsey’s theorem.

Chapter 7 – Counting Techniques CSNB 143 Discrete Mathematical Structures.

1 The Pigeonhole Principle CS 202 Epp section 7.3.

 2. Inverse functions  Inverse relation,  Function is a relation  Is the function’s inverse relation a function? No  Example: A={1,2,3},B={a,b}, f:A→B,

1 The Pigeonhole Principle CS 202 Epp section ??? Aaron Bloomfield.

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,

Nonregular Languages How do you prove a language to be regular? How do you prove a language to be nonregular? A Pumping Lemma.

Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.

Pigeonhole Principle. If n pigeons fly into m pigeonholes and n > m, then at least one hole must contain two or more pigeons A function from one finite.

Main Menu Main Menu (Click on the topics below) Pigeonhole Principle Example Generalized Pigeonhole Principle Example Proof of Pigeonhole Principle Click.

Probability and Counting Exercises

Comparing Numbers Reading the signs from left to right

CSNB 143 Discrete Mathematical Structures

Formal Language & Automata Theory

The Pigeonhole Principle

Standard Representations of Regular Languages

The Pigeonhole Principle

9. Counting and Probability 1 Summary

CS 2210 Discrete Structures Counting

Order of Operations in Math

פחת ורווח הון סוגיות מיוחדות תהילה ששון עו"ד (רו"ח) ספטמבר 2015

Non-regular languages

The Pigeonhole Principle

The Pigeonhole (Dirichlet’s box) Principle

The Pigeonhole Principle

The Pigeon hole problem

Miniconference on the Mathematics of Computation

Presentation transcript:

The Pigeonhole Principle 6/11/20151

The Pigeonhole Principle In words: –If n pigeons are in fewer than n pigeonholes, some pigeonhole must contain at least two pigeons 6/11/ What is n?

The Pigeonhole Principle In math: 6/11/2015 3

The Pigeonhole Principle What is a set? a finite set? What is |A|? What is a function? the domain of a function? the codomain of a function? Why say “distinct”? 6/11/2015 4

Applications of The Pigeonhole Principle In any group of 8 people, two were born on the same day of the week What are the “pigeons” and what are the “pigeonholes”? A = the set of people, B = {Sun, … Sat}, f(a) = the day of the week on which a was born 6/11/2015 5

Applications of The Pigeonhole Principle Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds. 6/11/ DDDDD DDDDD DDDDD DDDDD DDDDD

Applications of The Pigeonhole Principle Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds. 6/11/ DDDDD DDDDD DDDDD DDDDD DDDDD

Applications of The Pigeonhole Principle Suppose each pigeonhole contains one bird, and every bird moves to an adjacent square (up, down, left or right). Show that no matter how this is done, some pigeonhole winds up with at least 2 birds. 6/11/ DDDDD DDDDD DDDDD DDDDD DDDDD