Skip to main content

How to prepare for INMO

Since INMO is coming up, it would be nice to write a post about it! A lot of people have been asking me for tips.

To people who are visiting this site for the first time, hi! I am Sunaina Pati, an undergrad student at Chennai Mathematical Institute. I was an INMO awardee in 2021,2022,2023. I am also very grateful to be part of the India EGMO 2023 delegation. Thanks to them I got a silver medal! 

I think the title of the post might be clickbait for some. What I want to convey is how I would have prepared for INMO if I were to give it again. Anyway, so here are a few tips for people!

Practice, practice, practice!!

  • I can not emphasize how important this is. This is the only way you can realise which areas ( that is combinatorics, geometry, number theory, algebra) are your strength and where you need to work on.

  • Try the problems as much as you want, and make sure you use all the ideas you can possibly think of before looking at a hint. So rather than fixing time as a measure to decide to give up on a problem, fix ideas as the measure. Obviously, you would have to decide if you are out of ideas or not. Essentially, through each problem, you should try to maximize your learning, while minimizing your time. Again, I am not implying that you should spend less time on each problem, but since time one has limited time to spend each day, it would be ideal to try to minimise the time spent while maximizing the amount of knowledge you gain.


  •  There is no fixed threshold/ requirement for the amount of time you should spend every day to become an INMO awardee. While this might be a concern for a lot of people, my advice to them should be to not think about this question and rather just focus on problem-solving whenever you can. Also, time spent is a continuous function rather than being discrete. At least for me and many other things, we usually think about a math problem almost all the time, consciously or subconsciously. Hence, this question is very hard to answer. 

But practice from where??

  • Another question which I get asked a lot is "Where should I practice problems. Could you recommend some sources?". Again, pretty subjective answer. Moreover, please note that whatever I say shall not be a "requirement". 


  • I would like to be comfortable in solving IMO shortlist problems of indexes 1,2 and 3. And for my strong areas, at least 6. I also feel INMO and Russian, USA and Iranian olympiads have a very similar flavour as INMO and I would have liked to solve those problems. They look very fun! Additionally, definitely INMO, IMO, EGMO, APMO and RMM problems.  

  • I also joined OTIS ( by Evan Chen), and the problems in those problem sets/ handouts were great! I would love to try harder problems and be more confident. 

  • Another advice, I would give to everyone is to not be intimidated by a problem because of the source and rather give it an honest try. Moreover, do not restrict yourself to these particular sources and just try the problems you love. Remember, it is not about the quantity but the ideas you gain while trying to solve these problems. The ideas which you get but do not work. They are equally important. 

Wait, what about theory?????

So, for the books, here is a list of books/ handouts which you can try!

1. Evan Chen’s Handouts and his book EGMO

2. Alex Remerov’s Handouts

3. Yufei Zhao’s Handouts 

4. Rohan Goyal's Handouts ( Rg's handouts can be found here ) 

5. Modern Olympiad Number Theory by Aditya Khurmi

6. Additionally, the Online math club's Youtube channel is a really good source to learn from! Please do check it out :)

7. And maybe this blog too! It has a lot of problems which you can try :)


  • Please, do not be intimidated at all by the theory and remember that math olympiads are truly mostly about problem-solving.  

Any final advice??

  • A few actually. Practice mocks and timed exams. Time pressure is real and it's nicer to get used to it. 

  • Try to not make "winning gold at IMO" your goal but rather learning a lot of new math and solve problems your goal. Not saying the former is bad, but it is pretty stressful and take the fun out of it.

  • Try solving problems in a group as it is an extremely fun experience. You get to meet and talk to people who are just like you. It makes your journey fun!


  • Do not be stressed and never compare yourself with others. This journey is yours and simply yours. 
~Sunaina 

Labels:

