Find all pairs of positive integers $a,b$ with $$a^a+b^b \mid (ab)^{|a-b|}-1.$$

Let $A = \{1,2,\ldots,2011\}$. Find the number of functions $f$ from $A$ to $A$ that satisfy $f(n) \le n$ for all $n$ in $A$ and attain exactly $2010$ distinct values.

If $x, y, z$ are real numbers satisfying $x^2 +y^2 +z^2 = 2$, prove the inequality \[ x + y + z \leq 2 + xyz \] When does equality occur?

Let $a$ and $b$ be real numbers such that $a + b = 2$. Show that: $$\min \{|a|,|b|\} < 1 < \max \{|a|,|b|\} \Leftrightarrow a, b \in (-3,1)$$

We are given a finite, simple, non-directed graph. Ann writes positive real numbers on each edge of the graph such that for all vertices the following is true: the sum of the numbers written on the edges incident to a given vertex is less than one. Bob wants to write non-negative real numbers on the vertices in the following way: if the number written at vertex $v$ is $v_0$, and Ann's numbers on the edges incident to $v$ are $e_1,e_2,\ldots,e_k$, and the numbers on the other endpoints of these edges are $v_1,v_2,\ldots,v_k$, then $v_0=\sum_{i=1}^k e_iv_i+2022$. Prove that Bob can always number the vertices in this way regardless of the graph and the numbers chosen by Ann. Proposed by [i]Boldizsár Varga[/i], Verőce

The function $f$ is defined by $$f(x) = \Big\lfloor \lvert x \rvert \Big\rfloor - \Big\lvert \lfloor x \rfloor \Big\rvert$$for all real numbers $x$, where $\lfloor r \rfloor$ denotes the greatest integer less than or equal to the real number $r$. What is the range of $f$? $\textbf{(A) } \{-1, 0\} \qquad\textbf{(B) } \text{The set of nonpositive integers} \qquad\textbf{(C) } \{-1, 0, 1\}$ $\textbf{(D) } \{0\} \qquad\textbf{(E) } \text{The set of nonnegative integers} $

The quadrilateral $ABCD$ has $AD = DC = CB < AB$ and $AB \parallel CD$. Points $E$ and $F$ lie on the sides $CD$ and $BC$ such that $\angle ADE = \angle AEF$. Prove that: (a) $4CF \le CB$. (b) If $4CF = CB$, then $AE$ is the angle bisector of $\angle DAF$.

Let $(a_n)$ be a sequence with $a_1=0$ and $a_{n+1}=2+a_n$ for odd $n$ and $a_{n+1}=2a_n$ for even $n$. Prove that for each prime $p>3$, the number \begin{align*} b=\frac{2^{2p}-1}{3} \mid a_n \end{align*} for infinitely many values of $n$

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Katrine has a bag containing 4 buttons with distinct letters M, P, F, G on them (one letter per button). She picks buttons randomly, one at a time, without replacement, until she picks the button with letter G. What is the probability that she has at least three picks and her third pick is the button with letter M?

On the plane there are two isosceles non-intersecting right triangles $ABC$ and $DEC$ ($AB$ and $DE$ are the hypotenuses,$ ABDE$ is a convex quadrilateral), and $AB = 2 DE$. Let's construct two more isosceles right triangles: $BDF$ (with hypotenuse $BF$ located outside triangle $BDC$) and $AEG$ (with hypotenuse $AG$ located outside triangle $AEC$). Prove that the line $FG$ passes through a point $N$ such that $DCEN$ is a square.

There are $9$ points arranged in a $3\times 3$ square grid. Let two points be adjacent if the distance between them is half the side length of the grid. (There should be $12$ pairs of adjacent points). Suppose that we wanted to connect $8$ pairs of adjacent points, such that all points are connected to each other. In how many ways is this possible? [i]Proposed by Kevin You[/i]

Given a point $P$ in the circumcircle $\omega$ of an equilateral triangle $ABC$, prove that the segments $PA$, $PB$, and $PC$ form a triangle $T$. Let $R$ be the radius of the circumcircle $\omega$ and let $d$ be the distance between $P$ and the circumcenter. Find the area of $T$.

Find the number of collections of $16$ distinct subsets of $\{1, 2, 3, 4, 5\}$ with the property that for any two subsets $X$ and $Y$ in the collection, $X\cap Y \neq \emptyset$.

Let $n\geq 3$ and $A=\{1,2,\dots ,n\}$. For any function $f:A\rightarrow A$ we define $$A_f=\{|f(1)-f(2)|,|f(2)-f(3)|,\dots ,|f(n-1)-f(n)|,|f(n)-f(1)|\}.$$ Determine the smallest and greatest value of the cardinal of $A_f$ as $f$ goes through all bijective functions from $A$ to $A$. [i]Silviu Cristea[/i]

