Nov 26, 2015

Favorite ebooks in Maths

Pigeonhole Principles and its application

http://www.artofproblemsolving.com/wiki/index.php/Pigeonhole_Principle

Olympiad Problems

  1. Seven line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. Show that one can choose three of them to represent the sides of a triangle. (Solution)
    (Manhattan Mathematical Olympiad 2004)
  2. Prove that having 100 whole numbers, one can choose 15 of them so that the difference of any two is divisible by 7. (Solution)
    (Manhattan Mathematical Olympiad 2005)
  3. Prove that from any set of one hundred whole numbers, one can choose either one number which is divisible by 100, or several numbers whose sum is divisible by 100. (Solution)
    (Manhattan Mathematical Olympiad 2003)
  4. Prove that among any ten points located on a circle with diameter 5, there exist at least two at a distance less than 2 from each other. (Solution)
    (Japan 1997)
  5. Every point in a plane is either red, green, or blue. Prove that there exists a rectangle in the plane such that all of its vertices are the same color. (Solution)
    (USAMTS Year 18 - Round 1 - Problem 4)
  6. There are 51 senators in a senate. The senate needs to be divided into $n$ committees such that each senator is on exactly one committee. Each senator hates exactly three other senators. (If senator A hates senator B, then senator B does 'not' necessarily hate senator A.) Find the smallest $n$ such that it is always possible to arrange the committees so that no senator hates another senator on his or her committee. (Solution)

Generating functions for series