Comments

  1. AnonymousDecember 24, 2024 at 10:48 AM

    Good

    ReplyDelete
  2. Ahana PalDecember 25, 2024 at 11:34 AM

    thanks sunaina

    ReplyDelete
    Replies
    1. AnonymousFebruary 2, 2025 at 9:34 PM

      didi,ashani sirer class ki tumi korte?

      Delete
  3. Klavi3rJanuary 5, 2025 at 6:51 PM

    Wow, this is nice!
    Tbh, despite being an INMO Awardee, I am kind of scared of INMO... this gave me some courage.

    ReplyDelete
  4. SIddh@rthJanuary 5, 2025 at 9:14 PM

    Nice that helped a lot

    ReplyDelete
  5. Digital Marketing ServiceFebruary 8, 2025 at 3:09 PM

    This comment has been removed by the author.

    ReplyDelete
  6. Best Digital Marketing CompanyFebruary 19, 2025 at 9:35 PM

    This is very nice blog, also visit us at for Digital Marketing ServicesWebsite Designing only in 15k in India and abroad, Google Ads in 3k, Facebook Ads in 2k, Call or WhatsApp +91 8196862339

    ReplyDelete
  7. Chuck BushMarch 19, 2025 at 3:57 PM

    dasda

    ReplyDelete
  8. Iftekhar AhmedApril 16, 2025 at 1:49 PM

    This is such a helpful and well-structured guide for anyone aiming to crack the INMO! I really appreciate how you've broken down the preparation strategy by topic and provided practical tips on problem-solving and time management. Your emphasis on understanding the concepts deeply rather than just practicing mechanically is so important, especially for math olympiads. The resources you mentioned are also spot-on. Overall, it's a motivating read for students and gives a clear roadmap to follow. Great job putting this together!

    ReplyDelete

Post a Comment

Popular posts from this blog

My experiences at EGMO, IMOTC and PROMYS experience

Yes, I know. This post should have been posted like 2 months ago. Okay okay, sorry. But yeah, I was just waiting for everything to be over and I was lazy. ( sorry ) You know, the transitioning period from high school to college is very weird. I will join CMI( Chennai Mathematical  Institue) for bsc maths and cs degree. And I am very scared. Like very very scared. No, not about making new friends and all. I don't care about that part because I know a decent amount of CMI people already.  What I am scared of is whether I will be able to handle the coursework and get good grades T_T Anyways, here's my EGMO PDC, EGMO, IMOTC and PROMYS experience. Yes, a lot of stuff. My EGMO experience is a lot and I wrote a lot of details, IMOTC and PROMYS is just a few paras. Oh to those, who don't know me or are reading for the first time. I am Sunaina Pati. I was IND2 at EGMO 2023 which was held in Slovenia. I was also invited to the IMOTC or International Mathematical Olympiad Training Cam...
11 comments
Read more

How to prepare for RMO?

"Let's wait for this exam to get over".. *Proceeds to wait for 2 whole fricking years!  I always wanted to write a book recommendation list, because I have been asked so many times! But then I was always like "Let's wait for this exam to get over" and so on. Why? You see it's pretty embarrassing to write a "How to prepare for RMO/INMO" post and then proceed to "fail" i.e not qualifying.  Okay okay, you might be thinking, "Sunaina you qualified like in 10th grade itself, you will obviously qualify in 11th and 12th grade." No. It's not that easy. Plus you are talking to a very underconfident girl. I have always underestimated myself. And I think that's the worst thing one can do itself. Am I confident about myself now? Definitely not but I am learning not to self-depreciate myself little by little. Okay, I shall write more about it in the next post describing my experience in 3 different camps and 1 program.  So, I got...
7 comments
Read more

Solving Random ISLs And Sharygin Solutions! And INMO happened!!

Some of the ISLs I did before INMO :P  [2005 G3]:  Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$ Solution: Note that $$\Delta LDK \sim \Delta XBK$$ and $$\Delta ADY\sim \Delta XCY.$$ So we have $$\frac{BK}{DY}=\frac{XK}{LY}$$ and $$\frac{DY}{CY}=\frac{AD}{XC}=\frac{AY}{XY}.$$ Hence $$\frac{BK}{CY}=\frac{AD}{XC}\times \frac{XK}{LY}\implies \frac{BK}{BC}=\frac{CY}{XC}\times \frac{XK}{LY}=\frac{AB}{BC}\times \frac{XK}{LY} $$ $$\frac{AB}{LY}\times \frac{XK}{BK}=\frac{AB}{LY}\times \frac{LY}{DY}=\frac{AB}{DL}$$ $$\implies \Delta CBK\sim \Delta LDK$$ And we are done. We get that $$\angle KCL=360-(\angle ACB+\angle DKC+\angle BCK)=\angle DAB/2 +180-\angle DAB=180-\angle DAB/2$$ Motivation: I took a hint on this. I had other angles but I did...
4 comments
Read more

