Skip to main content

Resources

Resources - Books and Handouts that you may follow

  • Number Theory 
    1. Modern Olympiad Number Theory by Aditya Khurmi
    2. Olympiad Number Theory Through Challenging Problems by Justin Stevens   
    3. 104 Number Theory Problems by Titu Andreescu, Dorin Andrica and Zuming Feng 
    4.  Handout by Naomi Sato 

      5. Also, you might look into this for more

       

    •  Combinatorics
      1. 102 Combinatorial Problems by Titu Andreescu and Zuming Feng 
      2. Principles and Techniques in Combinatorics by Chen Chuan-Chong and Koh Khee-Meng 
      3. A Path to Combinatorics for Undergraduates by Titu Andreescu and Zuming Feng  
      4. Olympiad Combinatorics by Pranav A. Sriram

        5.     If you are interested to see other books and handouts, consider looking here



      • Polynomials
        1. A wonderful handout by Alexander Remorov
        2. Two handouts by Yufei Zhao can be found here and here
        Some more handouts can be found here



        • Geometry
          1. Euclidean Geometry for Mathematical Olympiads by Evan Chen
          2. A Beautiful Journey Through Olympiad Geometry by Stefan Lozanovski 
          3. Handouts on Collinearity and Concurrency 
          4. Some notes by Yufei Zhao 
          5. gogeometry.com for different problems 
          For more, take a look into this 



          • Functional Equations
            1. Functional Equations - A Problem Solving Approach by B.J. Venkatachala 
            2. Functional Equations by Pang Cheng Wu (recommended for people who are a bit advanced in FE) 
            3. 100 Problems in Functional Equations by Amir Hossein Parvadi 
            4. Cauchy's Equation can be learnt from here.


            • Problem Solving 
              1. Problem Solving Strategies by Arthur Engel 
              2. Mathematical Olympiad Challenges by Titu Andreescu and Razvan Gelca  
              3. Mathematical Olympiad Treasures by Titu Andreescu and Bogdan Enescu 
              4. 102 Combinatorial Problems by Titu Andreescu and Zuming Feng 
              5. Various contests from Art of Problem Solving

              Comments

              Post a Comment

              Popular posts from this blog

              Constructions in Number Theory

              Hi, I am Emon, a ninth grader, an olympiad aspirant, hailing from Kolkata. I love to do olympiad maths and do some competitive programming in my leisure hours, though I take it seriously. I had written INOI this year. Today, I would be giving you a few ideas on how to Construct in Number Theory . Well, so we shall start from the basics and shall try to dig deeper into it with the help of some important and well-known theorems and perhaps, some fancy ones as well. Okay, so without further delay, let's start off... What do we mean by "Constructions"? If noticed, you can see that you often face with some problems in olympiad saying, "... Prove that there exists infinitely many numbers satisfying the given conditions" or "... Prove that there exists a number satisfying the above conditions." These are usually the construction-problems .  For example, let's consider a trivial example : Problem. Prove that there exist infinitely many integers $a$ such...
              Post a Comment
              Read more

              Including and Excluding

              Hi, I am Emon and I am back this time to provide you with some ideas regarding the ''Inclusion and Exclusion Principle" , which is a really important topic that we should learn for olympiads.   The  I nclusion-Exclusion Principle  is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets, which is given by the formula  $$\left|A\cup B\right| = \left|A\right|+\left|B\right| - \left|A\cap B\right|.$$ where $A$  and $B$  are two finite sets and $|X|:=$ cardinality of set $X$, $i.e.$ the number of elements present in the set $X$.  The proof of this formula can be understood directly from the above venn diagram. Additional Note (though a bit out of context).   Let $\mathcal{S}$ be a discrete sample space. Then, if $A, B\subset \mathcal{S}$ are two events, then we may write $$\mathbb{P}(A\cup B)=\mathbb{P}(A)+\mathbb{P}(B)-\mathbb{P}(A\cap B),$$  which is equivalen...
              Post a Comment
              Read more