Chip and Dale play the following game. Chip starts by splitting $1001$ nuts between three piles, so Dale can see it. In response, Dale chooses some number $N$ from $1$ to $1001$. Then Chip moves nuts from the piles he prepared to a new (fourth) pile until there will be exactly $N$ nuts in any one or more piles. When Chip accomplishes his task, Dale gets an exact amount of nuts that Chip moved. What is the maximal number of nuts that Dale can get for sure, no matter how Chip acts? (Naturally, Dale wants to get as many nuts as possible, while Chip wants to lose as little as possible).

Let $S_n=\sum_{k=1}^n (k^5+k^7).$ Let the prime factorization of $\text{gcd}(S_{2020},S_{6060})$ be $p_1^{k_1}\cdot p_2^{k_2}\cdots p_i^{k_i}$. Compute $p_1+p_2+\cdots +p_i+k_1+k_2+\cdots + k_i $.

For each integer $n > 3$ find all quadruples $(n_1,n_2,n_3,n_4)$ of positive integers with $n_1 +n_2 +n_3 +n_4 = n$ which maximize the expression $$\frac{n!}{n_1!n_2!n_3!n_4!}2^{ {n_1 \choose 2}+{n_2 \choose 2}+{n_3 \choose 2}+{n_4 \choose 2}+n_1n_2+n_2n_3+n_3n_4}$$

Find all pairs of non-negative integers $(m,n)$ satisfying $\frac{n(n+2)}{4}=m^4+m^2-m+1$

Let $S$ denote the set of rational numbers different from $ \{ -1, 0, 1 \} $. Define $f: S \rightarrow S $ by $f(x)=x-1/x$. Prove or disprove that \[ \cap_{n=1}^{\infty} f^{(n)} (S) = \emptyset \] where $f^{(n)}$ denotes $f$ composed with itself $n$ times.

In a triangle $ABC$, $I$ is the incenter and $D,E, F$ are the points of tangency of the incircle with $BC,CA,AB$, respectively. The bisector of angle $BIC$ meets $BC$ at $M$, and the line $AM$ intersects $EF$ at $P$. Prove that $DP$ bisects the angle $FDE$.

Let $n$ be a positive integer. Initially, a $2n \times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed : (1) If a $2\times 2$ square has exactly three black cells, the fourth is changed to a black cell; (2) If there are exactly two black cells in a $2 \times 2$ square, the black cells are changed to white and white to black. Find the smallest positive integer $k$ such that for any configuration of the $2n \times 2n$ grid with $k$ black cells, all cells can be black after a finite number of operations.

The roots of the polynomial $x^3 - \frac32 x^2 - \frac14 x + \frac38 = 0$ are in arithmetic progression. What are they?

Let $n \geq 2$ be a natural number, and let $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ be a permutation of $\left(1;\;2;\;...;\;n\right)$. For any integer $k$ with $1 \leq k \leq n$, we place $a_k$ raisins on the position $k$ of the real number axis. [The real number axis is the $x$-axis of a Cartesian coordinate system.] Now, we place three children A, B, C on the positions $x_A$, $x_B$, $x_C$, each of the numbers $x_A$, $x_B$, $x_C$ being an element of $\left\{1;\;2;\;...;\;n\right\}$. [It is not forbidden to place different children on the same place!] For any $k$, the $a_k$ raisins placed on the position $k$ are equally handed out to those children whose positions are next to $k$. [So, if there is only one child lying next to $k$, then he gets the raisin. If there are two children lying next to $k$ (either both on the same position or symmetric with respect to $k$), then each of them gets one half of the raisin. Etc..] After all raisins are distributed, a child is unhappy if he could have received more raisins than he actually has received if he had moved to another place (while the other children would rest on their places). For which $n$ does there exist a configuration $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ and numbers $x_A$, $x_B$, $x_C$, such that all three children are happy?

Find the max and min value of $a\cos^2 x+b\sin x\cos x+c\sin^2 x$.

Find all positive integer values of $n$ such that the value of the $$\frac{2^{n!}-1}{2^n-1}$$ is a square of an integer.

Let $S$ be a square formed by the four vertices $(1,1),(1.-1),(-1,1)$ and $(-1,-1)$. Let the region $R$ be the set of points inside $S$ which are closer to the center than any of the four sides. Find the area of the region $R$.

