In a group of people, every two of them have exactly one mutual friend in the group. Prove that there is one person who is friends with all the other people in the group. Note: the friendship is mutual, that is, if $X$ is friends with $Y$, then $Y$ is friends with $X$.

Let $a_1,a_2,...,a_9$ be nine real numbers, not necessarily distinct, with average $m$. Let $A$ denote the number of triples $1 \le i < j < k \le 9$ for which $a_i + a_j + a_k \ge 3m$. What is the minimum possible value of $A$? [i]Proposed by Ray Li[/i]

Solve in prime numbers the equation $x^y - y^x = xy^2 - 19$.

$n$ cockroaches are sitting on the plane at the vertices of the regular $ n $ -gon. They simultaneously begin to move at a speed of $ v $ on the sides of the polygon in the direction of the clockwise adjacent cockroach, then they continue moving in the initial direction with the initial speed. Vasya a entomologist moves on a straight line in the plane at a speed of $u$. After some time, it turned out that Vasya has crushed three cockroaches. Prove that $ v = u $.

Two circles $\mathcal{C}_1$ and $\mathcal{C}_2$ intersect each other at two distinct points $M$ and $N$. A common tangent lines touches $\mathcal{C}_1$ at $P$ and $\mathcal{C}_2$ at $Q$, the line being closer to $N$ than to $M$. The line $PN$ meets the circle $\mathcal{C}_2$ again at the point $R$. Prove that the line $MQ$ is a bisector of the angle $\angle{PMR}$.

We color some points in the plane with red, in such way that if $P,Q$ are red and $X$ is a point such that triangle $\triangle PQX$ has angles $30º, 60º, 90º$ in some order, then $X$ is also red. If we have vertices $A, B, C$ all red, prove that the barycenter of triangle $\triangle ABC$ is also red.

A regular $100$-gon was cut into several parallelograms and two triangles. Prove that these triangles are congruent.

Find all positive integers $n$ so that both $n$ and $n + 100$ have odd numbers of divisors.

Let $ ABC$ be a triangle the lengths of whose sides $ BC,CA,AB,$ respectively, are denoted by $ a,b,$ and $ c$. Let the internal bisectors of the angles $ \angle BAC, \angle ABC, \angle BCA,$ respectively, meet the sides $ BC,CA,$ and $ AB$ at $ D,E,$ and $ F$. Denote the lengths of the line segments $ AD,BE,CF$ by $ d,e,$ and $ f$, respectively. Prove that: $ def\equal{}\frac{4abc(a\plus{}b\plus{}c) \Delta}{(a\plus{}b)(b\plus{}c)(c\plus{}a)}$ where $ \Delta$ stands for the area of the triangle $ ABC$.

Let $ A$ be a unitary finite ring with $ n$ elements, such that the equation $ x^n\equal{}1$ has a unique solution in $ A$, $ x\equal{}1$. Prove that a) $ 0$ is the only nilpotent element of $ A$; b) there exists an integer $ k\geq 2$, such that the equation $ x^k\equal{}x$ has $ n$ solutions in $ A$.

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

Find all $k>0$ for which a strictly decreasing function $g:(0;+\infty)\to(0;+\infty)$ exists such that $g(x)\geq kg(x+g(x))$ for all positive $x$.

A deck consists of $2^n$ cards. The deck is shuffled using the following operation: if the cards are initially in the order $a_1,a_2,a_3,a_4,...,a_{2^n-1},a_{2^n}$ then after shuffling the order becomes $a_{2^{n-1}+1},a_1,a_{2^{n-1}+2},a_2,...,a_{2^n},a_{2^{n-1}}$ . Find the smallest number of such operations after which the original order of the cards is restored. (R. Palm)

Let $n\geq 2$ be an even integer. Find the greatest integer $m\geq 2^{n-2}+1$ such that there exist $m$ distinct subsets of $\{1,2,\dots ,n\}$, any $2^{n-2}+1$ of them having empty intersection. [i]Cristi Săvescu[/i]

