Pigeonhole Principle & The Inclusion-Exclusion principle

 https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_counting_theory.htm

https://tutorialspoint.dev/computer-science/engineering-mathematics/discrete-mathematics-the-pigeonhole-principle

Pigeonhole Principle

In 1834, German mathematician, Peter Gustav Lejeune Dirichlet, stated a principle which he called the drawer principle. Now, it is known as the pigeonhole principle.

Pigeonhole Principle states that if there are fewer pigeon holes than total number of pigeons and each pigeon is put in a pigeon hole, then there must be at least one pigeon hole with more than one pigeon. If n pigeons are put into m pigeonholes where n > m, there's a hole with more than one pigeon.

Examples

• Ten men are in a room and they are taking part in handshakes. If each person shakes hands at least once and no man shakes the same man’s hand more than once then two men took part in the same number of handshakes.

• There must be at least two people in a class of 30 whose names start with the same alphabet.

The Inclusion-Exclusion principle

The Inclusion-exclusion principle computes the cardinal number of the union of multiple non-disjoint sets. For two sets A and B, the principle states −

|A∪B|=|A|+|B|−|A∩B|$|A\cup B|=|A|+|B|-|A\cap B|$

For three sets A, B and C, the principle states −

|A∪B∪C|=|A|+|B|+|C|−|A∩B|−|A∩C|−|B∩C|+|A∩B∩C|$|A\cup B\cup C|=|A|+|B|+|C|-|A\cap B|-|A\cap C|-|B\cap C|+|A\cap B\cap C|$

The generalized formula -

|⋃ni=1Ai|=∑1≤i<j<k≤n|Ai∩Aj|+∑1≤i<j<k≤n|Ai∩Aj∩Ak|−⋯+(−1)\n−1|A1∩⋯∩A2|$|\bigcup _{i=1}^n{A}_i|=\sum _{1\le i<j<k\le n}|A_i\cap A_j|+\sum _{1\le i<j<k\le n}|A_i\cap A_j\cap A_k|-\cdots +(-1{)}^{\text{n}-1}|A_1\cap \cdots \cap A_2|$

Problem 1

How many integers from 1 to 50 are multiples of 2 or 3 but not both?

Solution

From 1 to 100, there are 50/2=25$50/2=25$ numbers which are multiples of 2.

There are 50/3=16$50/3=16$ numbers which are multiples of 3.

There are 50/6=8$50/6=8$ numbers which are multiples of both 2 and 3.

So, |A|=25$|A|=25$, |B|=16$|B|=16$ and |A∩B|=8$|A\cap B|=8$.

|A∪B|=|A|+|B|−|A∩B|=25+16−8=33$|A\cup B|=|A|+|B|-|A\cap B|=25+16-8=33$

Problem 2

In a group of 50 students 24 like cold drinks and 36 like hot drinks and each student likes at least one of the two drinks. How many like both coffee and tea?

Solution

Let X be the set of students who like cold drinks and Y be the set of people who like hot drinks.

So, |X∪Y|=50$|X\cup Y|=50$, |X|=24$|X|=24$, |Y|=36$|Y|=36$

|X∩Y|=|X|+|Y|−|X∪Y|=24+36−50=60−50=10$|X\cap Y|=|X|+|Y|-|X\cup Y|=24+36-50=60-50=10$

Hence, there are 10 students who like both tea and coffee.

https://tutorialspoint.dev/computer-science/engineering-mathematics/discrete-mathematics-the-pigeonhole-principle

Mathematics | The Pigeonhole Principle

Suppose that a flock of 20 pigeons flies into a set of 19 pigeonholes to roost. Because there are 20 pigeons but only 19 pigeonholes, a least one of these 19 pigeonholes must have at least two pigeons in it. To see why this is true, note that if each pigeonhole had at most one pigeon in it, at most 19 pigeons, one per hole, could be accommodated. This illustrates a general principle called the pigeonhole principle, which states that if there are more pigeons than pigeonholes, then there must be at least one pigeonhole with at least two pigeons in it.

 
Theorem –

