Determine all functions $f:\mathbb R\to\mathbb R$ such that for all $x, y \in \mathbb R$ $$f(xf(y) - yf(x)) = f(xy) - xy.$$

Let $a_1$, $a_2$, ... be a sequence of integers defined recursively by $a_1=2013$ and for $n \ge 1$, $a_{n+1}$ is the sum of the $2013$-th powers of the digits of $a_n$. Do there exist distinct positive integers $i$, $j$ such that $a_i=a_j$?

There are $30$ boxes each with a unique key. The keys are randomly arranged in the boxes, so that each box contains just one key and the boxes are locked. Two boxes are broken open, thus releasing two keys. What is the probability that the remaining boxes can be opened without forcing them?

Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.

A football tournament is played between 5 teams, each two of which playing exactly one match. 5 points are awarded for a victory and 0 – for a loss. In case of a draw 1 point is awarded to both teams, if no goals are scored, and 2 – if they have scored any. In the final ranking the five teams had points that were 5 consecutive numbers. Determine the least number of goals that could be scored in the tournament.

A sequence $\{a_n\}$ , $a_1=1,a_2=2,a_{n+1}=\dfrac{a_n^2+(-1)^n}{a_{n-1}}$. Show that $a_m^2+a_{m+1}^2\in\{a_n\},\forall m\in\Bbb N$

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $\alpha$ be a real number. Find all the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(f(x+y))=f(x+y) +f(x)f(y)+ \alpha xy$ for all $x,y \in \mathbb{R}$

Let $n \in \mathbb{N}_{\geq 2}.$ For any real numbers $a_1,a_2,...,a_n$ denote $S_0=1$ and for $1 \leq k \leq n$ denote $$S_k=\sum_{1 \leq i_1 < i_2 < ... <i_k \leq n}a_{i_1}a_{i_2}...a_{i_k}$$ Find the number of $n-$tuples $(a_1,a_2,...a_n)$ such that $$(S_n-S_{n-2}+S_{n-4}-...)^2+(S_{n-1}-S_{n-3}+S_{n-5}-...)^2=2^nS_n.$$

There are $n -1$ red balls, $n$ green balls and $n + 1$ blue balls in a bag. The number of ways of choosing two balls from the bag that have different colours is $299$. What is the value of $n$?

Exactly 1600 Coconuts are distributed on exactly 100 monkeys, where some monkeys also can have 0 coconuts. Prove that, no matter how you distribute the coconuts, at least 4 monkeys will always have the same amount of coconuts. (The original problem is written in German. So, I apologize when I've changed the original problem or something has become unclear while translating.)

Let $H$ be the orthocenter of a triangle $ABC$, and let $D$ be the midpoint of the segment $AH$. The altitude $BH$ of triangle $ABC$ intersects the perpendicular to the line $AB$ through the point $A$ at the point $M$. The altitude $CH$ of triangle $ABC$ intersects the perpendicular to the line $CA$ through the point $A$ at the point $N$. The perpendicular bisector of the segment $AB$ intersects the perpendicular to the line $BC$ through the point $B$ at the point $U$. The perpendicular bisector of the segment $CA$ intersects the perpendicular to the line $BC$ through the point $C$ at the point $V$. Finally, let $E$ be the midpoint of the side $BC$ of triangle $ABC$. Prove that the points $D$, $M$, $N$, $U$, $V$ all lie on one and the same perpendicular to the line $AE$. [i]Extensions.[/i] In other words, we have to show that the points $M$, $N$, $U$, $V$ lie on the perpendicular to the line $AE$ through the point $D$. Additionally, one can find two more points on this perpendicular: [b](a)[/b] The nine-point circle of triangle $ABC$ is known to pass through the midpoint $E$ of its side $BC$. Let $D^{\prime}$ be the point where this nine-point circle intersects the line $AE$ apart from $E$. Then, the point $D^{\prime}$ lies on the perpendicular to the line $AE$ through the point $D$. [b](b)[/b] Let the tangent to the circumcircle of triangle $ABC$ at the point $A$ intersect the line $BC$ at a point $X$. Then, the point $X$ lies on the perpendicular to the line $AE$ through the point $D$. [i]Comment.[/i] The actual problem was created by Victor Thébault around 1950 (cf. Hyacinthos messages #1102 and #1551). The extension [b](a)[/b] initially was a (pretty trivial) lemma in Thébault's solution of the problem. Extension [b](b)[/b] is rather new; in the form "prove that $X\in UV$", it was [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=3659]proposed by Valentin Vornicu for the Balkan MO 2003[/url], however it circulated in the Hyacinthos newsgroup before (Hyacinthos messages #7240 and #7242), where different solutions of the problem were discussed as well. Hereby, "Hyacinthos" always refers to the triangle geometry newsgroup "Hyacinthos", which can be found at http://groups.yahoo.com/group/Hyacinthos . I proposed the problem for the QEDMO math fight wishing to draw some attention to it. It has a rather short and elementary solution, by the way (without using radical axes or inversion like the standard solutions). Darij

Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$. Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$

All $n$-digit words from the alphabet $\{0, 1\}$ considered. These $2^n$ words should be in a sequence $w_0, w_1, w_2, ..., w_{2^-1}$ be arranged that $w_m$ from $w_{m-1}$ by changing of a single ornament ($m = 1, 2, 3, ..., 2n-1$). Prove that the following algorithm achievesthis : a) Start with $w_0 = 000... 00$. b) Let $w_{m-1} = a_1a_2a_3 ... a_n$ with $a_i \in \{0; 1\}$, $i = 1, 2, 3, ..., n$. Determine the exponent $e(m)$ of the highest power of two dividing $m$ and set $j = e(m)+1$. In $w_{m-1}$ replace the ornament $a_j$ with $1-aj$. this is now $w_m$.