Find all couples of non-zero integers $(x,y)$ such that, $x^2+y^2$ is a common divisor of $x^5+y$ and $y^5+x$.

On the computer screen there are initially two $1$'s written. The [i] insert [/i] program causes the sum of those numbers to be inserted between each pair of numbers by pressing the $Enter$ key. In the first step a number is inserted and we obtain $1-2-1$; In the second step two numbers are inserted and we have $1-3-2-3-1$; In the third, four numbers are inserted and you have $1-4-3-5-2-5-3-4-1$; etc Find the sum of all the numbers that appear on the screen at the end of step number $25$.

Let $ABC$ be an acute triangle such that $AB>BC>AC$. Let $D$ be a point different from $C$ on the segment $BC$, such that $AC=AD$. Let $H$ be the orthocenter of triangle $ABC$ and let $A_1$ and $B_1$ be the intersections of the heights from $A$ and $B$ to the opposite sides, respectively. Let $E$ be the intersection of the lines $A_1B_1$ and $DH$. Prove that $B$, $D$, $B_1$, $E$ are concyclic.

On the board are written $2 , 3 , 5 ,... , 2003$ , that is, all the prime numbers of the interval $[2,2007]$ . The operation of [i]simplification [/i] is the replacement of two numbers $a , b$ by a maximal prime number not exceeding $\sqrt{a^2-a b+b^2}$ . First, the student erases the number $q, 2<q<2003$, then applies the [i]simplification [/i] operation to the remaining numbers until one number remains. Find the maximum possible and minimum possible values of the number obtained in the end. How do these values depend on the number $q$?

Prove that the fraction $ \dfrac{21n \plus{} 4}{14n \plus{} 3}$ is irreducible for every natural number $ n$.

Let $n$ be an odd positive integer, and consider an infinite square grid. Prove that it is impossible to fill in one of $1,2$ or $3$ in every cell, which simultaneously satisfies the following conditions: (1) Any two cells which share a common side does not have the same number filled in them. (2) For any $1\times 3$ or $3\times 1$ subgrid, the numbers filled does not contain $1,2,3$ in that order be it reading from top to bottom, bottom to top, or left to right, or right to left. (3) The sum of numbers of any $n\times n$ subgrid is the same.

Prove that the remainder of dividing the sum of two squares of integers by $4$ is different from $3$.

Find (in terms of $n \ge 1$) the number of terms with odd coefficients after expanding the product: \[\prod_{1 \le i < j \le n} (x_i + x_j)\] e.g., for $n = 3$ the expanded product is given by $x_1^2 x_2 + x_1^2 x_3 + x_2^2 x_3 + x_2^2 x_1 + x_3^2 x_1 + x_3^2 x_2 + 2x_1 x_2 x_3$ and so the answer would be $6$.

Two players are playing game. Players alternately write down one natural number greater than $1$, but it is not allowed to write linear combination previously written numbers with nonnegative integer coefficients. Player lose a game if he can't write a new number. Does any of players can have wiining strategy, if yes, then which one of them? [i]Journal "Kvant" / Aleksandar Ilic[/i]

Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime? $\textbf{(A) } \dfrac{8}{99} \qquad\textbf{(B) } \dfrac{2}{5} \qquad\textbf{(C) } \dfrac{9}{20} \qquad\textbf{(D) } \dfrac{1}{2} \qquad\textbf{(E) } \dfrac{9}{16} $

