Skip to main content

Post log

This is the post log. The main motivation to make such a page was to help you use this blog in the best possible way! 

The archive widget and categories could possibly help, but this page might suit your needs better. There is a basic preview for each blog post too!

This is constantly updated.

General tips and advice

[1] How to start with Math Olympiad: This post starts with giving an unofficial guide to AoPS and then goes on to discuss various queries newcomers ask. Following up with some general tips.

[2] How to write nice a solution: This post, in short, discusses various methods to organise a solution and present it in neat ways.

[3] Q&A with experts about bashing: A post where various IMOTCers share their opinion on bashing Geometry problems.

[4]  Algorithms, or Mathematics? A post where we discuss "mathematical miseducation". We discover the true essence of Mathematics. 

[5]A phase I'll never forget In this post, Pranav describes his experience organizing Unofficial IMOTC 2022. 

Math

[1] EGMO Solutions, motivation and review: In this post, Atul, Pranjal and Abhay ( who are part of the OMC team) discuss European Girls Mathematical Olympiad 2022 Solutions with motivation and reviews.


[2] Basic Combinatorial Ideas Part 1: In this post, we see cute combinatorial ideas through different contest problems. We discussed ISL 2009 C1 (a), USAMO 1997 P1, IMO 2011 P4, USAMO 2002 P1, (adapted from) Canada 2018 P3.

[3] Construction in NT In this post, we discuss various theories around construction in NT along with problems.

[4] ISI Objective 2022 Solutions We discuss solutions for the ISI entrance exam 2022 with motivation.

[5] Linear Algebra in Graph Theory Here we will talk about two interesting applications of Linear Algebra in Graph Theory. It is highly recommended that you have some familiarity with Linear Algebra, such as the definition of linear independence, rank, rank-nullity theorem, determinants, and some idea of eigenvalues. 

[6] The Art of Double Counting In this post, we will dive into the topic of double counting by working through some problems and hopefully be able to showcase how to employ the technique when the need arises for the same. 

[7] Including and Excluding A post that will discuss some important ideas related to the topic.

[8] Combinatorial Games and Process In this blog post, We are gonna walk through some nice and instructive problems involving combinatorial processes and games that the author personally really liked.

[9]Minkowski's convex body theorem This blog post was based on Akshat Pandey's Sophie WeMP( Weekly Math Presentation).  

[10] Fun with Isometries This blog post was based on Malay Mahajan's Sophie WeMP( Weekly Math Presentation).  

[11] Rational points on Eliptic curves  In this post we will talk about rational cubic curves.

[12] Logs and Bits This blog can be divided into two parts: In the first part, we would be talking about some basic but useful $log n$-ish algorithms, and later we would be discussing some construction-based problems whose solution exploits the binary representation of numbers. Both parts can be read independently too.

[13] Introduction to Recurrence Relations An introductory post to recurrence relations.

[14] Challenge the Rules A fun combinatorial game post where we challenge the rules!

[15] Dynamic Programming Dynamic Programming is one of the most popular techniques in competitive programming and a powerful algorithm design technique. This post is an introductory post to Dynamic Programming.

[16] Probability is Global An introductory post to Probability and expected value.

[17] LTE lemma This post discussed LTE and it's proof. LTE stands for lifting the exponent lemma.

[18] Mobius Inversion In this post, we talk about Mobius Inversion.

[19] Trust Issues A fun number theory post where we discuss ISL 2019 N5.

[20] Whose Game? In this blog post, we will talk about Combinatorial games, how to quantify positions, and analyse games. Most of this is based on the beginning chapters of the comprehensive book Winning Ways for your Mathematical Plays by Berlekamp, Conway and Guy.

[21] Top 10 problems We discuss the top 10 problems from Number Theory and Algebra.


Comments

Post a Comment

Popular posts from this blog

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 wha...
2 comments
Read more

Functional Equations 101

Let's get to the math:  Let there be two sets $X$ and $Y$. A function  from $X$ to $Y$ denoted as $f \colon X \to Y$ is assigning a value in $Y$ for every element in $X$. We say that $X$ is the domain of the function $f$ and $Y$ is the range.  A function $f \colon X \to y$ is said to be injective if $f(x) = f(x^{\prime}) \implies x = x^{\prime}$ To put it in a more abstract way, if there is some $a \in Y$ then there is at most one $b \in X$ such that $f(b) = a$ holds true.  A function is said to be surjective when for any $a \in Y$ there is at least one $b \in X$ such that $f(b) = a$ holds true.  A function is bijective if for every $a \in Y$ there is exactly one $b \in X$ such that $f(b) = x$. Bijective functions are basically functions which are both injective and surjective.  Bonus: A function $f \colon X \to X$ is known as an involution if $f(f(x)) = x \; \forall  x \in X$  As an exercise, the readers should try to prove that every function th...
Post a Comment
Read more

RMO 2024: Discussing Solutions

Hello everyone!  Congratulations to everyone who attempted the RMO 2024. As you might know, we had an amazing livesolve of the paper with Archit, Adhitya, Abel and Kanav which you can check out  here . We also have question wise video solutions to all the problems, thanks to Nanda, Om and Shreya!  We had a lot of people interested in solutions for the KV/JNV paper, which is what this blog post will be about. Without further ado, let's get started! Problem 1:  Find all positive integers $x,y$ such that $202x+4x^2=y^2$. Solution:  Notice that $y>2x$. Let $y=2x+k$ for some integer $k>0$. Thus, the given equation reduces to $$202x=4xk+k^2\implies x=\frac{k^2}{202-4k}\cdots (1)$$ This tells us that $202-4k|k^2,$ or that $101-2k|2k^2\implies 101-2k|101k$. However, since 101 is a prime, $\gcd(101-2k,\,101)=1\implies 101-2k|k$ or that $101-2k|2k\implies 101-2k|101\implies k=50$. Substituting in $(1)$, we get that $x$ must be $$\frac{50^2}{202-4(50)}=50\cdot 25=12...
2 comments
Read more