Let $n$ be a given positive integer. Let $\mathbb{N}_+$ denote the set of all positive integers. Determine the number of all finite lists $(a_1,a_2,\cdots,a_m)$ such that: [b](1)[/b] $m\in \mathbb{N}_+$ and $a_1,a_2,\cdots,a_m\in \mathbb{N}_+$ and $a_1+a_2+\cdots+a_m=n$. [b](2)[/b] The number of all pairs of integers $(i,j)$ satisfying $1\leq i<j\leq m$ and $a_i>a_j$ is even. For example, when $n=4$, the number of all such lists $(a_1,a_2,\cdots,a_m)$ is $6$, and these lists are $(4),$ $(1,3),$ $(2,2),$ $(1,1,2),$ $(2,1,1),$ $(1,1,1,1)$.

3) $f$ cont diff, $R\rightarrow ]0,+\infty[$, prove $|\int_{0}^{1}f^{3}-{f(0)}^{2}\int_{0}^{1}f| \leq \max_{[0,1]} |f'|(\int_{0}^{1}f)^{2}$

All diagonals are plotted in a $2017$-sided convex polygon. A line $\ell$ intersects said polygon but does not pass through any of its vertices. Show that the line $\ell$ intersects an even number of diagonals of said polygon.

Let $M$ be a map made of several cities linked to each other by flights. We say that there is a route between two cities if there is a nonstop flight linking these two cities. For each city to the $M$ denote by $M_a$ the map formed by the cities that have a route to and routes linking these cities together ( to not part of $M_a$). The cities of $M_a$ are divided into two sets so that the number of routes linking cities of different sets is maximum; we call this number the cut of $M_a$. Suppose that for every cut of $M_a$ , it is strictly less than two thirds of the number of routes $M_a$ . Show that for any coloring of the $M$ routes with two colors there are three cities of $M$ joined by three routes of the same color.

Three fixed circles pass through the points $A$ and $B$. Let $X$ be a variable point on the first circle different from $A$ and $B$. The line $AX$ intersects the other two circles at $Y$ and $Z$ (with $Y$ between $X$ and $Z$). Show that the ratio $\frac{XY}{YZ}$ is independent of the position of $X$.

$a_1,a_2,a_3,...$ is a monotone increasing sequence of natural numbers. It is known that for any $k, a_{a_k} = 3k$. a) Find $a_{100}$. b) Find $a_{1983}$. (A Andjans, Riga) PS. (a) for Juniors, (b) for Seniors

Given $m,n\in\mathbb N_+,$ define $$S(m,n)=\left\{(a,b)\in\mathbb N_+^2\mid 1\leq a\leq m,1\leq b\leq n,\gcd (a,b)=1\right\}.$$ Prove that: for $\forall d,r\in\mathbb N_+,$ there exists $m,n\in\mathbb N_+,m,n\geq d$ and $\left|S(m,n)\right|\equiv r\pmod d.$

How many ordered pairs of real numbers $(x, y)$ are there such that $x^2+y^2 = 200$ and \[\sqrt{(x-5)^2+(y-5)^2}+\sqrt{(x+5)^2+(y+5)^2}\] is an integer?

A quadrilateral is rotated clockwise, and the sides are extended its length in the direction of the movement. It turns out the endpoints of the segments constructed form a square. Prove the initial quadrilateral must also be a square. [b]Generalization:[/b] Prove that if the same process is applied to any $n$-gon and the result is a regular $n$-gon, then the intial $n$-gon must also be regular.

Let $ p$ and $ q$ be two consecutive terms of the sequence of odd primes. The number of positive divisor of $ p \plus{} q$, at least $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$

Suppose there are $160$ pigeons and $n$ holes. The $1$st pigeon flies to the $1$st hole, the $2$nd pigeon flies to the $4$th hole, and so on, such that the $i$th pigeon flies to the $(i^2\text{ mod }n)$th hole, where $k\text{ mod }n$ is the remainder when $k$ is divided by $n$. What is minimum $n$ such that there is at most one pigeon per hole? [i]Proposed by Christina Yao[/i]

Let $P(x) = x^2 - 20x - 11$. If $a$ and $b$ are natural numbers such that $a$ is composite, $\gcd(a, b) = 1$, and $P(a) = P(b)$, compute $ab$. Note: $\gcd(m, n)$ denotes the greatest common divisor of $m$ and $n$. [i]Proposed by Aaron Lin [/i]

Let $n$ be a given natural number. Determine the number of all orderer triples $(x, y, z)$ of non-negative integers $x, y, z$ that satisfy the equation $$x + 2y + 5z=10n.$$