The Pigeonhole Principle:

Slides:



Advertisements
Similar presentations
Chessboard problems You don’t have to know chess to solve them.
Advertisements

Introduction to Algorithms
Are You Smarter Than a 6 th Grader? Are You Smarter Than a 5 th Grader? 1,000,000 6th Grade 6th Grade Topic 1 6th Grade 6th Grade Topic 1 6th Grade Topic.
Slide 1 Insert your own content. Slide 2 Insert your own content.
Created by Inna Shapiro ©2008
Games Created by Inna Shapiro ©2008. Problem 1 There are two plates with 7 candies on each plate. Pooh and Tiger take turns removing any number of candies.
Created by Inna Shapiro ©2008 ! Problem 1 Two friends played chess for three hours. For how long did each of them play?
Logical Problems Created by Inna Shapiro ©2006. Problem1 In some month three Wednesdays fell on even dates. What day of week was the 18th of that month?
Positive and Negative Numbers X For a long time people had refused to believe in negative numbers. In our time, however, their existence is.
Even Numbers Created by Inna Shapiro ©2008 Problem 1 The sum of two integers is even. What is true about the product of those two integers? Is it even.
Criterions for divisibility The ancient Greeks knew criterions for divisibility by 2, 3, 5 and 9 in the third century B.C. In this presentation we will.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Chapters 1 & 2 Theorem & Postulate Review Answers
Plotting Points & Probability SOL 3.21/3.22 : Students will investigate probability as chance.
0 - 0.
Hosted By Prissy & Stephy Multiplying exponents Negative exponents Dividing exponent percents
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
Addition Facts
The Pigeon hole problem
CS CS1512 Foundations of Computing Science 2 Lecture 23 Probability and statistics (4) © J.
Brain Train LO: To recognise and draw reflections of shapes.
Who Wants To Be A Millionaire? Decimal Edition Question 1.
Bridging through 10 Learning objectives:
Homework Due See Supplemental Chapter 1. Read pages 3-end. #7-14, 16, 18, on pg 8 Tonight’s HW Ch. 4 Notes – read pages As you read, only fill.
Tutorial 2: First Order Logic and Methods of Proofs
10.2 Variables and Expressions
Turn in HW7 (put your name on it) Return HW6 –Avg: 77Adj Avg: 82.5Median: 85 –Emmanuel graded Section 3.1 (green) –Pascal graded Section 3.2 (red) –
Chapter 2.3 Counting Sample Points Combination In many problems we are interested in the number of ways of selecting r objects from n without regard to.
Lecture 7 Paradigm #5 Greedy Algorithms
Elapsed Time & Determining Start and End Times Mountain-Hill-Rock Strategy By Linda Ewonce.
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
Lecture 4 4.1,4.2 Counting. 4.1 Counting Two Important Principles: Product Rule and Sum Rule. Product Rule: Assume we need to perform procedure 1 AND.
The Pigeonhole Principle College of Information Technology & Design
X-box Factoring. Warm-Up Please complete these individually. 1. Fill in the following X-solve problems. a. b. c. 2. Write the general form of a quadratic.
Addition 1’s to 20.
Test B, 100 Subtraction Facts
X-box Factoring.
Editing Instructions Simply add a question and 4 possible answers by overtyping the white text. The green box on the next slide shows which answer should.
Week 1.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
X-box Factoring. X- Box 3-9 Product Sum Factor the x-box way Example: Factor 3x 2 -13x (3)(-10)= x 2x 3x 2 x-5 3x +2.
The Pigeonhole Principle Alan Kaylor Cline. The Pigeonhole Principle Statement Children’s Version: “If k > n, you can’t stuff k pigeons in n holes without.
CS Discrete Mathematical Structures
Epp, section 10.? CS 202 Aaron Bloomfield
The Pigeonhole Principle
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:
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,
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.
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
The Pigeonhole Principle
CS5371 Theory of Computation
Fall 2015 COMP 2300 Discrete Structures for Computation
The Pigeonhole (Dirichlet’s box) Principle
Symmetry Problem What is the sum of the values 1 to 100? Hint: Look for the symmetry!
5.2 The Pigeonhole Principle
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 Chapter 2 Pigeonhole Principle. 2 Summary Pigeonhole principle –simple form Pigeonhole principle –strong form Ramsey’s theorem.
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,
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.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
PIGEONHOLE PRINCIPLE.
PIGEONHOLE PRINCIPLE.
PIGEONHOLE PRINCIPLE.
PIGEONHOLE PRINCIPLE.
The Pigeonhole (Dirichlet’s box) Principle
The Pigeonhole Principle
Geometry 2 Level 1.
Presentation transcript:

The Pigeonhole Principle: Today’s subject is the pigeon hole principle. As we will see, this simple logical idea can be helpful in a lot of cases. Created by Inna Shapiro ©2006

The Pigeonhole Principle: If (k+1) or more objects are placed into k boxes, then there is at least one box containing two or more objects. holes objects To prove this statement, let us suppose that each box contains less than 2 objects; then the total number of objects would be less than k, contradiction.

Problem 1 15 tourists tried to hike the Washington mountain. The oldest of them is 33, while the youngest one is 20. Prove that there are 2 tourists of the same age.

Problem 2 Wizard told Dorothy that he would help her to get home, if she could create a magic 6x6 square with entries either “+1” or “-1”, so that all vertical, horizontal and diagonal sums would be different. Prove that the Wizard cannot help Dorothy, because there is no such square. -1 1

Problem 3 The ocean covers more than half of the Earth surface. Can you prove that there are two points in the ocean which are located on the exactly opposite ends of an Earth diameter?

Problem 4 There are 30 students in the classroom. Peter got the worth results on a test, and he made 13 mistakes. Can you prove that there are at least 3 students who all made the same number of mistakes (not necessarily 13)?

Problem 5 John has 30 socks in a box: 10 white, 10 red and 10 black. How many socks must he pull out without looking, in order to be guaranteed to have: 1)two socks of the same color 2) two black socks 3) two different socks

Problem 6 There are 380 students at Magic school. Prove that there are at least two students whose birthdays happen on a same day.

Problem 7 There are 4,000,000,000 humans in our world which are less than 100 years old. Prove that there are at least two persons that have been born at the same second.

Problem 8 A student drew 12 not parallel lines on the sheet of paper. Prove that there are at least two lines that make an angle of less than 15 degrees with one another.

Problem 9 A student has chosen 52 natural numbers. Prove that you can choose two from the list, so that either their sum or their difference would be divisible by 100.

Problem 10 65 students wrote three tests. The possible grades are: A, B, C and D. Prove that there are at least two of them who managed to get the same grades for all three tests.