Olympiad problems

2003 Singapore Senior Math Olympiad, 2

For each positive integer $k$, we define the polynomial $S_k(x)=1+x+x^2+x^3+...+x^{k-1}$ Show that $n \choose 1$ $S_1(x) +$ $n \choose 2$ $S_2(x) +$ $n \choose 3$ $S_3(x)+...+$ $n \choose n$ $S_n(x) = 2^{n-1}S_n\left(\frac{1+x}{2}\right)$ for every positive integer $n$ and every real number $x$.

2025 Alborz Mathematical Olympiad, P2

Tags: combination , game theory , circles , geometry

In the Jordan Building (the Olympiad building of High School Mandegar Alborz), Ali and Khosro are playing a game. First, Ali selects 2025 points on the plane such that no three points are collinear and no four points are concyclic. Then, Khosro selects a point, followed by Ali selecting another point, and then Khosro selects one more point. The circumcircle of these three points is drawn, and the number of points inside the circle is denoted by $ t $. If Khosro's goal is to maximize $ t $ and Ali's goal is to minimize $ t $, and both play optimally, determine the value of $ t $. Proposed by Reza Tahernejad Karizi

MathLinks Contest 6th, 2.2

Tags: combination , number theory

Let $a_1, a_2, ..., a_{n-1}$ be $n - 1$ consecutive positive integers in increasing order such that $k$ ${n \choose k}$ $\equiv 0$ (mod $a_k$), for all $k \in \{1, 2, ... , n - 1\}$. Find the possible values of $a_1$.

2025 Alborz Mathematical Olympiad, P3

Tags: 3d geometry , combination , partition , combinatorics

Is it possible to partition three-dimensional space into tetrahedra (not necessarily regular) such that there exists a plane that intersects the edges of each tetrahedron at exactly 4 or 0 points? Proposed by Arvin Taheri