For non-negative real numbers $x_1, x_2, \ldots, x_n$ which satisfy $x_1 + x_2 + \cdots + x_n = 1$, find the largest possible value of $\sum_{j = 1}^{n} (x_j^{4} - x_j^{5})$.

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

Let $N = a_1a_2...a_n$ in binary. Show that if $a_1-a_2 + a_3 -... + (-1)^{n-1}a_n = 0$ mod $3$, then $N = 0$ mod $3$.

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

Find all prime $x,y$ and $z,$ such that $x^5 +y^3 -(x+y)^2=3z^3$

Beter Pai wants to tell you his fastest $40$-line clear time in Tetris, but since he does not want Qep to realize she is better at Tetris than he is, he does not tell you the time directly. Instead, he gives you the following requirements, given that the correct time is t seconds: $\bullet$ $t < 100$. $\bullet$ $t$ is prime. $\bullet$ $t -1$ has 5 proper factors. $\bullet$ all prime factors of $t +1$ are single digits. $\bullet$ $t -2$ is a multiple of $3$. $\bullet$ $t +2$ has $2$ factors. Find t.

Find all triples of natural numbers $ a $, $ b $, $ c $ such that $$ \gcd (a ^ 2, b ^ 2) + \gcd (a, bc) +\gcd (b, ac) +\gcd (c, ab) = 239 ^ 2 = ab + c . $$

Let $ m$ be a positive integer and define $ f(m)$ to be the number of factors of $ 2$ in $ m!$ (that is, the greatest positive integer $ k$ such that $ 2^k|m!$). Prove that there are infinitely many positive integers $ m$ such that $ m \minus{} f(m) \equal{} 1989.$

Let $N$ is the set of all positive integers. Determine all mappings $f: N-\{1\} \to N$ such that for every $n \ne m$ the following equation is true $$f(n)f(m)=f\left((nm)^{2021}\right)$$

Determine the number of subset $S$ of the set $T = {1, 2,..., 2005}$ such that the sum of elements in $s$ is congruent to 2006 modulo 2048.

Show that there is no continuous function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for every real number $x$ \[f(x-f(x)) = \dfrac x2.\]

Eddy is traveling to England and needs to exchange USD to GBP (US dollars to British pounds). The current exchange rate is $1.3$ USD for $1$ GBP. He exchanges $x$ USD to GBP and while in England, uses $\tfrac{x}{2}$ GBP. When he returns, the value of the British pound has changed so that $1$ GBP equals $\alpha$ USD. After exchanging all his remaining GBP, he notes that he has $\tfrac{x}{2}$ USD left. What is $\alpha$?

You are given a positive integer $n > 1$. What is the largest possible number of integers that can be chosen from the set $\{1, 2, 3, \ldots, 2^n\}$ so that for any two different chosen integers $a, b$, the value $a^k + b^k$ is not divisible by $2^n$ for any positive integer $k$? [i]Proposed by Oleksii Masalitin[/i]

The cells of an $n \times n$ chessboard are coloured in several colours so that no $2\times 2$ square contains four cells of the same colour. A [i]proper path [/i] of length $m$ is a sequence $a_1,a_2,..., a_m$ of distinct cells in which the cells $a_i$ and $a_{i+1}$ have a common side and are coloured in different colours for all $1 \le i < m$. Show that there exists a proper path of length $n$.

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

