Let $a$ and $b$ be positive integers satisfying \[ \frac a{a-2} = \frac{b+2021}{b+2008} \] Find the maximum value $\dfrac ab$ can attain.

Let $M$ and $N$ be two points on different sides of the square $ABCD$. Suppose that segment $MN$ divides the square into two tangential polygons. If $R$ and $r$ are radii of the circles inscribed in these polygons ($R> r$), calculate the length of the segment $MN$ in terms of $R$ and $r$. (Moldova)

Let $ABC$ be an acute triangle.The lines $l_1$ and $l_2$ are perpendicular to $AB$ at the points $A$ and $B$, respectively.The perpendicular lines from the midpoint $M$ of $AB$ to the lines $AC$ and $BC$ intersect $l_1$ and $l_2$ at the points $E$ and $F$, respectively.If $D$ is the intersection point of the lines $EF$ and $MC$, prove that \[\angle ADB = \angle EMF.\]

A class has $24$ students. Each group consisting of three of the students meet, and choose one of the other $21$ students, A, to make him a gift. In this case, A considers each member of the group that offered him a gift as being his friend. Prove that there is a student that has at least $10$ friends.

Let $\{g_i\}_{i=0}^{\infty}$ be a sequence of positive integers such that $g_0=g_1=1$ and the following recursions hold for every positive integer $n$: \begin{align*} g_{2n+1} &= g_{2n-1}^2+g_{2n-2}^2 \\ g_{2n} &= 2g_{2n-1}g_{2n-2}-g_{2n-2}^2 \end{align*} Compute the remainder when $g_{2011}$ is divided by $216$.

What is the last two digits of the number $(11 + 12 + 13 + ... + 2006)^2$?

Let the number of ways for a rook to return to its original square on a $4\times 4$ chessboard in 8 moves if it starts on a corner be $k$. Find the number of positive integers that are divisors of $k$. A "move" counts as shifting the rook by a positive number of squares on the board along a row or column. Note that the rook may return back to its original square during an intermediate step within its 8-move path. [i]Proposed by Bradley Guo[/i]

In a one-player game, you have three cards. At the beginning, a nonnegative integer is written on each of the cards, and the sum of these three integers is $2006$. At each step, you can select two of the three chards, subtract $1$ from the integer written on each of these two cards - as long as the resulting integers are still nonnegative -, and add $1$ to the integer written on the third card. You play this game until you can’t perform a step anymore because two of the cards have $0$’s written on them. Assume that, at this moment, the third card has a $1$ written on it. Prove that I can tell you which card contains the $1$ without knowing how exactly you proceeded in your game, but only knowing the starting configuration (i. e., the numbers written on the cards at the beginning of the game) and the fact that at the end, you were left with two $0$’s and a $1$.

Alice and Bob play a game on a sphere which is initially marked with a finite number of points. Alice and Bob then take turns making moves, with Alice going first: - On Alice’s move, she counts the number of marked points on the sphere, \(n\). She then marks another \(n + 1\) points on the sphere. - On Bob’s move, he chooses one hemisphere and removes all marked points on that hemisphere, including any marked points on the boundary of the hemisphere. Can Bob always guarantee that after a finite number of moves, the sphere contains no marked points? (A [i]hemisphere[/i] is the region on a sphere that lies completely on one side of any plane passing through the centre of the sphere.) [i]proposed by the ICMC Problem Committee[/i]

An array $n \times n$ is given, consisting of $n^2$ unit squares. A pawn is placed arbitrarily on a unit square. A [i]move[/i] of the pawn means a jump from a square of the $k$th column to any square of the $k$th row. Show that there exists a sequence of $n^2$ moves of the pawn so that all the unit squares of the array are visited once and, in the end, the pawn returns to the original position.

Determine all positive integers $n$ with the property that $n = (d(n))^2$. Here $d(n)$ denotes the number of positive divisors of $n$.

In an acute triangle $ABC$, altitudes at vertices $A$ and $B$ and bisector line at angle $C$ intersect the circumcircle again at points $A_1, B_1$ and $C_0$. Using the straightedge and compass, reconstruct the triangle by points $A_1, B_1$ and $C_0$.