IMO Shortlist 2021 C1

 I am planning to do at least one ISL every day so that I do not lose my Olympiad touch (and also they are fun to think about!). Today, I tried the 2021 IMO shortlist C1.  (2021 ISL C1) Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$. Suppose not. Then any $3$ elements $x,y,z\in S$ will be $(x,y)=(y,z)=(x,z)$ or $(x,y)\ne (y,z)\ne (x,z)$. There exists an infinite set $T$ such that $\forall x,y\in T,(x,y)=d,$ where $d$ is constant. Fix a random element $a$. Note that $(x,a)|a$. So $(x,a)\le a$.Since there are infinite elements and finite many possibilities for the gcd (atmost $a$). So $\exists$ set $T$ which is infinite such that $\forall b_1,b_2\in T$ $$(a,b_1)=(a,b_2)=d.$$ Note that if $(b_1,b_2)\ne d$ then we get a contradiction as we get a set satisfying the proble...
1 comment
Read more

Symmetric Polynomials #week 6

Well... I haven't seen much symmetric polynomials in Olympiads, but still I am learning, because I found them cute. And I am basically using this blog as my notes :P What are symmetric polynomials?  One can understand this with  examples. If we are considering over 3 variables, $x_1,x_2,x_3$ then  $$\sum_{sym}x_1^2\cdot x_2^3\cdot x_3=x_1^2\cdot x_2^3\cdot x_3+x_1^2\cdot x_3^3\cdot x_2+x_2^2\cdot x_1^3\cdot x_3+x_2^2\cdot x_3^3\cdot x_1+x_3^2\cdot x_1^3\cdot x_2.$$ See? $3!$ terms! Let's take one more example with again over 3 variables, $x_1,x_2,x_3$ then $$\sum_{sym}x_1^2\cdot x_2^2= x_1^2\cdot x_2^2+x_1^2\cdot x_3^2+x_2^2\cdot x_1^2+x_2^2\cdot x_3^2+x_3^2\cdot x_1^2+x_3^2\cdot x_2^2$$ Wait.. why 2 times ? So basically what happens in symmetrictric sums, is we go through all $n!$ possible permutations. So, here we have $a^2\cdot b^2\cdot c^0$ as like the "general" form type, right? Now, list down all the $3!=6$ permutations of $x_1,x_2,x_3$, and put them in the gene...
3 comments
Read more

New year with a new beginning! And a recap of 2024..and all the best for INMO 2025!

Hi everyone! Happy New Year :)  Thank you so much for 95k+ views!!! How was everyone's 2024? What are everyone's resolutions? ( Do write down in the comment section! And you can come back 1 year later to see if you made them possible!). A Better Mathematician  Well, technically a theoretical computer scientist.  I am so grateful to be allowed to study at CMI where I can interact with so many brilliant professors, access the beautiful library and obviously discuss mathematics ( sometimes non math too ) with the students.    And this year, I want to learn more mathematics and clear my fundamentals. I have become much worse in math actually. And hopefully, read some research papers too :)  And discuss a lot of mathematics with other people.  However, with that whole depressing 2024 year, I have lost a lot of my confidence in mathematics. And to be a better mathematician, I should gain the confidence that I can be a mathematician. And well, I am working on...
6 comments
Read more

