Given a natural number $n$, for what maximal value $k$ it is possible to construct a matrix of size $k \times n$ consisting only of elements $\pm 1$ in such a way that for any interchange of a $+1$ with a $-1$ or vice versa, its rank is equal to $k$?

Adam is walking in the city. In order to get around a large building, he walks $12$ miles east and then $5$ miles north, then stop. His friend Neutrino, who can go through buildings, starts in the same place as Adam but walks in a straight line to where Adam stops. How much farther than Neutrino does Adam walk? $$ \mathrm a. ~ 1~\mathrm{mile}\qquad \mathrm b.~2 ~\mathrm{miles}\qquad \mathrm c. ~3~\mathrm{miles} \qquad \mathrm d. ~4~\mathrm{miles} \qquad \mathrm e. ~5~\mathrm{miles} $$

For what positive integers $n$ are there positive rational, but not integer, numbers $a$ and $b$ such that both numbers $a + b$ and $a^n + b^n$ are integers?

A committee of $3366$ film critics are voting for the Oscars. Every critic voted just an actor and just one actress. After the voting, it was found that for every positive integer $n \in \left \{1, 2, \ldots, 100 \right \}$, there is some actor or some actress who was voted exactly $n$ times. Prove that there are two critics who voted the same actor and the same actress. [i](Cyprus)[/i]

In a social network with a fixed finite setback of users, each user had a fixed set of [i]followers[/i] among the other users. Each user has an initial positive integer rating (not necessarily the same for all users). Every midnight, the rating of every user increases by the sum of the ratings that his followers had just before midnight. Let $m$ be a positive integer. A hacker, who is not a user of the social network, wants all the users to have ratings divisible by $m$. Every day, he can either choose a user and increase his rating by 1, or do nothing. Prove that the hacker can achieve his goal after some number of days. [i]Vladislav Novikov[/i]

The diagonals of a cyclic quadrilateral $ABCD$ meet in a point $N.$ The circumcircles of triangles $ANB$ and $CND$ intersect the sidelines $BC$ and $AD$ for the second time in points $A_1,B_1,C_1,D_1.$ Prove that the quadrilateral $A_1B_1C_1D_1$ is inscribed in a circle centered at $N.$

Find all real non-zero polynomials satisfying $P(x)^3+3P(x)^2=P(x^{3})-3P(-x)$ for all $x\in\mathbb{R}$.

Find, with proof, the number of positive integers whose base-$n$ representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by $\pm 1$ from some digit further to the left.

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

The following bar graph represents the length (in letters) of the names of 19 people. What is the median length of these names? $\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad \textbf{(E) }7$ [asy] unitsize(0.9cm); draw((-0.5,0)--(10,0), linewidth(1.5)); draw((-0.5,1)--(10,1)); draw((-0.5,2)--(10,2)); draw((-0.5,3)--(10,3)); draw((-0.5,4)--(10,4)); draw((-0.5,5)--(10,5)); draw((-0.5,6)--(10,6)); draw((-0.5,7)--(10,7)); label("frequency",(-0.5,8)); label("0", (-1, 0)); label("1", (-1, 1)); label("2", (-1, 2)); label("3", (-1, 3)); label("4", (-1, 4)); label("5", (-1, 5)); label("6", (-1, 6)); label("7", (-1, 7)); filldraw((0,0)--(0,7)--(1,7)--(1,0)--cycle, black); filldraw((2,0)--(2,3)--(3,3)--(3,0)--cycle, black); filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle, black); filldraw((6,0)--(6,4)--(7,4)--(7,0)--cycle, black); filldraw((8,0)--(8,4)--(9,4)--(9,0)--cycle, black); label("3", (0.5, -0.5)); label("4", (2.5, -0.5)); label("5", (4.5, -0.5)); label("6", (6.5, -0.5)); label("7", (8.5, -0.5)); label("name length", (4.5,-1.5)); [/asy]

Prove that the product of the sines of two opposite dihedrals in a tetrahedron is proportional to the product of the lengths of the edges of these dihedrals.

