[asy]size(150); draw((0,0)--(1,0)--(1,1.5)--(0,1.5)--cycle); draw((2,0)--(3,0)--(3,1.5)--(2,1.5)--cycle); draw((4,0)--(5,0)--(5,1.5)--(4,1.5)--cycle); draw((2,2.5)--(3,2.5)--(3,4)--(2,4)--cycle); draw((4,2.5)--(5,2.5)--(5,4)--(4,4)--cycle); label("3",(0.5,0.5),N); label("4",(2.5,0.5),N); label("6",(4.5,0.5),N); label("P",(2.5,3),N); label("Q",(4.5,3),N);[/asy] Five cards are lying on a table as shown. Each card has a letter on one side and a whole number on the other side. Jane said, "If a vowel is on one side of any card, then an even number is on the other side." Mary showed Jane was wrong by turning over one card. Which card did Mary turn over? \[ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ \text{P} \qquad \textbf{(E)}\ \text{Q} \qquad \]

Let $p$ be some prime number. a) Prove that there exist positive integers $a$ and $b$ such that $a^2 + b^2 + 2018$ is multiple of $p$. b) Find all $p$ for which the $a$ and $b$ from a) can be chosen in such way that both these numbers aren’t multiples of $p$.

Find all convex polyhedra which have no diagonals (that is, for which every segment connecting two vertices lies on the boundary of the polyhedron).

11.7 Let $N$ be a number of perfect squares from $\{1,2,...,10^{20}\}$, which 17-th digit from the end is 7, and $M$ be a number of perfect squares from $\{1,2,...,10^{20}\}$, which 17-th digit from the end is 8. Compare $M$ and $N$. ([i]A. Golovanov[/i])

Determine all finite increasing arithmetic progressions in which each term is the reciprocal of a positive integer and the sum of all the terms is $1$.

We visit all squares exactly once on a $n\times n$ chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

Konstantin has a pile of $100$ pebbles. In each move, he chooses a pile and splits it into two smaller ones until he gets $100 $ piles each with a single pebble. (a) Prove that at some point, there are $30$ piles containing a total of exactly $60$ pebbles. (b) Prove that at some point, there are $20$ piles containing a total of exactly $60$ pebbles. (c) Prove that Konstantin may proceed in such a way that at no point, there are $19$ piles containing a total of exactly $60$ pebbles.

Two non-intersecting circles, not lying inside each other, are drawn in the plane. Two lines pass through a point P which lies outside each circle. The first line intersects the first circle at A and A′ and the second circle at B and B′; here A and B are closer to P than A′ and B′, respectively, and P lies on segment AB. Analogously, the second line intersects the first circle at C and C′ and the second circle at D and D′. Prove that the points A, B, C, D are concyclic if and only if the points A′, B′, C′, D′ are concyclic.

Is it possible to select 100 points on a circle so that there are exactly 1000 right triangles with the vertices at selected points? [i]Sergey Dvoryaninov[/i]

Find all functions $f:(0,\infty)\rightarrow (0,\infty)$ such that for any $x,y\in (0,\infty)$, $$xf(x^2)f(f(y)) + f(yf(x)) = f(xy) \left(f(f(x^2)) + f(f(y^2))\right).$$

Let $a,b,c$ be integers such that $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}=3$ prove that $abc$ is a perfect cube!

Find all positive integers $n$ such that $(n^2 + 11n - 4) \cdot n! + 33 \cdot 13^n + 4$ is a perfect square

Represent the number $ 2008$ as a sum of natural number such that the addition of the reciprocals of the summands yield 1.

Let $\mathcal C$ be a circle centered at $O$ and $A\ne O$ be a point in its interior. The perpendicular bisector of the segment $OA$ meets $\mathcal C$ at the points $B$ and $C$, and the lines $AB$ and $AC$ meet $\mathcal C$ again at $D$ and $E$, respectively. Show that the circles $(OBC)$ and $(ADE)$ have the same centre. [i]Ion Pătrașcu, Ion Cotoi[/i]

Find the number of positive integers $n$ satisfying $\phi(n) | n$ such that \[\sum_{m=1}^{\infty} \left( \left[ \frac nm \right] - \left[\frac{n-1}{m} \right] \right) = 1992\] What is the largest number among them? As usual, $\phi(n)$ is the number of positive integers less than or equal to $n$ and relatively prime to $n.$

Find the set of all real numbers $k$ with the following property: For any positive, differentiable function $f$ that satisfies $f^{\prime}(x) > f(x)$ for all $x,$ there is some number $N$ such that $f(x) > e^{kx}$ for all $x > N.$

Find the smallest positive integer $k$ such that \[(16a^2 + 36b^2 + 81c^2)(81a^2 + 36b^2 + 16c^2) < k(a^2 + b^2 + c^2)^2,\] for some ordered triple of positive integers $(a,b,c)$.

The [i]Fibonacci numbers[/i] are defined recursively by the equation \[ F_n \equal{} F_{n \minus{} 1} \plus{} F_{n \minus{} 2}\] for every integer $ n \ge 2$, with initial values $ F_0 \equal{} 0$ and $ F_1 \equal{} 1$. Let $ G_n \equal{} F_{3n}$ be every third Fibonacci number. There are constants $ a$ and $ b$ such that every integer $ n \ge 2$ satisfies \[ G_n \equal{} a G_{n \minus{} 1} \plus{} b G_{n \minus{} 2}.\] Compute the ordered pair $ (a, b)$.

For a permutation $\pi$ of the set $A = \{1, 2, \ldots, 2025\}$, define its [i]colorfulness [/i]as the greatest natural number $k$ such that: - For all $1 \le i, j \le 2025$, $i \ne j$, if $|i - j| < k$, then $|\pi(i) - \pi(j)| \ge k$. What is the maximum possible colorfulness of a permutation of the set $A$? Determine how many such permutations have maximal colorfulness. [i]Proposed by Pavle Martinović[/i]

In a non-obtuse triangle $ABC$, prove that \[ \frac{\sin A \sin B}{\sin C} + \frac{\sin B \sin C}{\sin A} + \frac{\sin C \sin A}{ \sin B} \ge \frac 52. \][i]Proposed by Ryan Alweiss[/i]

A student at Harvard named Kevin Was counting his stones by $11$ He messed up $n$ times And instead counted $9$s And wound up at $2007$. How many values of $n$ could make this limerick true?

If two triangles with side lengths $a,b,c$ and $a',b',c'$ and the corresponding angle $\alpha,\beta,\gamma$ and $\alpha',\beta',\gamma'$ satisfy $\alpha+\alpha'=\pi$ and $\beta=\beta'$, prove that $aa'=bb'+cc'$.

Do there exist $10000$ ten-digit numbers divisible by $7$, all of which can be obtained from one another by a reordering of their digits?

Somebody wrote $1953$ digits on a circle. The $1953$-digit number obtained by reading these figures clockwise, beginning at a certain point, is divisible by $27$. Prove that if one begins reading the figures at any other place, one gets another $1953$-digit number also divisible by $27$.

Can a countably infinite set have an uncountable collection of non-empty subsets such that the intersection of any two of them is finite?