27 - Pigeonhole Introduction Principle Discrete Mathematics Andrei Bulatov Discrete Mathematics Pigeonhole Principle Pigeonhole Principle If m

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction Pigeonhole Principle Discrete Mathematics Andrei Bulatov
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Pigeonhole Principle 27-2 Pigeonhole Principle If m pigeons occupy n pigeonholes and m > n, then at least one pigeonhole has two or more pigeons roosting in it.
Background image of page 2
Discrete Mathematics – Pigeonhole Principle 27-3 Examples Among any group of 367 (or more) people, there must be at least two with the same birthday, because there are only 366 possible birthdays In any group of 27 English words, there must be at least two that begin with the same letter, because there are 26 letter in the Latin alphabet A function f from a set with k + 1 elements to a set with k elements is not one-to-one
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Pigeonhole Principle 27-4 More Examples Recall that a number c is called the remainder of a when divided by n if -- 0 c < n -- a = k · n + c for some k Note that two numbers, a and b, have the same remainder when divided by n if a – b is divisible by n Among any group of n + 1 integers, there must be at least two with the same remainder when divided by n
Background image of page 4
Discrete Mathematics – Pigeonhole Principle 27-5 More Examples For every integer n there is a multiple of n that has only zeros and ones in its decimal expansion Solution: Let n be a positive integer. Consider the n + 1 integers 1, 11, 111, … , 11…1 (where the last integer in this list is the integer with n + 1 ones in its decimal expansion). At least two of them have the same remainder when divided by n. Let they have the form
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/14/2011 for the course MACM 101 taught by Professor Pearce during the Spring '08 term at Simon Fraser.

Page1 / 14

27 - Pigeonhole Introduction Principle Discrete Mathematics Andrei Bulatov Discrete Mathematics Pigeonhole Principle Pigeonhole Principle If m

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online