MAT 2720 Discrete Mathematics

Slides:



Advertisements
Similar presentations
Tutorial 2: First Order Logic and Methods of Proofs
Advertisements

22C:19 Discrete Math Counting Fall 2011 Sukumar Ghosh.
This trick relies on three nice ideas from discrete mathematics: pigeonhole principle 5 pigeons (cards) in 4 holes (suits) means at least two pigeons are.
The Pigeonhole Principle College of Information Technology & Design
MAT 3749 Introduction to Analysis Section 2.1 Part 1 Precise Definition of Limits
CS Discrete Mathematical Structures
CMPS 2433 Chapter 8 Counting Techniques Midwestern State University Dr. Ranette Halverson.
MAT 1234 Calculus I Section 1.4 The Tangent and Velocity Problems
MAT 1221 Survey of Calculus Exam 1 Info
COUNTING AND PROBABILITY
Application: The Pigeonhole Principle Lecture 37 Section 7.3 Wed, Apr 4, 2007.
3.5 Paradox  1.Russell’s paradox  A  A, A  A 。  Russell’s paradox: Let S={A|A  A}. The question is, does S  S?  i.e. S  S or S  S?  If S  S,
Moody Mathematics $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400.
The Pigeonhole Principle 6/11/ The Pigeonhole Principle In words: –If n pigeons are in fewer than n pigeonholes, some pigeonhole must contain at.
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
Costas Busch - RPI1 Standard Representations of Regular Languages Regular Languages DFAs NFAs Regular Expressions Regular Grammars.
1 Non-regular languages. 2 Regular languages Non-regular languages.
Discrete Mathematics Lecture 7 Harper Langston New York University.
1 The Pigeonhole Principle CS/APMA 202 Rosen section 4.2 Aaron Bloomfield.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th edition) Kenneth H. Rosen Chapter 4 Counting.
Fall 2015 COMP 2300 Discrete Structures for Computation
Discrete Maths Objective to introduce some of the counting rules (product, sum, subtraction, division, pigeonhole) through examples , Semester 2,
MAT 2720 Discrete Mathematics Section 6.1 Basic Counting Principles
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
Math 170 Project #11 Part 2 Jeffrey Martinez Bianca Orozco Omar Monroy.
Thursday, April 3, 2014MAT 312. Thursday, April 3, 2014MAT 312.
Tuesday, April 22, 2014MAT 312. Tuesday, April 22, 2014MAT 312.
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!
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 4 Counting methods and the pigeonhole principle.
CS201: Data Structures and Discrete Mathematics I
MAT 2720 Discrete Mathematics Section 3.1 Functions
CSNB143 – Discrete Structure
Moody Mathematics $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400.
MAT 125 – Applied Calculus Exponential Functions as Mathematical Models.
Discrete Structures Combinations. Order Doesn’t Matter In the previous section, we looked at two cases where order matters: Multiplication Principle –
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
MAT 2720 Discrete Mathematics Section 2.2 More Methods of Proof Part II
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
1 The Pigeonhole Principle CS 202 Epp section 7.3.
MAT 2720 Discrete Mathematics Section 3.3 Relations
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.
ECE 3323 Principles of Communication Systems Section 3.2 Fourier Transform Properties 1.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Formal Language & Automata Theory
The Pigeonhole Principle
Standard Representations of Regular Languages
Introduction to Combinatorics
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
The Pigeonhole Principle
CS 2210 Discrete Structures Counting
Lecture 08 Counting Profs. Koike and Yukita
Lial/Hungerford/Holcomb: Mathematics with Applications 10e
DNA Implementation of Theorem Proving
NDA Coaching in Chandigarh
Дискретне математичке структуре
X-STANDARD MATHEMATICS ONE MARK QUESTIONS
The Pigeonhole Principle
Mathematical Models: Building Functions
Test Booklet- begin on page 4 Answer Booklet- pages 5-9 questions 1-26
The Pigeonhole Principle
Sullivan Algebra and Trigonometry: Section 13.4
Lial/Hungerford/Holcomb: Mathematics with Applications 10e Finite Mathematics with Applications 10e Copyright ©2011 Pearson Education, Inc. All right.
DISCRETE COMPUTATIONAL STRUCTURES
Miniconference on the Mathematics of Computation
Chapter 5: Graphs & Functions
Presentation transcript:

MAT 2720 Discrete Mathematics Section 6.8 The Pigeonhole Principle http://myhome.spu.edu/lauw

Goals The Pigeonhole Principle (PHP) First Form Second Form

The Pigeonhole Principle (First Form) If n pigeons fly into k pigeonholes and k<n, some pigeonhole contains at least two pigeons.

Example 1 Prove that if five cards are chosen from an ordinary 52- card deck, at least two cards are of the same suit.

Example 1 Prove that if five cards are chosen from an ordinary 52- card deck, at least two cards are of the same suit.

Example 1 Prove that if five cards are chosen from an ordinary 52- card deck, at least two cards are of the same suit. We can think of the 5 cards as 5 pigeons and the 4 suits as 4 pigeonholes. By the PHP, some suit ( pigeonhole) is assigned to at least two cards ( pigeons).

Example 1 Prove that if five cards are chosen from an ordinary 52- card deck, at least two cards are of the same suit. Formal Solutions:

The Pigeonhole Principle (Second Form)

Example 2 If 20 processors are interconnected, show that at least 2 processors are directly connected to the same number of processors.

MAT 2720 Discrete Mathematics Section 7.2 Solving Recurrence Relations http://myhome.spu.edu/lauw

Goals Recurrence Relations (RR) Classwork Definitions and Examples Second Order Linear Homogeneous RR with constant coefficients Classwork

*Additional Materials… We will cover some additional materials that may not make senses to all of you. They are for educational purposes only, i.e. will not appear in the HW/Exam

2.5 Example 3 Fibonacci Sequence is defined by

2.5 Example 3 Fibonacci Sequence is an example of RR.

Recurrence Relations (RR)

Example 1: Population Model (1202) Suppose a newly-born pair of rabbits, one male, one female, are put in a field. Rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits. Suppose that our rabbits never die and that the female always produces one new pair (one male, one female) every month from the second month on. How many pairs will there be in one year?

Visa Card Commercial Illustrations

Example 1: Population Model (1202)

Example 2(a) A person invests $ 1000 at 12 percent interest compounded annually. If An represents the amount at the end of n years, find a recurrence relation and initial conditions that define the sequence {An}.

Example 2(b) A person invests $ 1000 at 12 percent interest compounded annually. Find an explicit formula for An.

Example 2(c)* RR is closed related to recursions / recursive algorithms

Example 2(c)* RR is closed related to recursions / recursive algorithms Recursions are like mentally ill people….

Example 1 Fibonacci Sequence How to find an explicit formula?

Definitions Second Order Linear Homogeneous RR with constant coefficients

Example 3 Solve

Recall Example 2 A person invests $ 1000 at 12 percent interest compounded annually.

Example 3 Solve From last the example, it makes sense to attempt to look for solutions of the form Where t is a constant.

Expectations You are required to clearly show how the system of equations are being solved.

Verifications How do I check that my formula is (probably) correct?

Generalized Method The above method can be generalized to more situations and by-pass some of the steps.

Theorem Second Order Linear Homogeneous RR with constant coefficients Characteristic Equation 1. Distinct real roots t1,t2 : 2. Repeated root t :

Example 4 Solve

*The Theorem looks familiar? Where have you seem a similar theorem?