When a company releases a new social media software, the marketing development of the company researches and analyses the characteristics of the customer group apart from paying attention to the active customer depending on the change of the time. We use $n(t, x)$ to express the customer density (which will be abbreviated as density). Here $t$ is the time and $x$ is the time of the customer spent on the social media software. In the instant time $t$, for $0<x_1<x_2$, the number of customers of spending time between $x_1$ and $x_2$ is $\int_{x_1}^{x_2}n(t,x)dx$. We assume the density $n(t,x)$ depends on the time and the following factors: Assumption 1. When the customer keeps using that social media software, their time spent on social media increases linearly. Assumption 2. During the time that the customer uses the social media software, they may stop using it. We assumption the speed of stopping using it $d(x)>0$ only depends on $x$. Assumption 3. There are two sources of new customer. (i) The promotion from the company: A function of time that expresses the increase of number of people in a time unit, expressed by $c(t)$. (ii) The promotion from previous customer: Previous customer actively promotes this social media software to their colleagues and friends actively. The speed of promoting sucessfully depends on $x$, denoted as $b(x)$. Assume if in an instant time, denoted as $t=0$, the density function is known and $n(0,x)=n_0(x)$. We can derive. The change of time $n(t,x)$ can satisfy the equation: $\begin{cases} \frac{\partial}{\partial t}n(t,x)+\frac{\partial}{\partial x}n(t,x)+d(x)n(t,x)=0, t\ge 0, x\ge 0 \\ N(t):=n(t,x=0)=c(t)+\int_{0}^{\infty}b(y)n(t,y)dy \end{cases}\,$ where $N(t)$ iis the speed of the increase of new customers. We assume $b, d \in L^\infty_-(0, \infty)$. $b(x)$ and $d(x)$ is bounded in essence. The following, we first make a simplified assumption: $c(t)\equiv 0$, i.e. the increase of new customer depends only on the promotion of previous customer. (a) According to assumption 1 and 2, formally derive the PDE that $n(t, x)$ satisfies in the two simtaneous equation above. You are required to show the assumption of model and the relationship between the Maths expression. Furthermore, according to assumption 3, explain the definition and meaning of $N(t)$ in the simtaneous equation above. (b) We want to research the relationship of the speed of the increase of the new customers $N(t)$ and the speed of promoting sucessfully $b(x)$. Derive an equation that $N(t)$ satisfies in terms of $N(t), n_0(x), b(x), d(x)$ only and does not include $n(t, x)$. Prove that $N(t)$ satifies the estimation $|N(t)|\le ||b||_\infty e^{||b||_\infty t}\int_{0}^{\infty}|n_0(x)|dx$, where $||\cdot||_\infty$ is the norm of $L^\infty$. (c) Finally, we want to research, after sufficiently long time, what trend of number density function $n(t, x) $\frac{d} has. As the total number of customers may keep increasing so it is not comfortable for us to research the number density function $n(t, x)$. We should try to find a density function which is renormalized. Hence, we first assume there is one only solution $(\lambda_0,\varphi(x))$ of the following eigenvalue problem: $\begin{cases} \varphi'(x)+(\lambda_0+d(x))\varphi(x)=0, x\ge 0 \\ \varphi(x)>0,\varphi(0)=\int_{0}^{\infty}b(x)\varphi(x)dx=1 \end{cases}\, $ and its dual problem has only solution $\psi(x)$: $\begin{cases} -\varphi'(x)+(\lambda_0+d(x))\psi(x)=\psi(0)b(x), x\ge 0 \\ \psi(x)>0,\int_{0}^{\infty}\psi(x)\varphi(x)dx=1 \end{cases}\,$ Prove that for any convex function $H:\mathbb{R}^+\to \mathbb{R}^+$ which satisfies $H(0)=0$. We have $\frac{d}{dx}\int_{0}^{\infty}\psi(x)\varphi(x)H(\frac{\tilde{n}(t,x)}{\varphi(x)})dx\le 0, \forall t\ge 0$. Furthermore, prove that $\int_{0}^{\infty}\psi(x)n(t,x)dx=e^{\lambda_0t}\int_{0}^{\infty}\psi(x)n_0(x)dx$ To simplify the proof, the contribution of boundary terms in $\infty$ is negligible.