Questions tagged [pigeonhole-principle]

This tag is for questions involving the Pigeonhole Principle, which roughly states that if $n$ items are placed in $m$ containers and $n>m$, then at least one container has more than one item.

The Pigeonhole Principle roughly states that if $n$ items (e.g. pigeons) are placed in $m$ containers (e.g. pigeonholes) and $n>m,$ then at least one container has more than one item. Stated more formally, the Pigeonhole Principle asserts that there is no injective function whose codomain has smaller cardinality than its domain.

An example application of the Pigeonhole Principle is a demonstration that if five points are placed on a sphere, then there must be some hemisphere which contains at least four of these points: any two points define a great circle, which divides the sphere into two hemispheres. By the Pigeonhole Principle, one of these two hemispheres must contain at least two points. This hemisphere then contains four of the five points (the two on the boundary, and the two found via the Pigeonhole Principle).

1565 questions
1
vote
2 answers

Bit strings (pigeonhole principle)

Here is how the question is posed: Let $s_1$, $s_2$, $s_3, \ldots, s_{90}$ be 90 bit strings of length nine or less. Prove that there exist two strings $s_i$ and $s_j$ with $i \neq j$ that contain the same number of 0s and the same number of 1s…
1
vote
2 answers

Pigeon Hole Principle on a set of n elements

Homework question: It is asking us to prove that if we have $\frac{n}{2} + 1$ integers selected from a set$ A = {1, 2, ..., n}$, $n$ being an even integer, then the selection includes integers $x$ and $y$ such that the gcd of $x$ and $y$ is 1. It…
Evan
  • 375
1
vote
1 answer

Pigeon hole principle?

A guy reads a book. He read for 81 hours last 10 days. Prove that there has been two consecutive days when he read for at least 17 hours. 81 hours / 10 days equals 8,1 hour a day. 2 * 8,1 = 16,2. It isn't 17 hours or I'm missing something. Any…
lvi
  • 289
1
vote
1 answer

Pigeonhole Principle Discrete Math

At a dinner party there are 8 guests. The dinner takes place a table shaped like a regular octagon. Each edge has a place setting labeled with the name of a different guest. Originally each person sits in the wrong place. Explain why the table can…
Adam
  • 223
1
vote
1 answer

Arangement of six circles in a plane

Six circles (including their circumferences and interiors) are arranged in the plane so that no one of them contains the center of another. Prove that they [the six circles] cannot have a point in common. This should be solved by application of…
VividD
  • 15,966
1
vote
1 answer

650 points inside a circle of radius 16

There are 650 points inside a circle of radius 16. Prove there exists a ring with inner radius 2 and outer radius 3 covering 10 of these points. Hint of the professor: Use Dirichlet's (pigeonhole) principle. EDIT: (after the solution became known)…
VividD
  • 15,966
1
vote
2 answers

Max area of triangle -PHP

How do i prove that the maximum area that can be obtained among 3 random points in a square is half the area of the square?- I need it to for the following question " Show that among any 9 points inside a triangle of area 1 there are three points…
1
vote
3 answers

Proof Involving Pigeonhole Principle

Let $a_1, a_2, ..., a_n$ be positive integers all of whose prime divisors are $\le$ 13. a) Show that if $n \ge 65$ then there exist two of these integers whose product is a perfect square. [DONE] b) Show that if $n \ge 193$ then there exists four of…
Jebediah
  • 543
1
vote
2 answers

Let G be an undirected graph with at least two vertices. Then there exist distinct vertices v and w in G that have the same degree.

The “pigeonhole principle” states that if n+1 objects (e.g., pigeons) are to be distributed into n holes then some hole must contain at least two objects. This observation is obvious but useful. Employ the pigeonhole principle to prove the…
user95227
  • 115
1
vote
1 answer

Pigeonhole principle questions

I want to solve the following problems with Pigeonhole principle. Show that in every group of people that have atleast 2 people, we can find couple that know the number of the people in the group.( lets suppose that its symetric relation ). Show…
Ofir Attia
  • 3,136
1
vote
0 answers

Pigeon Hole Principle : Can one of the games be played?

Q: 9 people are in a club. Each of them can play one of the games among Bridge , Hearts & Mahajong. Prove that they can play at least one of the mentioned games.( all games require 4 players.) I came across this question over the internet. It seems…
1
vote
0 answers

PHP - 6 x 16 checkerboard painted in 3 colors

I have a suggestion for a solution to a question and I would appreciate if you could verfy it. Question Consider a $6\times 16$ checkerboard painted in 3 colors (let's say $0,1,2$ ). Prove that there is a rectangle whose four vertices are painted in…
Lior
  • 623
1
vote
1 answer

No. of functions satisfying a certain condition

This is from an old exam: Let $M$ be a set of functions from $\mathbb{Z}/3$ into itself. What is the least number of elements that $M$ must contain for there to surely be at least two elements $f,g \in M$ for which $f(0)=g(0)$ and $f(1)=g(1)$? The…
1
vote
1 answer

Pigeonhole proof for numbered consecutive houses

The problem is as follow: (Thanks to this question for original problem statement) A row of houses are randomly assigned distinct numbers between 1 and 50 (inclusive). How many houses must there be to insure that there are 5 houses numbered…
JoeA
  • 11
1
vote
2 answers

pigeonhole principle- finding a divisor

Write a proof that for every positive integer n, there exist i and j with 1 ≤ i < j ≤ n + 1, such that n is a divisor(must be a factor of) of $66 . . . 6$(j digits) $ - 66 . . . 6 $(i digits). I tried to use the php to based on the fact that there…
tantan69
  • 145