A classroom has $30$ students, each of whom is either male or female. For every student $S$, we define his or her [i]ratio[/i] to be the number of students of the opposite gender as $S$ divided by the number of students of the same gender as $S$ (including $S$). Let $\Sigma$ denote the sum of the ratios of all $30$ students. Find the number of possible values of $\Sigma$. [i]Proposed by Evan Chen[/i]

Let $f,g:[a,b]\to [0,\infty)$ be two continuous and non-decreasing functions such that each $x\in [a,b]$ we have \[ \int^x_a \sqrt { f(t) }\ dt \leq \int^x_a \sqrt { g(t) }\ dt \ \ \textrm{and}\ \int^b_a \sqrt {f(t)}\ dt = \int^b_a \sqrt { g(t)}\ dt. \] Prove that \[ \int^b_a \sqrt { 1+ f(t) }\ dt \geq \int^b_a \sqrt { 1 + g(t) }\ dt. \]

Let $P_1,...,P_n$ and $Q_1,...,Q_n$ be oppositely oriented convex polygons. Prove that there is a line passing through the n line segments $P_1Q_1,...,P_nQ_n$.

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

If $ 200 \le a \le 400$ and $ 600 \le b \le 1200$, then the largest value of the quotient $ \frac{b}{a}$ is \[ \textbf{(A)}\ \frac{3}{2} \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 300 \qquad \textbf{(E)}\ 600 \qquad \]

A triangle has a fixed base $AB$ that is $2$ inches long. The median from $A$ to side $BC$ is $ 1\frac{1}{2}$ inches long and can have any position emanating from $A$. The locus of the vertex $C$ of the triangle is: $\textbf{(A)}\ \text{A straight line }AB,1\dfrac{1}{2}\text{ inches from }A \qquad\\ \textbf{(B)}\ \text{A circle with }A\text{ as center and radius }2\text{ inches} \qquad\\ \textbf{(C)}\ \text{A circle with }A\text{ as center and radius }3\text{ inches} \qquad\\ \textbf{(D)}\ \text{A circle with radius }3\text{ inches and center }4\text{ inches from }B\text{ along } BA \qquad\\ \textbf{(E)}\ \text{An ellipse with }A\text{ as focus}$

Decide, whether exist tetrahedrons $T$, $T'$ with walls $S_1$, $S_2$, $S_3$, $S_4$ and $S_1'$, $S_2'$, $S_3'$, $S_4'$, respectively, such that for $i = 1, 2, 3, 4$ triangle $S_i$ is similar to triangle $S_i'$, but despite this, tetrahedron $T$ is not similar to tetrahedron $T'$.

Let $N$ be an integer greater than $1$. A deck has $N^3$ cards, each card has one of $N$ colors, has one of $N$ figures and has one of $N$ numbers (there are no two identical cards). A collection of cards of the deck is "complete" if it has cards of every color, or if it has cards of every figure or of all numbers. How many non-complete collections are there such that, if you add any other card from the deck, the collection becomes complete?

A set of balls is given. Each ball is coloured red or blue, and there is at least one of each colour. Each ball weighs either 1 pound or 2 pounds, and there is at least one of each weight. Prove that there are two balls having different weights and different colours.

We call a set $S$ a [i]good[/i] set if $S=\{x,2x,3x\}(x\neq 0).$ For a given integer $n(n\geq 3),$ determine the largest possible number of the [i]good[/i] subsets of a set containing $n$ positive integers.

In a box of $100$ marbles, just $3\%$ of the marbles are purple and the rest are green. How many green marbles must be removed from the box so that $95\%$ of the remaining marbles are green? $\text{(A) }2\qquad\text{(B) }15\qquad\text{(C) }37\qquad\text{(D) }40\qquad\text{(E) }57$

The first digit of a $6$-digit number is $5$. Is it true that it is always possible to write $6$ more digits to the right of this number so that the resulting $12$-digit number is a perfect square? (A Tolpygo)

Let $a_{1}, \cdots, a_{44}$ be natural numbers such that \[0<a_{1}<a_{2}< \cdots < a_{44}<125.\] Prove that at least one of the $43$ differences $d_{j}=a_{j+1}-a_{j}$ occurs at least $10$ times.