pigeon-hole principle ( php )
DESCRIPTION
Pigeon-Hole Principle ( PHP ). A Simple Idea in Combinatorics But Very Powerfull and Usefull. Ilustration. 1. 2. 3. 4. 5. Theorem. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/1.jpg)
1
Pigeon-Hole Principle( PHP )
A Simple Idea in Combinatorics
ButVery Powerfull and
Usefull
![Page 2: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/2.jpg)
2
Ilustration
![Page 3: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/3.jpg)
Theorem
3
Let n and k be positif integer, and n > k. Suppose we have to place n identical balls into k identical boxes. Then there will be at least one box in which we place at least two balls.
![Page 4: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/4.jpg)
For warmup we begin with simple problems
without solution
4
1.Among three persons, there are two of the same sex.
2.Among 13 persons, there are two born in the same month.
3.Among 400 persons, there are a least two have the same birthday.
![Page 5: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/5.jpg)
Example 1
5
In tournament with n players , everybody plays with everybody else exactly once. Prove that during the game there are always two players who have played the same number of game.
![Page 6: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/6.jpg)
Proof
6
The difficulties in proving with pigeon-hole principle is the identification of the ball and the box .
Then the question is . . .What is the box?
What is the ball?
![Page 7: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/7.jpg)
Proof
7
The number of players is n. And the number of possibilities for the number of game finished by any one player are
0, 1, 2, . . . , n-1.But the fact , however 0 and n-1 cannot both occur among the numbers of games finished by the players at any one time.
![Page 8: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/8.jpg)
Proof
8
Then, takeThe number of players ( n ) as balls
andThe number of game finished by one player ( n-1 ) as boxes. By PHP we get, there are two players that have the same number of the game.
![Page 9: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/9.jpg)
Example 2
9
(ONMIPA 2010) Let S is a set of n positive integer. Prove that there exist an element in S or sum of elements in S that divisible by n.
![Page 10: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/10.jpg)
Proof
10
Suppose the elements in S are{ a1, a2, a3, . . ., an } not necessary distinct
If there is an element in S divisible by n, we are done.Otherwise, none of them is divisible by n.Consider the Set T = { s1, s2, s3, . . ., sn }Where,
sn = a1 + a2 + . . . + an
![Page 11: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/11.jpg)
Proof
11
If there is i, 1≤ i ≤ n such that si is divisible by n, we are finished. So, assum all of si is not divisible by n. Then we get, the remainder if si divided by n are 1, 2, 3, . . . , n-1There are n-1 possibilities but as we have n numbers, by PHP there are two numbers that have the same remainder.
![Page 12: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/12.jpg)
Proof
12
Without loss of generality, assum these numbers are si and sj where i < j.Then
sj – si = ai + ai+1 + . . . + aj
is divisible by n as desired.
![Page 13: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/13.jpg)
Example 3
13
(ONMIPA 2009) We select n+1 different integers from the set { 1, 2, 3, … 2n }. Prove that there always be two among the selected integers such that one is divisible by other.
![Page 14: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/14.jpg)
Hint.
14
Write the numbers 1, 2, 3, . . . , 2nin the form
2p.awhere,a is odd number andp ≥ 0, p integer
Then used PHP to prove the statement.
![Page 15: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/15.jpg)
Problem Solving can be learn ONLY by Solving
Problems
Thanks15
REMEMBER
![Page 16: Pigeon-Hole Principle ( PHP )](https://reader035.vdocuments.us/reader035/viewer/2022062422/56813df3550346895da7cfa2/html5/thumbnails/16.jpg)
16
This presentation is wrote by Tutur Widodo,
In April 2010
Hi…hi…hi…!