I) If “A” is the average number of pigeons per hole, where A is not an integer then

• At least one pigeon hole contains ceil[A] (smallest integer greater than or equal to A) pigeons
• Remaining pigeon holes contains at most floor[A] (largest integer less than or equal to A) pigeons

Or

II) We can say as, if n + 1 objects are put into n boxes, then at least one box contains two or more objects.
The abstract formulation of the principle: Let X and Y be finite sets and let  be a function.

• If X has more elements than Y, then f is not one-to-one.
• If X and Y have the same number of elements and f is onto, then f is one-to-one.
• If X and Y have the same number of elements and f is one-to-one, then f is onto.

Pigeonhole principle is one of the simplest but most useful ideas in mathematics. We will see more applications that proof of this theorem.

• Example – 1: If (Kn+1) pigeons are kept in n pigeon holes where K is a positive integer, what is the average no. of pigeons per pigeon hole?

  Solution: average number of pigeons per hole = (Kn+1)/n
  = K + 1/n
  Therefore at least a pigeonholes contains (K+1) pigeons i.e., ceil[K +1/n] and remaining contain at most K i.e., floor[k+1/n] pigeons.
  i.e., the minimum number of pigeons required to ensure that at least one pigeon hole contains (K+1) pigeons is (Kn+1).

• Example – 2: A bag contains 10 red marbles, 10 white marbles, and 10 blue marbles. What is the minimum no. of marbles you have to choose randomly from the bag to ensure that we get 4 marbles of same color?

  Solution: Apply pigeonhole principle.
  No. of colors (pigeonholes) n = 3
  No. of marbles (pigeons) K+1 = 4
  Therefore the minimum no. of marbles required = Kn+1
  By simplifying we get Kn+1 = 10.
  Verification: ceil[Average] is [Kn+1/n] = 4
  [Kn+1/3] = 4
  Kn+1 = 10
  i.e., 3 red + 3 white + 3 blue + 1(red or white or blue) = 10

Pigeonhole principle strong form –

Theorem: Let q1, q2, . . . , qn be positive integers.
If q1+ q2+ . . . + qn – n + 1 objects are put into n boxes, then either the 1st box contains at least q1 objects, or the 2nd box contains at least q2 objects, . . ., the nth box contains at least qn objects.
 
Application of this theorem is more important, so let us see how we apply this theorem in problem solving.

• Example – 1: In a computer science department, a student club can be formed with either 10 members from first year or 8 members from second year or 6 from third year or 4 from final year. What is the minimum no. of students we have to choose randomly from department to ensure that a student club is formed?

  Solution: we can directly apply from the above formula where,
  q1 =10, q2 =8, q3 =6, q4 =4 and n=4
  Therefore the minimum number of students required to ensure department club to be formed is
  10 + 8 + 6 + 4 – 4 + 1 = 25

• Example – 2: A box contains 6 red, 8 green, 10 blue, 12 yellow and 15 white balls. What is the minimum no. of balls we have to choose randomly from the box to ensure that we get 9 balls of same color?

  Solution: Here in this we cannot blindly apply pigeon principle. First we will see what happens if we apply above formula directly.
  From the above formula we have get answer 47 because 6 + 8 + 10 + 12 + 15- 5 + 1 = 47
  But it is not correct. In order to get the correct answer we need to include only blue, yellow and white balls because red and green balls are less than 9. But we are picking randomly so we include after we apply pigeon principle.
  i.e., 9 blue + 9 yellow + 9 white – 3 + 1 = 25
  Since we are picking randomly so we can get all the red and green balls before the above 25 balls. Therefore we add 6 red + 8 green + 25 = 39
  We can conclude that in order to pick 9 balls of same color randomly, one has to pick 39 balls from a box.