Let $p{}$ be a prime number. Prove that the equation has $x^2-x+3-ps=0$ with $x,s\in\mathbb{Z}$ has solutions if and only if the equation $y^2-y+25-pt=0$ with $y,t\in\mathbb{Z}$ has solutions.

Let $\overline{a_1a_2a_3\ldots a_n}$ be the representation of a $n-$digits number in base $10.$ Prove that there exists a one-to-one function like $f : \{0, 1, 2, 3, \ldots, 9\} \to \{0, 1, 2, 3, \ldots, 9\}$ such that $f(a_1) \neq 0$ and the number $\overline{ f(a_1)f(a_2)f(a_3) \ldots f(a_n) }$ is divisible by $3.$

$f$ is a polynomial of degree $n$ with integer coefficients and $f(x)=x^2+1$ for $x=1,2,\cdot ,n$. What are the possible values for $f(0)$?

For any two positive real numbers $x_0 > 0$, $x_1 > 0$, a sequence of real numbers is defined recursively by $$x_{n+1} =\frac{4 \max\{x_n, 4\}}{x_{n-1}}$$ for $n \ge 1$. Find $x_{2010}$.

Prove that for each $n \ge 3$ there exist $n$ distinct positive divisors $d_1,d_2, ...,d_n$ of $n!$ such that $n! = d_1 +d_2 +...+d_n$.

Kevin is at the point $(19,12)$. He wants to walk to a point on the ellipse $9x^2 + 25y^2 = 8100$, and then walk to $(-24, 0)$. Find the shortest length that he has to walk. [i]Proposed by Kevin Zhao[/i]

In a class of $14$ boys, each boy was asked how many classmates had the same first name. and how many colleagues had the same last name as them. The numbers $0, 1, 2, 3, 4, 5$ and $6$. Proves that there are two colleagues with the same first name and the same last name

We deal $n-1$ cards in some way to $n$ people sitting around a table. From then on, in one move a person with at least $2$ cards gives one card to each of his/her neighbors. Prove that eventually a state will be reached where everyone has at most one card.

In how many ways can a $2\times n$ grid be covered by (a) 2 monominoes and $n-1$ dominoes (b) 4 monominoes and $n-2$ dominoes.

In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?

The line passing through the center of the equilateral triangle $ ABC $ intersects the lines $ AB $, $ BC $ and $ CA $ at the points $ {{C} _ {1}} $, $ {{A} _ {1}} $ and $ {{B} _ {1}} $, respectively. Let $ {{A} _ {2}} $ be a point that is symmetric $ {{A} _ {1}} $ with respect to the midpoint of $ BC $; the points $ {{B} _ {2}} $ and $ {{C} _ {2}} $ are defined similarly. Prove that the points $ {{A} _ {2}} $, $ {{B} _ {2}} $ and $ {{C} _ {2}} $ lie on the same line tangent to the inscribed circle of the triangle $ ABC $. (Serdyuk Nazar)

A permutation of the integers $1, 2, \ldots, m$ is called [i]fresh[/i] if there exists no positive integer $k < m$ such that the first $k$ numbers in the permutation are $1, 2, \ldots, k$ in some order. Let $f_m$ be the number of fresh permutations of the integers $1, 2, \ldots, m$. Prove that $f_n \ge n \cdot f_{n - 1}$ for all $n \ge 3$. [i]For example, if $m = 4$, then the permutation $(3, 1, 4, 2)$ is fresh, whereas the permutation $(2, 3, 1, 4)$ is not.[/i]

Suppose $ABCD$ is a convex quadrilateral.Points $P,Q,R$ and $S$ are four points on the line segments $AB,BC,CD$ and $DA$ respectively.The line segments $PR$ and $QS$ meet at $T$.Suppose that each of the quadrilaterals $APTS,BQTP,CRTQ$ and $DSTR$ have an incircle.Prove that the quadrilateral $ABCD$ also has an incircle.

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

Let $U$ be the incenter of a triangle $ABC$ and $O_{1}, O_{2}, O_{3}$ be the circumcenters of the triangles $BCU, CAU, ABU$ , respectively. Prove that the circumcircles of the triangles $ABC$ and $O_{1}O_{2}O_{3}$ have the same center.

Dave has a pile of fair standard six-sided dice. In round one, Dave selects eight of the dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_1$. In round two, Dave selects $r_1$ dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_2$. In round three, Dave selects $r_2$ dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_3$. Find the expected value of $r_3$.

On an initially colourless plane three points are chosen and marked in red, blue and yellow. At each step two points marked in different colours are chosen. Then one more point is painted in the third colour so that these three points form a regular triangle with the vertices coloured clockwise in ''red, blue, yellow". A point already marked may be marked again so that it may have several colours. Prove that for any number of moves all the points containing the same colour lie on the same line.

A sequence $(a_n)$ of positive integers is defined by $a_0=m$ and $a_{n+1}= a_n^5 +487$ for all $n\ge 0$. Find all positive integers $m$ such that the sequence contains the maximum possible number of perfect squares.

Point $P$ lies in the interior of a triangle $ABC$. Lines $AP$, $BP$, and $CP$ meet the opposite sides of triangle $ABC$ at $A$', $B'$, and $C'$ respectively. Let $P_A$ the midpoint of the segment joining the incenters of triangles $BPC'$ and $CPB'$, and define points $P_B$ and $P_C$ analogously. Show that if \[ AB'+BC'+CA'=AC'+BA'+CB' \] then points $P,P_A,P_B,$ and $P_C$ are concyclic. [i]Nikolai Beluhov[/i]

Let $G$ be an abelian group with $n$ elements, and let \[\{g_1=e,g_2,\dots,g_k\}\subsetneq G\] be a (not necessarily minimal) set of distinct generators of $G.$ A special die, which randomly selects one of the elements $g_1,g_2,\dots,g_k$ with equal probability, is rolled $m$ times and the selected elements are multiplied to produce an element $g\in G.$ Prove that there exists a real number $b\in(0,1)$ such that \[\lim_{m\to\infty}\frac1{b^{2m}}\sum_{x\in G}\left(\mathrm{Prob}(g=x)-\frac1n\right)^2\] is positive and finite.

Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$

Let $ABC$ be a triangle with $\angle A,\angle B,\angle C <120^{\circ}$. Prove that: there is exactly one point $T$ inside $\triangle ABC$ such that $\angle BTC=\angle CTA=\angle ATB=120^{\circ}$. ($T$ is called [i]Fermat-Torricelli[/i] point of $\triangle ABC$)

Is it possible for any finite group of people to choose a positive integer $N$ and assign a positive integer to each person in the group such that the product of two persons' number is divisible by $N$ if and only if they are friends?

In [i]Terra Brasilis[/i] there are $n$ houses where $n$ goblins live, each in a house. There are one-way routes such that: - each route joins two houses, - in each house exactly one route begins, - in each house exactly one route ends. If a route goes from house $A$ to house $B$, then we will say that house $B$ is next to house $A$. This relationship is not symmetric, that is: in this situation, not necessarily house $A$ is next to house $B$. Every day, from day $1$, each goblin leaves the house where he is and arrives at the next house. A legend of [i]Terra Brasilis[/i] says that when all the goblins return to the original position, the world will end. a) Show that the world will end. b) If $n = 98$, show that it is possible for elves to build and guide the routes so that the world does not end before $300,000$ years.

The hypotenuse of a right triangle is $ 10$ inches and the radius of the inscribed circle is $ 1$ inch. The perimeter of the triangle in inches is: $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 22 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 30$