Circles $ w_{1}$ and $ w_{2}$ with centres $ O_{1}$ and $ O_{2}$ are externally tangent at point $ D$ and internally tangent to a circle $ w$ at points $ E$ and $ F$ respectively. Line $ t$ is the common tangent of $ w_{1}$ and $ w_{2}$ at $ D$. Let $ AB$ be the diameter of $ w$ perpendicular to $ t$, so that $ A, E, O_{1}$ are on the same side of $ t$. Prove that lines $ AO_{1}$, $ BO_{2}$, $ EF$ and $ t$ are concurrent.

Let there be given lines $a,b,c$ in the space, no two of which are parallel. Suppose that there exist planes $\alpha,\beta,\gamma$ which contain $a,b,c$ respectively, which are perpendicular to each other. Construct the intersection point of these three planes. (A space construction permits drawing lines, planes and spheres and translating objects for any vector.)

Call a polynomial $p(x)$ with positive integer roots [i]corrupt[/i] if there exists an integer that cannot be expressed as a sum of (not necessarily positive) multiples of its roots. The polynomial $A(x)$ is monic, corrupt, and has distinct roots. As well, $A(0)$ has $7$ positive divisors. Find the least possible value of $|A(1)|$.

If $A=\{x|\sqrt{x-2}\leq0\},B=\{x|10^{x^2-2}=10^{x}\}$, then $A\cap(\mathbb{R}\backslash B)$ is $\text{(A)}\{2\}\qquad\text{(B)}\{-1\}\qquad\text{(C)}\{x|x\leq2\}\qquad\text{(D)}\varnothing$

Prove that from any sequence of $1996$ real numbers $a_1$, $a_2$,$...$, $a_{1996}$ one can choose one or several numbers standing successively one after another so that their sum differs from an integer by less than $0.001$. (A Kanel)

Find the number of ways there are to permute the elements of the set $\{1,2,3,4,5,6,7,8,9\}$ such that no two adjacent numbers are both even or both odd. [i]Proposed by Ephram Chun[/i]

In a $3 \times 25$ board, $1 \times 3$ pieces are placed (vertically or horizontally) so that they occupy entirely $3$ boxes on the board and do not have a common point. What is the maximum number of pieces that can be placed, and for that number, how many configurations are there? [hide=original formulation] Num tabuleiro 3 × 25 s˜ao colocadas pe¸cas 1 × 3 (na vertical ou na horizontal) de modo que ocupem inteiramente 3 casas do tabuleiro e n˜ao se toquem em nenhum ponto. Qual ´e o n´umero m´aximo de pe¸cas que podem ser colocadas, e para esse n´umero, quantas configura¸c˜oes existem? [url=https://www.obm.org.br/content/uploads/2018/09/Provas_OMCPLP_2018.pdf]source[/url][/hide]

Bob’s Rice ID number has six digits, each a number from $1$ to $9$, and any digit can be used any number of times. The ID number satifies the following property: the first two digits is a number divisible by $2$, the first three digits is a number divisible by $3$, etc. so that the ID number itself is divisible by $6$. One ID number that satisfies this condition is $123252$. How many different possibilities are there for Bob’s ID number?

If $\tan x=\dfrac{2ab}{a^2-b^2}$ where $a>b>0$ and $0^\circ <x<90^\circ$, then $\sin x$ is equal to $\textbf{(A) }\frac{a}{b}\qquad\textbf{(B) }\frac{b}{a}\qquad\textbf{(C) }\frac{\sqrt{a^2-b^2}}{2a}\qquad\textbf{(D) }\frac{\sqrt{a^2-b^2}}{2ab}\qquad \textbf{(E) }\dfrac{2ab}{a^2+b^2}$

Evaluate $\int_0^1\frac{\ln(x+1)}{x^2+1}\,dx.$

Let $p$ be a prime number and $a, k$ be positive integers such that $p^a<k<2p^a$. Prove that there exists a positive integer $n$ such that \[n<p^{2a}, C_n^k\equiv n\equiv k\pmod {p^a}.\]