A desert expedition camps at the border of the desert, and has to provide one liter of drinking water for another member of the expedition, residing on the distance of $n$ days of walking from the camp, under the following conditions: $(i)$ Each member of the expedition can pick up at most $3$ liters of water. $(ii)$ Each member must drink one liter of water every day spent in the desert. $(iii)$ All the members must return to the camp. How much water do they need (at least) in order to do that?

Find all polynomials $P(x)$ such that, for all real numbers $x, y, z$ that satisfy $x+ y +z =0$, $$P(x) +P(y) +P(z)=0$$

Prove that for every positive integer $d > 1$ and $m$ the sequence $a_n=2^{2^n}+d$ contains two terms $a_k$ and $a_l$ ($k \neq l$) such that their greatest common divisor is greater than $m$. [i]Proposed by T. Hakobyan[/i]

Let $ n$ be the number of number-pairs $ (x,y)$ which satisfy $ 5y \minus{} 3x \equal{} 15$ and $ x^2 \plus{} y^2 \le 16$. Then $ n$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \text{more than two, but finite} \qquad \textbf{(E)}\ \text{greater than any finite number}$

Find the number of functions defined on positive real numbers such that $ f\left(1\right) \equal{} 1$ and for every $ x,y\in \Re$, $ f\left(x^{2} y^{2} \right) \equal{} f\left(x^{4} \plus{} y^{4} \right)$. $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{Infinitely many}$

There are $ n\geq 5$ people in a party. Assume that among any three of them some two know each other. Show that one can select at least $ \frac{n}{2}$ people and arrange them at a round table so that each person sits between two of his/her acquaintances.

The prime factorization of $12 = 2 \cdot 2 \cdot 3$ has three prime factors. Find the number of prime factors in the factorization of $12! = 12 \cdot 11 \cdot 10 \cdot 9 \cdot 8 \cdot 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$

Let $P$ be the set of all primes. Given any positive integer $n$, define $$\displaystyle f(n) = \max_{p \in P}v_p(n)$$ Prove that for any positive integer $k\ge 2$, there exists infinitely many positive integers $m$ such that \[ f(m+1) = f(m+2) = \cdots = f(m+k) \] [i]Proposed by Ivan Chan Guan Yu[/i]

Let $ABCD$ be a convex quadrilateral and $S$ an arbitrary point in its interior. Let also $E$ be the symmetric point of $S$ with respect to the midpoint $K$ of the side $AB$ and let $Z$ be the symmetric point of $S$ with respect to the midpoint $L$ of the side $CD$. Prove that $(AECZ) = (EBZD) = (ABCD)$.

Consider an acute triangle $ABC$ with \[\angle ACB=45^\circ\,.\] Let $BCED$ and $ACFG$ be squares lying outside triangle $ABC$. Prove that the midpoint of segment $DG$ coincides with the circumcenter of triangle $ABC$.

5. Nine farmers have a checkered $9 \times 9$ field. There is a fence along the boundary of the field. The entire field is completely covered with berries (there is a berry in every point of the field, except the points of the fence). The farmers divided the field along the grid lines in 9 plots of equal area (every plot is a polygon), however they did not demarcate their boundaries. Each farmer takes care of berries only inside his own plot (not on its boundaries). A farmer will notice a loss only if at least two berries disappeared inside his plot. There is a crow which knows all of the above, except the location of boundaries of plots. Can the crow carry off 8 berries from the field so that for sure no farmer will notice this? Tatiana Kazitsina

A cake has the form of an $ n$ x $ n$ square composed of $ n^{2}$ unit squares. Strawberries lie on some of the unit squares so that each row or column contains exactly one strawberry; call this arrangement $\mathcal{A}$. Let $\mathcal{B}$ be another such arrangement. Suppose that every grid rectangle with one vertex at the top left corner of the cake contains no fewer strawberries of arrangement $\mathcal{B}$ than of arrangement $\mathcal{A}$. Prove that arrangement $\mathcal{B}$ can be obtained from $ \mathcal{A}$ by performing a number of switches, defined as follows: A switch consists in selecting a grid rectangle with only two strawberries, situated at its top right corner and bottom left corner, and moving these two strawberries to the other two corners of that rectangle.