In an $n\times n$ table, it is allowed to rearrange rows, as well as rearrange columns. Asterisks are placed in some $k{}$ cells of the table. What maximum $k{}$ for which it is always possible to ensure that all the asterisks are on the same side of the main diagonal (and that there are no asterisks on the main diagonal itself)? [i]Proposed by P. Kozhevnikov[/i]

Let $ABC$ be a right triangle with $m(\widehat {C}) = 90^\circ$, and $D$ be its incenter. Let $N$ be the intersection of the line $AD$ and the side $CB$. If $|CA|+|AD|=|CB|$, and $|CN|=2$, then what is $|NB|$?

The function $f : R \to R$ satisfies $f(3x) = 3f(x) - 4f(x)^3$ for all real $x$ and is continuous at $x = 0$. Show that $|f(x)| \le 1$ for all $x$.

The medians $AM$ and $BN$ of a triangle $ABC$ are the diameters of the circles $\omega_1$ and $\omega_2$. If $\omega_1$ touches the altitude $CH$, prove that $\omega_2$ also touches $CH$. I. Gorodnin

The paper folding art origami is usually performed with square sheets of paper. Someone folds the sheet once along a line through the center of the sheet in orde to get a nonagon. Let $p$ be the perimeter of the nonagon minus the length of the fold, i.e. the total length of the eight sides that are not folds, and denote by s the original side length of the square. Express the area of the nonagon in terms of $p$ and $s$.

Let $n$ be a positive integer. For $i$ and $j$ in $\{1,2, \ldots, n\}$, let $s(i, j)$ be the number of pairs $(a, b)$ of nonnegative integers satisfying $a i+b j=n$. Let $S$ be the $n$-by-n matrix whose $(i, j)$-entry is $s(i, j)$. For example, when $n=5$, we have $S=\left[\begin{array}{lllll}6 & 3 & 2 & 2 & 2 \\ 3 & 0 & 1 & 0 & 1 \\ 2 & 1 & 0 & 0 & 1 \\ 2 & 0 & 0 & 0 & 1 \\ 2 & 1 & 1 & 1 & 2\end{array}\right]$. Compute the determinant of $S$.

For any two positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq \dfrac{2nm}{\sqrt{m-n}}$$ As always, $[x,y]$ means the least common multiply of $x,y$. [I]Proposed by A. Golovanov[/i]

A right-triangulated prism made of benzene sits on a table. The hypotenuse makes an angle of $30^\circ$ with the horizontal table. An incoming ray of light hits the hypotenuse horizontally, and leaves the prism from the vertical leg at an acute angle of $ \gamma $ with respect to the vertical leg. Find $\gamma$, in degrees, to the nearest integer. The index of refraction of benzene is $1.50$. [i](Proposed by Ahaan Rungta)[/i]

Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n.$

An equilateral triangle with integer side length $n$ is subdivided into smaller equilateral triangles of side length $1$ by drawing lines parallel to its sides, as shown in the figure for $n = 4$. [asy] size(5cm); // Function to draw an equilateral triangle with subdivisions and mark vertices void drawTriangleWithDots(pair A, pair B, pair C, int n) { real step = 1.0 / n; // Draw horizontal lines for (int i = 0; i <= n; ++i) { pair start = A + i * step * (C - A); pair end = start + i * step * (B - C); draw(start -- end, gray(0.5)); } // Draw left-leaning diagonal lines for (int i = 0; i <= n; ++i) { pair start = A + i * step * (B - A); pair end = start + (n - i) * step * (C - A); draw(start -- end, gray(0.5)); } // Draw right-leaning diagonal lines for (int i = 0; i <= n; ++i) { pair start = B + i * step * (C - B); pair end = start + (n - i) * step * (A - B); draw(start -- end, gray(0.5)); } // Mark dots at all vertices for (int i = 0; i <= n; ++i) { for (int j = 0; j <= i; ++j) { pair vertex = A + i * step * (C - A) + j * step * (B - C); dot(vertex, black); } } // Draw the outer triangle draw(A -- B -- C -- cycle, black+linewidth(1)); } // Main triangle vertices pair A = (0, 0); pair B = (4, 0); pair C = (2, 3.464); // Height = sqrt(3)/2 * side length // Subdivisions int n = 4; // Draw the subdivided equilateral triangle with dots drawTriangleWithDots(A, B, C, n); [/asy] Consider the set $A$ consisting of all points that are vertices of any of these smaller triangles. A [i]subtriangle[/i] is defined as any equilateral triangle whose three vertices belong to the set $A$ and whose three sides lie along the lines of the initial subdivision. We wish to color all points in $A$ either red or blue such that no subtriangle has all three vertices of the same color. Let $C(n)$ denote the number of such valid colorings for each positive integer $n$. Calculate, in terms of $n$, the value of $C(n)$.