A lottery ticket has $50$ cells into which one must put a permutation of $1, 2, 3, ... , 50$. Any ticket with at least one cell matching the winning permutation wins a prize. How many tickets are needed to be sure of winning a prize?

A computer program generates a sequence of numbers with the following rule: the first number is written by Camilo; thereafter, the program calculates the integer division of the last number generated by $18$; thus obtains a quotient and a remainder. The sum of that quotient plus that remainder is the next number generated. For example, if Camilo's number is $5291,$ the computer makes $5291 = 293 \times 18 + 17$, and generates $310 = 293 + 17$. The next number generated will be $21$, since $310 = 17 \times 18 + 4$ and $17 + 4= 21$; etc Whatever Camilo's initial number is, from some point on, the computer always generates the same number. Determine what is that number that will be repeated indefinitely, if Camilo's initial number is equal to $2^{110}.$

Determine all real numbers $x$ and $y$ such that $x^2 + x = y^3 - y$, $y^2 + y = x^3 - x$

Let $A_1,\ldots,A_n$ be different collinear points. Every point is dyed by one of four colors and every of these colors is used at least once. Show that there is a line segment where two colors are used exactly once and the other two are used at least once.

Given a sequence $\{a_n\}$ whose terms are non-zero real numbers. For any positive integer $n$, the equality \[(\sum_{i=1}^{n}a_i)^2=\sum_{i=1}^{n}a_i^3\] holds. [b](1)[/b] If $n=3$, find all possible sequence $a_1,a_2,a_3$; [b](2)[/b] Does there exist such a sequence $\{a_n\}$ such that $a_{2011}=-2012$?

Circles $k_1$ and $k_2$ intersect in points $A$ and $B$, such that $k_1$ passes through the center $O$ of the circle $k_2$. The line $p$ intersects $k_1$ in points $K$ and $O$ and $k_2$ in points $L$ and $M$, such that the point $L$ is between $K$ and $O$. The point $P$ is orthogonal projection of the point $L$ to the line $AB$. Prove that the line $KP$ is parallel to the $M-$median of the triangle $ABM$. [i]Matko Ljulj[/i]

A pyramid $MABCD$ with the top-vertex $M$ is circumscribed about a sphere with center $O$ so that $O$ lies on the altitude of the pyramid. Each of the planes $ACM,BDM,ABO$ divides the lateral surface of the pyramid into two parts of equal areas. The areas of the sections of the planes $ACM$ and $ABO$ inside the pyramid are in ratio $(\sqrt2+2):4$. Determine the angle $\delta$ between the planes $ACM$ and $ABO$, and the dihedral angle of the pyramid at the edge $AB$.

Let $n$ be a positive integer. (1) For a positive integer $k$ such that $1\leq k\leq n$, Show that : \[\int_{\frac{k-1}{2n}\pi}^{\frac{k}{2n}\pi} \sin 2nt\cos t\ dt=(-1)^{k+1}\frac{2n}{4n^2-1}(\cos \frac{k}{2n}\pi +\cos \frac{k-1}{2n}\pi).\] (2) Find the area $S_n$ of the part expressed by a parameterized curve $C_n: x=\sin t,\ y=\sin 2nt\ (0\leq t\leq \pi).$ If necessary, you may use ${\sum_{k=1}^{n-1} \cos \frac{k}{2n}\pi =\frac 12(\frac{1}{\tan \frac{\pi}{4n}}-1})\ (n\geq 2).$ (3) Find $\lim_{n\to\infty} S_n.$

Find all possible values of $a\in \mathbb{R}$ and $n\in \mathbb{N^*}$ such that $f(x)=(x-1)^n+(x-2)^{2n+1}+(1-x^2)^{2n+1}+a$ is divisible by $\phi (x)=x^2-x+1$

Let $n,k$ be given positive integers with $n>k$. Prove that: \[ \frac{1}{n+1} \cdot \frac{n^n}{k^k (n-k)^{n-k}} < \frac{n!}{k! (n-k)!} < \frac{n^n}{k^k(n-k)^{n-k}} \]

