When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Pigeonhole principle - Wikipedia

    en.wikipedia.org/wiki/Pigeonhole_principle

    Although the pigeonhole principle appears as early as 1624 in a book attributed to Jean Leurechon, [2] it is commonly called Dirichlet's box principle or Dirichlet's drawer principle after an 1834 treatment of the principle by Peter Gustav Lejeune Dirichlet under the name Schubfachprinzip ("drawer principle" or "shelf principle").

  3. Peter Gustav Lejeune Dirichlet - Wikipedia

    en.wikipedia.org/wiki/Peter_Gustav_Lejeune_Dirichlet

    He first used the pigeonhole principle, a basic counting argument, in the proof of a theorem in diophantine approximation, later named after him Dirichlet's approximation theorem. He published important contributions to Fermat's Last Theorem, for which he proved the cases n = 5 and n = 14, and to the biquadratic reciprocity law. [3]

  4. Siegel's lemma - Wikipedia

    en.wikipedia.org/wiki/Siegel's_lemma

    The existence of these polynomials was proven by Axel Thue; [1] Thue's proof used what would be translated from German as Dirichlet's Drawers principle, which is widely known as the Pigeonhole principle. Carl Ludwig Siegel published his lemma in 1929. [2] It is a pure existence theorem for a system of linear equations.

  5. Dirichlet's approximation theorem - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_approximation...

    This theorem is a consequence of the pigeonhole principle. Peter Gustav Lejeune Dirichlet who proved the result used the same principle in other contexts (for example, the Pell equation) and by naming the principle (in German) popularized its use, though its status in textbook terms comes later. [2] The method extends to simultaneous ...

  6. Subadditivity - Wikipedia

    en.wikipedia.org/wiki/Subadditivity

    Proof. Let :=.. By definition, .So it suffices to show .. If not, then there exists a subsequence (), and an >, such that > + for all .. Since :=, there exists an such that < +.. By infinitary pigeonhole principle, there exists a sub-subsequence (), whose indices all belong to the same residue class modulo , and so they advance by multiples of .

  7. Theorem on friends and strangers - Wikipedia

    en.wikipedia.org/wiki/Theorem_on_friends_and...

    The pigeonhole principle says that at least three of them must be of the same colour; for if there are less than three of one colour, say red, then there are at least three that are blue. Let A , B , C be the other ends of these three edges, all of the same colour, say blue.

  8. Jean Leurechon - Wikipedia

    en.wikipedia.org/wiki/Jean_Leurechon

    The 1622 book contained a brief reference to the pigeonhole principle, much earlier than its common attribution to Peter Gustav Lejeune Dirichlet in 1834, and the 1624 book spelled out the principle in more detail. [4] The 1624 book also contained the first use of the word "thermometer", replacing an earlier word "thermoscope" for the same device.

  9. Diophantine approximation - Wikipedia

    en.wikipedia.org/wiki/Diophantine_approximation

    It may be remarked that the preceding proof uses a variant of the pigeonhole principle: a non-negative integer that is not 0 is not smaller than 1. This apparently trivial remark is used in almost every proof of lower bounds for Diophantine approximations, even the most sophisticated ones.