Some Geometry Problems for everyone to try!

 These problems are INMO~ish level. So trying this would be a good practice for INMO!  Let $ABCD$ be a quadrilateral. Let $M,N,P,Q$ be the midpoints of sides $AB,BC,CD,DA$. Prove that $MNPQ$ is a parallelogram. Consider $\Delta ABD$ and $\Delta BDC$ .Note that $NP||BD||MQ$. Similarly, $NM||AC||PQ$. Hence the parallelogram. In $\Delta ABC$, $\angle A$ be right. Let $D$ be the foot of the altitude from $A$ onto $BC$. Prove that $AD^2=BD\cdot CD$. Note that $\Delta ADB\sim \Delta CDA$. So by similarity, we have $$\frac{AD}{BD}=\frac{CD}{AD}.$$ In $\Delta ABC$, $\angle A$ be right. Let $D$ be the foot of the altitude from $A$ onto $BC$. Prove that $AD^2=BD\cdot CD$. Let $D\in CA$, such that $AD = AB$.Note that $BD||AS$. So by the Thales’ Proportionality Theorem, we are done! Given $\Delta ABC$, construct equilateral triangles $\Delta BCD,\Delta CAE,\Delta ABF$ outside of $\Delta ABC$. Prove that $AD=BE=CF$. This is just congruence. N...
3 comments
Read more

IMO Shortlist 2022 C1

  Today we shall try IMO Shortlist $2022$ C1. A $\pm 1$-sequence is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and$$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$ We claim that the answer is $\boxed{506}$. $506$ is the upper bound. Just consider the sequence $$+1,-1,-1,+1,+1,-1,-1,+1\dots,-1,-1,+1,+1,-1.$$ Here $1, -1, -1, 1$ is repeated $505$ times and $1,-1$ is concatted to it. Now,our sequence would be $a_1,a_3,a_4,a_5,a_7,\dots$ which on summing would give $506$. And clearly, this would give the upper bound. Now, we show that $506$ is attainable by every sequence. WLOG there are at least $1011$ positive numbers in the sequence. Then we choose $+1$ whenever we can. Let the sequence be $c_1,b_1,\dots, c_n,b_n$ where $c_i$ are ...
1 comment
Read more

Problems I did this week [Jan8-Jan14]

Yeyy!! I am being so consistent with my posts~~ Here are a few problems I did the past week and yeah INMO going to happen soon :) All the best to everyone who is writing!  I wont be trying any new problems and will simply revise stuffs :) Some problems here are hard. Try them yourself and yeah~~Solutions (with sources) are given at the end! Problems discussed in the blog post Problem1: Let $ABC$ be a triangle whose incircle $\omega$ touches sides $BC, CA, AB$ at $D,E,F$ respectively. Let $H$ be the orthocenter of $DEF$ and let altitude $DH$ intersect $\omega$ again at $P$ and $EF$ intersect $BC$ at $L$. Let the circumcircle of $BPC$ intersect $\omega$ again at $X$. Prove that points $L,D,H,X$ are concyclic. Problem 2: Let $ ABCD$ be a convex quadrangle, $ P$ the intersection of lines $ AB$ and $ CD$, $ Q$ the intersection of lines $ AD$ and $ BC$ and $ O$ the intersection of diagonals $ AC$ and $ BD$. Show that if $ \angle POQ= 90^\circ$ then $ PO$ is the bisector of $ \angle AOD$ ...
Post a Comment
Read more

Just spam combo problems cause why not

This post is mainly for Rohan Bhaiya. He gave me/EGMO contestants a lot and lots of problems. Here are solutions to a very few of them.  To Rohan Bhaiya: I just wrote the sketch/proofs here cause why not :P. I did a few more extra problems so yeah.  I sort of sorted the problems into different sub-areas, but it's just better to try all of them! I did try some more combo problems outside this but I tried them in my tablet and worked there itself. So latexing was tough. Algorithms  "Just find the algorithm" they said and they died.  References:  Algorithms Pset by Abhay Bestrapalli Algorithms by Cody Johnson Problem1: Suppose the positive integer $n$ is odd. First Al writes the numbers $1, 2,\dots, 2n$ on the blackboard. Then he picks any two numbers $a, b$ erases them, and writes, instead, $|a - b|$. Prove that an odd number will remain at the end.  Proof: Well, we go $\mod 2$. Note that $$|a-b|\equiv a+b\mod 2\implies \text{ the final number is }1+2+\dots ...
2 comments
Read more