Skip to main content

About

The OMC Blog is an initiative to get many math bloggers together on one platform. Many people are good at math writing and communication and have blogs on AOPS and other websites. We want to give such people a larger combined audience alongside other resources. On the other side, we also want to bring lots of useful olympiad content together for readers. 

Content on this blog will range from solutions to olympiad questions, expository articles on various topics, interviews, resource compilations, and more. If you want to be a blogger, fill out the google form; we are looking for a diverse range of people who can offer varied perspectives and write about a wide range of stuff. This initiative is part of the Online Math Club.

Meet the team!!

Sunaina Pati: Sunaina is a 12th-grade student from Guwahati, Assam. She doesn't have a favourite area in Olympiad mathematics, however, she tends to solve some of the geometry problems in the test.  Apart from doing college math, she usually spends her time studying her school books, watching k-dramas, reading webtoons and making digital art. Her favourite genre of music is K-pop and Indian Indies. 

She is a two-time IMOTCer in 2021,2022, an Honourable Mention in IGO Advanced round and Sharygin 2022 correspondence round winner. She is also a Sophie fellow 2021, 2022. She has an amazing math blog called Sunaina Thinks Absurd
P.S. She is the supervisor in the OMC blog team along with Pranav.



Pranav Choudhary: Pranav is a 10th grader from Karnal (Haryana). He started doing competitive maths in grade 9, and absolutely loves Combo. His subject preference is Combi ~ Poly  > Geo > FE >> NT > Inequalities. Apart from maths, he likes to play chess, write poems, read random AoPS blogs and talk to people.
He is one-time IMOTCer 2021 and has cleared CMI stems final round in both maths and physics. He also got an Honourable Mention in IGO last year. He has participated in various other math contests such as Purple commet, HMMT, OMO, Sharygin etc.He also has a blog on aops - here 
P.S. He is the supervisor in the OMC blog team along with Sunaina


Atul Shatavart Nadig:
 Atul is a 12th grader from Bangalore who is passionate about math. He likes combo and geo and strongly advocates for the destruction of inequalities in life and math olympiads. Apart from math, he plays chess, reads lots of webtoons, books and cracks bad jokes that no one laughs at it (Editor edit: Sunaina laughs at it)

 He is a two-time IMOTCer in 2021, 2022 and will be representing India at IMO 2022. He also has a silver medal in APMO 2022 and was part of the Sophie fellowship in 2021.








Rushil Mathur: Rushil is an 11th grader from Mumbai. He’s been doing olympiad math for over 3 years now and he absolutely loves combinatorics. Apart from maths, he likes competitive programming and is always up for a chess match. Rushil is a 2022 INMO Awardee and a part of the Sophie Fellowship program. He also won a bronze at the INOI 2022.

Mihir Kaskhedikar: Mihir is a first-year undergrad student studying Computer Science at IIT Delhi. His hobbies are sleeping, procrastinating, binge-watching anime and Netflix sitcoms and of course, solving math problems and logic puzzles. He has qualified RMO in his 10th and 11th grades but he couldn't go past INMO.

He believes that preparing for math olympiads has had a great influence on him and he still occasionally thinks about olympiad problems when he is free from college stuff. He also likes doing competitive programming and is active on Codeforces (handle: erdosnumber). And finally, he is quite lucky to be a part of the OMC blog team!




Debayu Chakraborti:
Debayu hails from the northeastern state of Tripura and has been doing Olympian math for over a year now. He is also interested in higher math, physics, cs and has been learning abt machine learning recently! He is a football maniac and recently made it into his school football team. In his free time, he watches anime, listens to music and reads random books.

Emon Suin: Emon, a Sophie Fellow, is a ninth grader from Kolkata, West Bengal. He is highly enthusiastic for Math Olympiads and also does a bit of Competitive Programming. Emon also loves to play cricket and had played in the CAB U-13 cricket tournament previously.