Let $A{}$ be a point in the Cartesian plane. At each step, Ann tells Bob a number $0\leqslant a\leqslant 1$ and he then moves $A{}$ in one of the four cardinal directions, at his choice, by a distance of $a{}.$ This process cotinues as long as Ann wishes. Amongst every 100 consecutive moves, each of the four possible moves should have been made at least once. Ann's goal is to force Bob to eventually choose a point at a distance greater than 100 from the initial position of $A.{}$ Can Ann achieve her goal? [i]Selected from an Argentine Olympiad[/i]

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

Four students take an exam. Three of their scores are $70, 80,$ and $90$. If the average of their four scores is $70$, then what is the remaining score? $\textbf{(A) }40\qquad\textbf{(B) }50\qquad\textbf{(C) }55\qquad\textbf{(D) }60\qquad \textbf{(E) }70$

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC \equal{} \angle CAD \equal{} \angle DAE\qquad \text{and}\qquad \angle ABC \equal{} \angle ACD \equal{} \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$. [i]Proposed by Zuming Feng, USA[/i]

Given an acute triangle $ABC$. $\Gamma _{B}$ is a circle that passes through $AB$, tangent to $AC$ at $A$ and centered at $O_{B}$. Define $\Gamma_C$ and $O_C$ the same way. Let the altitudes of $\triangle ABC$ from $B$ and $C$ meets the circumcircle of $\triangle ABC$ at $X$ and $Y$, respectively. Prove that $A$, the midpoint of $XY$ and the midpoint of $O_{B}O_{C}$ is collinear.

Let $S_0 = \varnothing$ denote the empty set, and define $S_n = \{ S_0, S_1, \dots, S_{n-1} \}$ for every positive integer $n$. Find the number of elements in the set \[ (S_{10} \cap S_{20}) \cup (S_{30} \cap S_{40}). \] [i] Proposed by Evan Chen [/i]

On the side $AC$ of a triangle $ABC$, let a $K$ be a point such that $AK = 2KC$ and $\angle ABK = 2 \angle KBC$. Let $F$ be the midpoint of $AC$, $L$ be the projection of $A$ on $BK$. Prove that $FL \bot BC$.

Inside a square $ABCD$ point $P$ is marked, and on the sides $AB$, $BC$, $CD$ and $DA$ points $K,L,M$ and $N$ are chosen respectively. Lines $KP,LP,MP$ and $NP$ intersect sides $CD,DA,AB$ and $BC$ at points $K_1, L_1, M_1$ and $N_1$ respectively. It turned out that $$\frac{KP}{PK_1}+\frac{LP}{PL_1}+\frac{MP}{PM_1}+\frac{NP}{PN_1}=4$$ Prove that $KP+LP+MP+NP=K_1P+L_1P+M_1P+N_1P$.

Given a real number $t\ge3$, suppose a polynomial $f\in\mathbb R[x]$ satisfies $$\left|f(k)-t^k\right|<1,\enspace\forall k=0,1,\ldots,n.$$Prove that $\deg f\ge n$.

Find the number of positive integers $n<2017$ such that $n^2+n^0+n^1+n^7$ is not divisible by the square of any prime. [i]Proposed by [b]illogical_21[/b][/i]

Determine the number of possible values for the determinant of $A$, given that $A$ is a $n\times n$ matrix with real entries such that $A^3 - A^2 - 3A + 2I = 0$, where $I$ is the identity and $0$ is the all-zero matrix.

Prove that : For each integer $n \ge 3$, there exists the positive integers $a_1<a_2< \cdots <a_n$ , such that for $ i=1,2,\cdots,n-2 $ , With $a_{i},a_{i+1},a_{i+2}$ may be formed as a triangle side length , and the area of the triangle is a positive integer.

I think we are allowed to discuss since its after 24 hours How do you do this Prove that $d(1)+d(3)+..+d(2n-1)\leq d(2)+d(4)+...d(2n)$ which $d(x)$ is the divisor function