At the Mountain School, Micchell is assigned a [i]submissiveness rating[/i] of $3.0$ or $4.0$ for each class he takes. His [i]college potential[/i] is then defined as the average of his submissiveness ratings over all classes taken. After taking 40 classes, Micchell has a college potential of $3.975$. Unfortunately, he needs a college potential of at least $3.995$ to get into the [url=http://en.wikipedia.org/wiki/Accepted#Plot]South Harmon Institute of Technology[/url]. Otherwise, he becomes a rock. Assuming he receives a submissiveness rating of $4.0$ in every class he takes from now on, how many more classes does he need to take in order to get into the South Harmon Institute of Technology? [i]Victor Wang[/i]

Find the value of sum $\sum_{n=1}^\infty A_n$, where $$A_n=\sum_{k_1=1}^\infty\cdots\sum_{k_n=1}^\infty \frac{1}{k_1^2}\frac{1}{k_1^2+k_2^2}\cdots\frac{1}{k_1^2+\cdots+k_n^2}.$$

A point $E$ lies on the extension of the side $AD$ of the rectangle $ABCD$ over $D$. The ray $EC$ meets the circumcircle $\omega$ of $ABE$ at the point $F\ne E$. The rays $DC$ and $AF$ meet at $P$. $H$ is the foot of the perpendicular drawn from $C$ to the line $\ell$ going through $E$ and parallel to $AF$. Prove that the line $PH$ is tangent to $\omega$. (A. Kuznetsov)

Let $ABCDEF$ be a regular hexagon and $P$ be a point on the shorter arc $EF$ of its circumcircle. Prove that the value of $$\frac{AP+BP+CP+DP}{EP+FP}$$is constant and find its value.

On an infinite chessboard (whose squares are labeled by $ (x, y)$, where $ x$ and $ y$ range over all integers), a king is placed at $ (0, 0)$. On each turn, it has probability of $ 0.1$ of moving to each of the four edge-neighboring squares, and a probability of $ 0.05$ of moving to each of the four diagonally-neighboring squares, and a probability of $ 0.4$ of not moving. After $ 2008$ turns, determine the probability that the king is on a square with both coordinates even. An exact answer is required.

Let $k, M$ be positive integers such that $k-1$ is not squarefree. Prove that there exist a positive real $\alpha$, such that $\lfloor \alpha\cdot k^n \rfloor$ and $M$ are coprime for any positive integer $n$.

Suppose that $X_1, X_2, \ldots$ are real numbers between 0 and 1 that are chosen independently and uniformly at random. Let $S=\sum_{i=1}^kX_i/2^i,$ where $k$ is the least positive integer such that $X_k<X_{k+1},$ or $k=\infty$ if there is no such integer. Find the expected value of $S.$

Elisa swims laps in the pool. When she first started, she completed 10 laps in 25 minutes. Now she can finish 12 laps in 24 minutes. By how many minutes has she improved her lap time? $ \textbf{(A)}\ \dfrac{1}{2} \qquad \textbf{(B)}\ \dfrac{3}{4} \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 3$

Find all the functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy the functional equation $$f(xy^2)+f(x^2y)=y^2f(x)+x^2f(y)$$ for every $x,y\in\mathbb{R}$ and $f(2008) =f(-2008)$ [i](nooonuii)[/i]

Let $ A_{1}A_{2}A_{3}A_{4}A_{5}$ be a convex pentagon, such that \[ [A_{1}A_{2}A_{3}] \equal{} [A_{2}A_{3}A_{4}] \equal{} [A_{3}A_{4}A_{5}] \equal{} [A_{4}A_{5}A_{1}] \equal{} [A_{5}A_{1}A_{2}].\] Prove that there exists a point $ M$ in the plane of the pentagon such that \[ [A_{1}MA_{2}] \equal{} [A_{2}MA_{3}] \equal{} [A_{3}MA_{4}] \equal{} [A_{4}MA_{5}] \equal{} [A_{5}MA_{1}].\] Here $ [XYZ]$ stands for the area of the triangle $ \Delta XYZ$.

Let $a, b, c$ be the side lengths and $P$ be area of a triangle, respectively. Prove that \[(a^2+b^2+c^2-4\sqrt 3 P) (a^2+b^2+c^2) \geq 2 \left(a^2(b - c)^2 + b^2(c - a)^2 + c^2(a - b)^2\right).\]

Let $n$ be a positive integer. Starting with the sequence $1,\frac{1}{2}, \frac{1}{3} , \cdots , \frac{1}{n}$, form a new sequence of $n -1$ entries $\frac{3}{4}, \frac{5}{12},\cdots ,\frac{2n -1}{2n(n -1)}$, by taking the averages of two consecutive entries in the first sequence. Repeat the averaging of neighbors on the second sequence to obtain a third sequence of $n -2$ entries and continue until the final sequence consists of a single number $x_n$. Show that $x_n < \frac{2}{n}$.

Find all real numbers x that satisfies$$\sqrt{\sqrt{x-\frac{1}{x}}+\sqrt{1-\frac{1}{x}}-\frac{1}{\sqrt{x-\frac{1}{x}}+\sqrt{1-\frac{1}{x}}}}+\sqrt{1-\frac{1}{\sqrt{x-\frac{1}{x}}+\sqrt{1-\frac{1}{x}}}}=x.$$ [url=https://artofproblemsolving.com/community/c6h2645263p22889979]2021 IMOC Problems[/url]

Two-way flights are operated between $80$ cities in such a way that each city is connected to at least $7$ other cities by a direct flight and any two cities are connected by a finite sequence of flights. Find the smallest $k$ such that for any such arrangement of flights it is possible to travel from any city to any other city by a sequence of at most $k$ flights.