Each square in a $3 \times 3$ grid is randomly filled with one of the $4$ gray-and-white tiles shown below on the right.[asy] size(5.663333333cm); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); fill((6,.33)--(7,.33)--(7,1.33)--cycle,mediumgray); draw((6,.33)--(7,.33)--(7,1.33)--(6,1.33)--cycle,gray); fill((6,1.67)--(7,2.67)--(6,2.67)--cycle,mediumgray); draw((6,1.67)--(7,1.67)--(7,2.67)--(6,2.67)--cycle,gray); fill((7.33,.33)--(8.33,.33)--(7.33,1.33)--cycle,mediumgray); draw((7.33,.33)--(8.33,.33)--(8.33,1.33)--(7.33,1.33)--cycle,gray); fill((8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,mediumgray); draw((7.33,1.67)--(8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,gray); [/asy] What is the probability that the tiling will contain a large gray diamond in one of the smaller $2\times 2$ grids? Below is an example of one such tiling. [asy] size(2cm); fill((1,0)--(0,1)--(0,2)--(1,1)--cycle,mediumgray); fill((2,0)--(3,1)--(2,2)--(1,1)--cycle,mediumgray); fill((1,2)--(1,3)--(0,3)--cycle,mediumgray); fill((1,2)--(2,2)--(2,3)--cycle,mediumgray); fill((3,2)--(3,3)--(2,3)--cycle,mediumgray); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); [/asy] $\textbf{(A) } \frac{1}{1024} \qquad \textbf{(B) } \frac{1}{256} \qquad \textbf{(C) } \frac{1}{64} \qquad \textbf{(D) } \frac{1}{16} \qquad \textbf{(E) } \frac{1}{4}$

Prove that any integer greater than or equal to $7$ can be written as a sum of two relatively prime integers, both greater than 1. (Two integers are relatively prime if they share no common positive divisor other than $1$. For example, $22$ and 15 are relatively prime, and thus $37 = 22+15$ represents the number 37 in the desired way.)

Let $ x$, $ y$, and $ z$ be non-negative real numbers satisfying $ x \plus{} y \plus{} z \equal{} 1$. Show that \[ x^2 y \plus{} y^2 z \plus{} z^2 x \leq \frac {4}{27} \] and find when equality occurs.

Given a triangle $ \triangle{ABC} $ with orthocenter $ H $. On its circumcenter, choose an arbitrary point $ P $ (other than $ A,B,C $) and let $ M $ be the mid-point of $ HP $. Now, we find three points $ D,E,F $ on the line $ BC, CA, AB $, respectively, such that $ AP \parallel HD, BP \parallel HE, CP \parallel HF $. Show that $ D, E, F, M $ are colinear.

Find all functions \(f:\mathbb{R} \rightarrow \mathbb{R}\) such that \[ f(x^2+y^2f(x)) = xf(y)^2-f(x)^2 \] for every \(x, y \in \mathbb{R}\)

Find the smallest positive integer $n$ such that \[0< \sqrt[4]{n}-\lfloor \sqrt[4]{n}\rfloor < 0.00001.\]

Let $k$ be a positive integer, and let $a,b$ and $c$ be positive real numbers. Show that \[a(1-a^k)+b(1-(a+b)^k)+c(1-(a+b+c)^k)<\frac{k}{k+1}.\] [i]* * *[/i]

Given positive integers $m$, $a$, $b$, $(a,b)=1$. $A$ is a non-empty subset of the set of all positive integers, so that for every positive integer $n$ there is $an \in A$ and $bn \in A$. For all $A$ that satisfy the above condition, find the minimum of the value of $\left| A \cap \{ 1,2, \cdots,m \} \right|$

In triangle $ABC$, $P$ is a point on altitude $AD$. $Q,R$ are the feet of the perpendiculars from $P$ to $AB,AC$, and $QP,RP$ meet $BC$ at $S$ and $T$ respectively. the circumcircles of $BQS$ and $CRT$ meet $QR$ at $X,Y$. a) Prove $SX,TY, AD$ are concurrent at a point $Z$. b) Prove $Z$ is on $QR$ iff $Z=H$, where $H$ is the orthocenter of $ABC$. [i]Ray Li.[/i]

In the right triangle $ABC$ with hypotenuse $AB$, the incircle touches $BC$ and $AC$ at points ${{A}_{1}}$ and ${{B}_{1}}$ respectively. The straight line containing the midline of $\Delta ABC$ , parallel to $AB$, intersects its circumcircle at points $P$ and $T$. Prove that points $P,T,{{A}_{1}}$ and ${{B}_{1}}$ lie on one circle.