https://github.com/llee454/pigeons

A proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n > m, then at least one of the containers contains more than one thing.
https://github.com/llee454/pigeons

coq coq-formalization mathematics pigeonhole proof theorem-proving theorems

Last synced: about 1 year ago
JSON representation

A proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n > m, then at least one of the containers contains more than one thing.

• Host: GitHub
• URL: https://github.com/llee454/pigeons
• Owner: llee454
• License: lgpl-3.0
• Created: 2018-08-21T12:57:53.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2019-02-13T15:26:22.000Z (about 7 years ago)
• Last Synced: 2024-07-29T17:45:01.633Z (over 1 year ago)
• Topics: coq, coq-formalization, mathematics, pigeonhole, proof, theorem-proving, theorems
• Language: Makefile
• Homepage:
• Size: 39.1 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: Readme.md
  • License: COPYING.LESSER

Awesome Lists containing this project

README

          
Pigeons Readme

==============

A proof of the [Pigeonhole principle](https://en.wikipedia.org/wiki/Pigeonhole_principle). The Pigeonhole principle

is a fundamental theorem that is used widely in Computer Science and

Combinatorics, it asserts that if you put n things into m containers,

and n > m, then at least one of the containers contains more than

one thing.

Authors

-------

Larry Darryl Lee Jr.