Let $a, b, c$ be non-zero real numbers that satisfy $\frac{1}{abc} + \frac{1}{a} + \frac{1}{c} = \frac{1}{b}$. The expression $\frac{4}{a^2 + 1} + \frac{4}{b^2 + 1} + \frac{7}{c^2 + 1}$ has a maximum value $M$. Find the sum of the numerator and denominator of the reduced form of $M$.

Let $ABCDEF$ be a regular hexagon, in the sides $AB$, $CD$, $DE$ and $FA$ we choose four points $P,Q,R$ and $S$ respectively, such that $PQRS$ is a square. Prove that $PQ$ and $BC$ are parallel.

Let $\Omega_1$ and $\Omega_2$ be two circles in the plane. Suppose the common external tangent to $\Omega_1$ and $\Omega_2$ has length $2017$ while their common internal tangent has length $2009$. Find the product of the radii of $\Omega_1$ and $\Omega_2$. [i]Proposed by David Altizio[/i]

Find the greatest number $M$ with the following property: in each rearrangement of the $2006$ integer numbers $1,2,...2006$ there are $1010$ numbers located consecutively in that rearrangement whose sum is greater than or equal to $M$.

Some cells of a $11 \times 11$ table are filled with pluses. It is known that the total number of pluses in the given table and in any of its $2 \times 2$ sub-tables is even. Prove that the total number of pluses on the main diagonal of the given table is also even. ($2 \times 2$ sub-table consists of four adjacent cells, four cells around a common vertex).

Find the free coefficient of the polynomial $P(x)$ with integer coefficients, knowing that it is less than $1000$ in absolute value and that $P(19) = P(94) = 1994$.

Consider triangle $ABC$ with orthocenter $H$. Let points $M$ and $N$ be the midpoints of segments $BC$ and $AH$. Point $D$ lies on line $MH$ so that $AD\parallel BC$ and point $K$ lies on line $AH$ so that $DNMK$ is cyclic. Points $E$ and $F$ lie on lines $AC$ and $AB$ such that $\angle EHM=\angle C$ and $\angle FHM=\angle B$. Prove that points $D,E,F$ and $K$ lie on a circle. [i]Proposed by Alireza Dadgarnia[/i]

Let $n \geq 3$ be an integer. A sequence $P_1, P_2, \ldots, P_n$ of distinct points in the plane is called [i]good[/i] if no three of them are collinear, the polyline $P_1P_2 \ldots P_n$ is non-self-intersecting and the triangle $P_iP_{i + 1}P_{i + 2}$ is oriented counterclockwise for every $i = 1, 2, \ldots, n - 2$. For every integer $n \geq 3$ determine the greatest possible integer $k$ with the following property: there exist $n$ distinct points $A_1, A_2, \ldots, A_n$ in the plane for which there are $k$ distinct permutations $\sigma : \{1, 2, \ldots, n\} \to \{1, 2, \ldots, n\}$ such that $A_{\sigma(1)}, A_{\sigma(2)}, \ldots, A_{\sigma(n)}$ is good. (A polyline $P_1P_2 \ldots P_n$ consists of the segments $P_1P_2, P_2P_3, \ldots, P_{n - 1}P_n$.)

For triangle $ABC$, $P$ and $Q$ satisfy $\angle BPA + \angle AQC=90^{\circ}$. It is provided that the vertices of the triangle $BAP$ and $ACQ$ are ordered counterclockwise(or clockwise). Let the intersection of the circumcircles of the two triangles be $N$ ($A \neq N$, however if $A$ is the only intersection $A=N$), and the midpoint of segment $BC$ be $M$. Show that the length of $MN$ does not depend on $P$ and $Q$.

Steph Curry is playing the following game and he wins if he has exactly $5$ points at some time. Flip a fair coin. If heads, shoot a $3$-point shot which is worth $3$ points. If tails, shoot a free throw which is worth $1$ point. He makes $\frac12$ of his $3$-point shots and all of his free throws. Find the probability he will win the game. (Note he keeps flipping the coin until he has exactly $5$ or goes over $5$ points)

How many lines pass through exactly two points in the following hexagonal grid? [img]https://cdn.artofproblemsolving.com/attachments/2/e/35741c80d0e0ee0ca56f1297b1e377c8db9e22.png[/img]

