Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

Let $a, b, c$ be distinct real numbers. Prove that $$\left(\frac{2a - b}{a -b} \right)^2+\left(\frac{2b - c}{b - c} \right)^2+\left(\frac{2c - a}{c - a} \right)^2 \ge 5$$

If $\tan{\alpha}$ and $\tan{\beta}$ are the roots of $x^2 - px + q = 0$, and $\cot{\alpha}$ and $\cot{\beta}$ are the roots of $x^2 - rx + s = 0$, then $rs$ is necessarily $\text{(A)} \ pq \qquad \text{(B)} \ \frac{1}{pq} \qquad \text{(C)} \ \frac{p}{q^2} \qquad \text{(D)} \ \frac{q}{p^2} \qquad \text{(E)} \ \frac{p}{q}$

Having three sets $ A,B\subset C, $ solve the set equation $ (X\cup (C\setminus A))\cap ((C\setminus X)\cup A)=B. $

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

If $a$ and $b$ are each randomly and independently chosen in the interval $[-1, 1]$, what is the probability that $|a|+|b|<1$?

What is the remainder when \[\sum_{k=0}^{100}10^k\] is divided by $9$?

Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]

Let $a$ be the unique real number $x$ satisfying $xe^x = 2$. Find a closed-form expression for \[ \int_{a}^{\infty} \frac{x + 1}{x\sqrt{(xe^x)^{11} - 1}}\,dx. \] You may express your answer in terms of elementary operations, functions, and constants.

A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer $k$ at most one of the pairs $(k, k)$ and $(-k, -k)$ is written on the blackboard. A student erases some of the 136 integers, subject to the condition that no two erased integers may add to 0. The student then scores one point for each of the 68 pairs in which at least one integer is erased. Determine, with proof, the largest number $N$ of points that the student can guarantee to score regardless of which 68 pairs have been written on the board.

Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

Angle bisectors $AD$ and $BE$ are drawn in triangle $ABC$. It turned out that $DE$ is the bisector of triangle $ADC$. Find the angle $BAC$.

The complex numbers $z$ and $w$ satisfy $z^{13} = w$, $w^{11} = z$, and the imaginary part of $z$ is $\sin\left(\frac{m\pi}n\right)$ for relatively prime positive integers $m$ and $n$ with $m < n$. Find $n$.

Does there exist a positive integer $n$ such that all its digits (in the decimal system) are greather than 5, while all the digits of $n^2$ are less than 5?

Let $ABCD$ be a tangential quadrilateral with inscribed circle $k(O,r)$ which is tangent to the sides $BC$ and $AD$ at $K$ and $L$, respectively. Show that the circle with diameter $OC$ passes through the intersection point of $KL$ and $OD$. [i]Proposed by Ilija Jovchevski[/i]

Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) [i]good[/i] if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is [i]remarkable[/i] if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)

Let $n$ be a positive integer.Consider the polynomial $p(x)=x^2+x+1$. What is the remainder of $ x^3$ when divided by $x^2+x+1$.For what positive integers values of $n$ is $ x^{2n}+x^n+1$ divisible by $p(x)$? Post no:[size=300]$100$[/size]

Given a set $X$ and a function $f: X \rightarrow X$, for each $x \in X$ we define $f^1(x)=f(x)$ and, for each $j \ge 1$, $f^{j+1}(x)=f(f^j(x))$. We say that $a \in X$ is a fixed point of $f$ if $f(a)=a$. For each $x \in \mathbb{R}$, let $\pi (x)$ be the quantity of positive primes lesser or equal to $x$. Given an positive integer $n$, we say that $f: \{1,2, \dots, n\} \rightarrow \{1,2, \dots, n\}$ is [i]catracha[/i] if $f^{f(k)}(k)=k$, for every $k=1, 2, \dots n$. Prove that: (a) If $f$ is catracha, $f$ has at least $\pi (n) -\pi (\sqrt{n}) +1$ fixed points. (b) If $n \ge 36$, there exists a catracha function $f$ with exactly $ \pi (n) -\pi (\sqrt{n}) + 1$ fixed points.

In triangle $ABC$ with $AB = 26$, $BC = 28$, and $C A = 30$, let $M$ be the midpoint of $AB$ and let $N$ be the midpoint of $C A$. The circumcircle of triangle $BCM$ intersects $AC$ at $X\ne C$, and the circumcircle of triangle $BCN $intersects $AB$ at $Y\ne B$. Lines $MX$ and $NY$ intersect $BC$ at $P$ and $Q$, respectively. The area of quadrilateral $PQY X$ can be expressed as $\frac{p}{q}$ for positive integers $p$ and $q$ such that gcd$(p,q) = 1$. Find $q$.

$25$ checkers are placed on $25$ leftmost squares of $1 \times N$ board. Checker can either move to the empty adjacent square to its right or jump over adjacent right checker to the next square if it is empty. Moves to the left are not allowed. Find minimal $N$ such that all the checkers could be placed in the row of $25$ successive squares but in the reverse order.

$\sqrt{\frac{1}{9} + \frac{1}{16}} =$ $\textbf{(A)}\ \frac15 \qquad \textbf{(B)}\ \frac14 \qquad \textbf{(C)}\ \frac27 \qquad \textbf{(D)}\ \frac{5}{12} \qquad \textbf{(E)}\ \frac{7}{12}$

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

A point $ P$ is performing a random walk on the $ X$-axis. At the instant $ t\equal{}0$, $ P$ is at a point $ x_0$ ($ |x_0|\le N$, where $ x_0$ and $ N$ denote integers, $ N>0$). If at an instant $ t$ ($ t$ being a nonnegative integer), $ P$ is at a point of $ x$ integer abscissa and $ |x|<N$, then by the instant $ t\plus{}1$ it reaches either the point $ x\plus{}1$ or the point $ x\minus{}1$, each with probability $ \frac12$. If at the instant $ t$, $ P$ is at the point $ x\equal{}N$ [$ x\equal{}\minus{}N$], then by the instant $ t\plus{}1$ it is certain to reach the point $ N\minus{}1$ [$ \minus{}N\plus{}1$]. Denote by $ P_k(t)$ the probability of $ P$ being at $ x\equal{}k$ at instant $ t$ ($ k$ is an integer). Find $ \lim_{t\to \infty}P_{k}(2t)$ and $ \lim_{t\to \infty}P_k(2t\plus{}1)$ for every fixed $ k$.

Find all positive integers $n,k,a_1,a_2,...,a_k$ so that $n^{k+1}+1$ is divisible by $(na_1+1)(na_2+1)...(na_k+1)$

By one magic nut, Wicked Witch can either turn a flea into a beetle or a spider into a bug; while by one magic acorn, she can either turn a flea into a spider or a beetle into a bug. In the evening Wicked Witch had spent 20 magic nuts and 23 magic acorns. By these actions, the number of beetles increased by 5. Determine what was the change in the number of spiders. (Find all possible answers and prove that the other answers are impossible.)