Anti Pigeonhole Principle: Revision history

From Rest of What I Know

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 December 2024

21 December 2024

  • curprev 19:0419:04, 21 December 2024‎ Roshan talk contribs‎ 506 bytes +506‎ Created page with "The Anti Pigeonhole Principle is that if there are <math>n \in \mathbb{N}</math> pigeons and <math>m \in \mathbb{M}</math> pigeonholes such that <math>n < m</math> then there must be some pigeonholes that are empty. For sets <math>A</math> and <math>B</math> and function <math>f: A \to B</math> with <math>|A| = n ; |B| = m</math> where <math>n < m</math>, then <math>\exists b \in B</math> such that <math>|f^{-1}({b})| = 0</math>. Also, see wikipedia:Pigeonhole pr..."
Retrieved from "https://wiki.roshangeorge.dev/index.php/Anti_Pigeonhole_Principle"