In a convex quadrilateral all sidelengths and all angles are pairwise different. a) Can the greatest angle be adjacent to the greatest side and at the same time the smallest angle be adjacent to the smallest side? b) Can the greatest angle be non-adjacent to the smallest side and at the same time the smallest angle be non-adjacent to the greatest side?

Consider the plane vectors $\overrightarrow{OA_1},\overrightarrow{OA_2},\dots ,\overrightarrow{OA_n}$ with $n\geq 3$. Suppose that the inequality $$\big|\overrightarrow{OA_1}+\overrightarrow{OA_2}+\dots +\overrightarrow{OA_n}\big|\geq \big|\pm\overrightarrow{OA_1}\pm\overrightarrow{OA_2}\pm\dots \pm\overrightarrow{OA_n}\big|$$ takes place for all choiches of the $\pm$ signs. Show that there exists a line $\ell$ through $O$ such that all points $A_1,A_2,\dots ,A_n$ are all on one side of $\ell$. [i]Cristi Săvescu[/i]

Find the greatest $n$ for which there exist $n$ lines in space, passing through a single point, such that any two of them form the same angle.

Let $k,r \in \mathbb N$ and let $x\in (0,1)$ be a rational number given in decimal representation \[ x = 0.a_1a_2a_3a_4 \ldots . \] Show that if the decimals $a_k, a_{k+r}, a_{k+2r}, \ldots$ are canceled, the new number obtained is still rational. [i]Dan Schwarz[/i]

In a year that has $365$ days, what is the maximum number of "Tuesday the $13$th" there can be? Note: The months of April, June, September and November have $30$ days each, February has $28$ and all others have $31$ days.

All the sides of the convex hexagon $ABCDEF$ are equal. In addition, $AD = BE = CF$. Prove that a circle can be inscribed into this hexagon. [i](Boyan Obukhov)[/i]

A freight train departed from Moscow at $x$ hours and $y$ minutes and arrived at Saratov at $y$ hours and $z$ minutes. The length of its trip was $z$ hours and $x$ minutes. Find all possible values of $x$. [i]S. Tokarev[/i]

Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.

One morning each member of Angela's family drank an $ 8$-ounce mixture of coffee with milk. The amounts of coffee and milk varied from cup to cup, but were never zero. Angela drank a quarter of the total amount of milk and a sixth of the total amount of coffee. How many people are in the family? $ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 7$

There are $n$ football teams in [i]Tumbolia[/i]. A championship is to be organised in which each team plays against every other team exactly once. Ever match takes place on a sunday and each team plays at most one match each sunday. Find the least possible positive integer $m_n$ for which it is possible to set up a championship lasting $m_n$ sundays.

Several positive integers are written in a row. Iteratively, Alice chooses two adjacent numbers $x$ and $y$ such that $x>y$ and $x$ is to the left of $y$, and replaces the pair $(x,y)$ by either $(y+1,x)$ or $(x-1,x)$. Prove that she can perform only finitely many such iterations. [i]Proposed by Warut Suksompong, Thailand[/i]

Sydney the squirrel is at $(0, 0)$ and is trying to get to $(2021, 2022)$. She can move only by reflecting her position over any line that can be formed by connecting two lattice points, provided that the reflection puts her on another lattice point. Is it possible for Sydney to reach $(2021, 2022)$?

Let $m, n \ge 2$ be distinct positive integers. In an infinite grid of unit squares, each square is filled with exactly one real number so that [list] [*]In each $m \times m$ square, the sum of the numbers in the $m^2$ cells is equal. [*]In each $n \times n$ square, the sum of the numbers in the $n^2$ cells is equal. [*]There exist two cells in the grid that do not contain the same number. [/list] Let $S$ be the set of numbers that appear in at least one square on the grid. Find, in terms of $m$ and $n$, the least possible value of $|S|$. [i]Kiran Reddy[/i]

Find all nonnegative integers $a, b, c$ such that $$\sqrt{a} + \sqrt{b} + \sqrt{c} = \sqrt{2014}.$$

Let $ n $ be a natural number. Find all integer numbers that can be written as $$ \frac{1}{a_1} +\frac{2}{a_2} +\cdots +\frac{n}{a_n} , $$ where $ a_1,a_2,...,a_n $ are natural numbers.