Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T07:37:42.897Z Has data issue: false hasContentIssue false
  • English
  • Français

Applications of the pigeon-hole principle

Published online by Cambridge University Press:  01 August 2016

Kiril Bankov
Kiril Bankov*
Affiliation:
Department for Education of Mathematics and Informatics, University of Sofia, 1126 Sofia, Bulgaria School of Education, University of Southampton, United Kingdom
Get access Rights & Permissions [Opens in a new window]

Extract

Consider the statement (whose truth is obvious):

If n objects are placed in k boxes, where n = qk + r, q and r are positive integers, and 0 < r < k, then at least one box contains more than q objects.

This is known as a pigeon-hole principle (or Dirichlet’s). It is one of the strategies which is often used for problem-solving. Although it is one of the most powerful tools of combinatorics, the principle can be used successfully in other branches of mathematics. Below you can find a collection of problems which can be solved easily by applying this principle to geometrical objects.

Type
Articles
Information
The Mathematical Gazette , Volume 79 , Issue 485 , July 1995 , pp. 286 - 292
Copyright
Copyright © The Mathematical Association 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Rakovska, D., Tonov, I., Bankov, K. and Vitanov, T., Mathematics competitions 4–7 grade, Regalia 6, Sofia (1993) (in Bulgarian).Google Scholar
2. Tabov, J. and Bankov, K., Mathematical competitions around the world, Nauka i izkustvo, Sofia (1988) (in Bulgarian).Google Scholar
3. Taylor, P., International Mathematics Tournament of the Towns: questions, strategies and solutions, Book 1, Australian Mathematics Foundation Ltd (1989).Google Scholar