PROOF 62
Prove.
The pigeonhole principle
On finite sets.
Definition D1
An assignment of one of the boxes 1, …, n to each element of a finite set S is called a placement. The collection of elements placed in box i is denoted Bᵢ.
Proof.
Related labs
PROOF 62
The pigeonhole principle
On finite sets.
Definition D1
An assignment of one of the boxes 1, …, n to each element of a finite set S is called a placement. The collection of elements placed in box i is denoted Bᵢ.
Proof.
Related labs