We consider a square board of $1000\times 1000$ with $1000000$ squares $1\times 1$ . A piece placed on a square [i]threatens[/i] all squares on the board that are inside a $19\times 19$ square. with a center in the square where the piece is placed, and with sides parallel to those of the board, except for the squares in the same row and those in the same column. Determine the maximum number of pieces that can be placed on the board so that no two pieces threaten each other.

Prove that every tetrahedron has a vertex whose three edges have the right lengths to form a triangle.

Find all real numbers $x$ such that $4^x-2^{x+2}+3=0$.

The altitudes through the vertices $ A,B,C$ of an acute-angled triangle $ ABC$ meet the opposite sides at $ D,E, F,$ respectively. The line through $ D$ parallel to $ EF$ meets the lines $ AC$ and $ AB$ at $ Q$ and $ R,$ respectively. The line $ EF$ meets $ BC$ at $ P.$ Prove that the circumcircle of the triangle $ PQR$ passes through the midpoint of $ BC.$

Exactly $n$ chords (i.e. diagonals and edges) of a regular $2n$-gon are coloured red, satisfying the following two conditions: (1) Each of the $2n$ vertices occurs exactly once as the endpoint of a red chord. (2) No two red chords have the same length. For which positive integers $n \ge 2$ is this possible?

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers in which $\lim_{n\to\infty} a_n = 0$ such that there is a constant $c >0$ so that for all $n \geq 1$, $|a_{n+1}-a_n| \leq c\cdot a_n^2$. Show that exists $d>0$ with $na_n \geq d, \forall n \geq 1$.

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]

There are 2010 boxes labeled $B_1,B_2,\dots,B_{2010},$ and $2010n$ balls have been distributed among them, for some positive integer $n.$ You may redistribute the balls by a sequence of moves, each of which consists of choosing an $i$ and moving [i]exactly[/i] $i$ balls from box $B_i$ into any one other box. For which values of $n$ is it possible to reach the distribution with exactly $n$ balls in each box, regardless of the initial distribution of balls?

Let $ABCD$ be a tangential and cyclic quadrilateral. Let $S$ be the intersection point of diagonals $AC$ and $BD$ of the quadrilateral. Let $I$, $I_1$, and $I_2$ be the incenters of quadrilateral $ABCD$ and triangles $ACD$ and $BCS$, respectively. Let the ray $II_2$ intersect the circumcircle of quadrilateral $ABCD$ at point $E$. Prove that the points $D$, $E$, $I_1$, and $I_2$ are collinear or concyclic. [i]Proposed by Teodor von Burg[/i]

We say an integer number $n \ge 1$ is conservative, if the smallest prime divisor of $(n!)^n+1$ is at most $n+2015$. Decide if the number of conservative numbers is infinite or not.

Let $n \ge 2$ be a positive integer, with divisors \[1=d_{1}< d_{2}< \cdots < d_{k}=n \;.\] Prove that \[d_{1}d_{2}+d_{2}d_{3}+\cdots+d_{k-1}d_{k}\] is always less than $n^{2}$, and determine when it divides $n^{2}$.

Let $n$ be a positive integer and $\mathcal{P}_n$ be the set of integer polynomials of the form $a_0+a_1x+\ldots +a_nx^n$ where $|a_i|\le 2$ for $i=0,1,\ldots ,n$. Find, for each positive integer $k$, the number of elements of the set $A_n(k)=\{f(k)|f\in \mathcal{P}_n \}$. [i]Marian Andronache[/i]

The problem is about real polynomial functions, denoted by $f$, of degree $\deg f$. a) Prove that a polynomial function $f$ can`t be wrriten as sum of at most $\deg f$ periodic functions. b) Show that if a polynomial function of degree $1$ is written as sum of two periodic functions, then they are unbounded on every interval (thus, they are "wild"). c) Show that every polynomial function of degree $1$ can be written as sum of two periodic functions. d) Show that every polynomial function $f$ can be written as sum of $\deg f+1$ periodic functions. e) Give an example of a function that can`t be written as a finite sum of periodic functions. [i]Dan Schwarz[/i]

Let $p(x)$ be an $n$-degree $(n \ge 2)$ polynomial with integer coefficients. If there are infinitely many positive integers $m$, such that $p(m)$ at most $n -1$ different prime factors $f$, prove that $p(x)$ has at most $n-1$ different rational roots . [color=#f00]a help in translation is welcome[/color]