Moreover, he likes to play chess, a bit though. Last year, he cleared the International Online LIMIT exam, conducted by ISI Bangalore with an AIR : 13 (Objective : 22 and Subjective: 6). Emon also wrote the INOI this year.





Bratin Dasgupta:
Bratin is currently a class 10 student hailing from Kolkata. He's been into Math contests for a long time and enjoys combinations and Geometry the most. He's also an avid competitive programmer and currently competes in the USACO Gold division. Other than Mathematics and CS, he enjoys self-studying physics. In his free time, he's interested in origami, loves Spotify and enjoys playing football.



Rishad:
 Rishad has a deep interest in mathematics. He is a 12th grader. Two of his favourite past times are doing absolutely nothing and listening to music(which he does while studying as well sometimes 'cause it's fun). He likes reading about math and related fields(majorly math only but yeah I do read about physics, cryptography, and computer science as well). He does play chess sometimes and also, for recreation, likes doing puzzles and the questions from the linguistics olympiad. He enjoys watching 3b1b's videos.














Ameya: Ameya is an undergraduate student at IIT Bombay. He was a part of the IMOTC in 2020. He spends time playing basketball, roaming, or watching anime. He likes reading about recreational maths and scientific history. He also has a passion for physics and electronics.  
He considers mathematical discussion and an essential part of his personal growth and is willing to continue his part in dissemination. He is part of the Mathematics and Physics Club at IIT Bombay.   










                                                                           

Popular posts from this blog

The importance of "intuition" in geometry

Hii everyone! Today I will be discussing a few geometry problems in which once you "guess" or "claim" the important things, then the problem can easily be finished using not-so-fancy techniques (e.g. angle chasing, power-of-point etc. Sometimes you would want to use inversion or projective geometry but once you have figured out that some particular synthetic property should hold, the finish shouldn't be that non trivial) This post stresses more about intuition rather than being rigorous. When I did these problems myself, I used freehand diagrams (not geogebra or ruler/compass) because I feel that gives a lot more freedom to you. By freedom, I mean, the power to guess. To elaborate on this - Suppose you drew a perfect  diagram on paper using ruler and compass, then you would be too rigid on what is true in the diagram which you drew. But sometimes that might just be a coincidence. e.g. Let's say a question says $D$ is a random point on segment $BC$, so maybe

LMAO Revenge

Continuing the tradition of past years, our seniors at the Indian IMO camp(an unofficial one happened this year) once again conducted LMAO, essentially ELMO but Indian. Sadly, only those who were in the unofficial IMOTC conducted by Pranav, Atul, Sunaina, Gunjan and others could participate in that. We all were super excited for the problems but I ended up not really trying the problems because of school things and stuff yet I solved problem 1 or so did I think. Problem 1:  There is a   grid of real numbers. In a move, you can pick any real number  ,  and any row or column and replace every entry   in it with  .  Is it possible to reach any grid from any other by a finite sequence of such moves? It turned out that I fakesolved and oh my god I was so disgusted, no way this proof could be false and then when I was asked Atul, it turns out that even my answer was wrong and he didn't even read the proof, this made me even more angry and guess what? I was not alone, Krutarth too fakesol

Edge querying in graph theory

In this post, I will present three graph theory problems in increasing difficulty, each with a common theme that one would determine a property of an edge in a complete graph through repeated iterations, and seek to achieve a greater objective. ESPR Summer Program Application: Alice and Bob play the following game on a $K_n$ ($n\ge 3$): initially all edges are uncolored, and each turn, Alice chooses an uncolored edge then Bob chooses to color it red or blue. The game ends when any vertex is adjacent to $n-1$ red edges, or when every edge is colored; Bob wins if and only if both condition holds at that time. Devise a winning strategy for Bob. This is more of a warm-up to the post, since it has a different flavor from the other two problems, and isn't as demanding in terms of experience with combinatorics. However, do note that when this problem was first presented, applicants did not know the winner ahead of time; it would be difficult to believe that Bob can hold such a strong