Scribd Logo
Upload

Welcome to Scribd!

  • Pigeon-Hole Principle

    Uploaded by

    19001011008 ANIKET BHATIA
    9 views5 pages
    The document discusses the pigeonhole principle and Dirichlet. It states that the pigeonhole principle is the simplest and most fundamental combinatorics principle that if n items are put into less than n containers, then at least one container must contain multiple items. It also provides background that Dirichlet proved the n=5 case of the pigeonhole principle, which was then called the drawer principle, and made important contributions to number theory.

    Original Description:

    Original Title

    Pigeon-Hole principle

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the pigeonhole principle and Dirichlet. It states that the pigeonhole principle is the simplest and most fundamental combinatorics principle that if n items are put into less than n containers, then at least one container must contain multiple items. It also provides background that Dirichlet proved the n=5 case of the pigeonhole principle, which was then called the drawer principle, and made important contributions to number theory.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views5 pages

    Pigeon-Hole Principle

    Uploaded by

    19001011008 ANIKET BHATIA
    The document discusses the pigeonhole principle and Dirichlet. It states that the pigeonhole principle is the simplest and most fundamental combinatorics principle that if n items are put into less than n containers, then at least one container must contain multiple items. It also provides background that Dirichlet proved the n=5 case of the pigeonhole principle, which was then called the drawer principle, and made important contributions to number theory.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    6 Inclusion-Exclusion

    theorem and pigeonhole


    principle
    6-4 pigeonhole principle

    Combinatorics

    35
    Pigeonhole Principle
    pigeonhole principle is the simplest and most fundamental

    is
    n-1
    least one pigeonhole which has at least 2 pigeons

    36
    Dirichlet
    Dirichlet 1805 1859
    German mathematician, founder of analytical number
    theory and he defined the modern function concept.
    Dirichlet is famous for proving the n=5 situation of

    pigeonhole principle, which is called the drawer principle


    at that time.
    Gauss died in 1855, University of Goettingen hired
    Dirichlet to inherit the position of Gauss.
    Berlin University starts its golden age from Dirichlet .
    37
    Taken from: http://episte.math.ntu.edu.tw/people/p_dirichlet/
    Pigeonhole Principle
    Eg There are 30 people in a class, at least 3 are born in the same month.
    Eg Conflicts in Hash tables are unavoidable as the number of keys are always
    larger than the number of indices.
    quiz

    38
    Pigeonhole Principle
    Eg 10 pairs of blue socks, 12 pairs of white socks, how many times do we
    need to pick randomly to get a pair.

    What are the pigeon and pigeonholes here

    39

    You might also like