$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $N$ be a positive integer. Brothers Michael and Kylo each select a positive integer less than or equal to $N$, independently and uniformly at random. Let $p_N$ denote the probability that the product of these two integers has a units digit of $0$. The maximum possible value of $p_N$ over all possible choices of $N$ can be written as $\tfrac ab,$ where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$.

The edges of $K_{2017}$ are each labeled with $1,2,$ or $3$ such that any triangle has sum of labels at least $5.$ Determine the minimum possible average of all $\dbinom{2017}{2}$ labels. (Here $K_{2017}$ is defined as the complete graph on 2017 vertices, with an edge between every pair of vertices.) [i]Proposed by Michael Ma[/i]

Let $A_1A_2A_3A_4$ be a quadrilateral with no pair of parallel sides. For each $i=1, 2, 3, 4$, define $\omega_1$ to be the circle touching the quadrilateral externally, and which is tangent to the lines $A_{i-1}A_i, A_iA_{i+1}$ and $A_{i+1}A_{i+2}$ (indices are considered modulo $4$ so $A_0=A_4, A_5=A_1$ and $A_6=A_2$). Let $T_i$ be the point of tangency of $\omega_i$ with the side $A_iA_{i+1}$. Prove that the lines $A_1A_2, A_3A_4$ and $T_2T_4$ are concurrent if and only if the lines $A_2A_3, A_4A_1$ and $T_1T_3$ are concurrent. [i]Pavel Kozhevnikov, Russia[/i]

For positive integers $1 \le n \le 100$, let \[ f(n) = \sum_{i=1}^{100} i\left\lvert i-n \right\rvert. \] Compute $f(54)-f(55)$. [i]Proposed by Aaron Lin[/i]

A shoe brand proposes: Buy a pair of shoes without paying. It's about this: you go to the factory and pay $20,000 \$ $ for a pair of shoes, get the shoes and ten stamps, with a unit cost of each stamp $2000 \$ $. By selling these stamps you will get your money back. The ones who buy these stamps go to the factory, delivers them and for $18,000 \$ $ they receive their pair of shoes and the ten stamps, thus continuing the cycle. $\bullet$ How much does the factory receive for each pair of shoes? $\bullet$ Can this operation be repeated a hundred times, assuming that no one repeats itself? [hide=original wording]Una marca de zapatos propone: Compre un par de zapatos sin pagar. Se trata de lo siguiente: usted va a la fabrica y paga \$ 20000 por un par de zapatos; recibe los zapatos y diez estampillas, con un costo unitario de ]\$ 2000. Al vender estas estampillas recuperara su dinero. Quienes compren estas estampillas van a la fabrica, la entregan y por \$ 18000 reciben su par de zapatos y las diez estampillas, continuando as el ciclo. - Cuanto recibe la fabrica por cada par de zapatos? - Se puede repetir esta operacion cien veces, suponiendo que nadie se repite?[/hide]

The shape of a military base is an equilateral triangle of side $10$ kilometers. Security constraints make cellular phone com­munication possible only within $2.5$ kilometers. Each of $17$ soldiers patrols the base randomly and tries to contact all others. Prove that at each moment at least two soldiers can communicate.

In an acute-angled triangle, each angle is an integral number of degrees, and the smallest angle is one-fifth of the largest one. Find these angles. (G Galperin)

Let $ n \leq 44, n \in \mathbb{N}.$ Prove that for any function $ f$ defined over $ \mathbb{N}^2$ whose images are in the set $ \{1, 2, \ldots , n\},$ there are four ordered pairs $ (i, j), (i, k), (l, j),$ and $ (l, k)$ such that \[ f(i, j) \equal{} f(i, k) \equal{} f(l, j) \equal{} f(l, k),\] in which $ i, j, k, l$ are chosen in such a way that there are natural numbers $ m, p$ that satisfy \[ 1989m \leq i < l < 1989 \plus{} 1989m\] and \[ 1989p \leq j < k < 1989 \plus{} 1989p.\]

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Prove that in every triangle with sides $a, b, c$ and opposite angles $A, B, C$, is fulfilled (measuring the angles in radians) $$\frac{a A+bB+cC}{a+b+c} \ge \frac{\pi}{3}$$ Hint: Use $a \ge b \ge c \Rightarrow A \ge B \ge C$.

Let $AA_1$, $BB_1$, $CC_1$ be the altitudes of an acute angled triangle $ABC$. On the side $BC$ point $K$ is taken such that $\angle BB_1K=\angle A$. On the side $AB$ a point $M$ is taken such that $\angle BB_1M\angle C$. Let $L$ be the intersection of $BB_1$ and $A_1C_1$. Prove that the quadrilateral $B_1KLM$ is circumscribed. [I]Proposed by A. Khrabrov, D. Rostovski[/i]

Let $ R$ be a ring with 1. Every element in $ R$ can be written as product of idempotent ($ u^n\equal{}u$ for some $ n$) elements. Prove that $ R$ is commutative

Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]

Let $m\ge2$ be an integer. The sequence $(a_n)_{n\in\mathbb N}$ is defined by $a_0=0$ and $a_n=\left\lfloor\frac nm\right\rfloor+a_{\left\lfloor\frac nm\right\rfloor}$ for all $n$. Determine $\lim_{n\to\infty}\frac{a_n}n$.

$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.

* What is the radius of the largest possible circle inscribed into a cube with side $a$?

Cards numbered with numbers $1$ to $1000$ are to be placed on the cells of a $1\times 1994$ rectangular board one by one, according to the following rule: If the cell next to the cell containing the card $n$ is free, then the card $n+1$ must be put on it. Prove that the number of possible arrangements is not more than half a mllion.

Call a quadratic [i]invasive[/i] if it has $2$ distinct real roots. Let $P$ be a quadratic polynomial with real coefficients. Prove that $P(x)$ is invasive [b]if and only if[/b] there exists a real number $c \neq 0$ such that $P(x) + P(x - c)$ is invasive.

Find all real polynomials $ p(x)$ of degree $ n \ge 2$ for which there exist real numbers $ r_1 < r_2 < ... < r_n$ such that (i) $ p(r_i) \equal{} 0, 1 \le i \le n$, and (ii) $ p' \left( \frac {r_i \plus{} r_{i \plus{} 1}}{2} \right) \equal{} 0, 1 \le i \le n \minus{} 1$. [b]Follow-up:[/b] In terms of $ n$, what is the maximum value of $ k$ for which $ k$ consecutive real roots of a polynomial $ p(x)$ of degree $ n$ can have this property? (By "consecutive" I mean we order the real roots of $ p(x)$ and ignore the complex roots.) In particular, is $ k \equal{} n \minus{} 1$ possible for $ n \ge 3$?

The new PUMaC tournament hosts $2020$ students, numbered by the following set of labels $1, 2, . . . , 2020$. The students are initially divided up into $20$ groups of $101$, with each division into groups equally likely. In each of the groups, the contestant with the lowest label wins, and the winners advance to the second round. Out of these $20$ students, we chose the champion uniformly at random. If the expected value of champion’s number can be written as $\frac{a}{b}$, where $a, b$ are relatively prime integers, determine $a + b$.

The diagonals of a cyclic convex quadrilateral $ABCD$ intersect at $P$. A circle through $P$ touches the side $CD$ at its midpoint $M$ and intersects the segments $BD$ and $AC$ again at the points $Q$ and $R$ respectively. Let $S$ be the point on segment $BD$ such that $BS = DQ$. The line through $S$ parallel to $AB$ intersects $AC$ at $T$. Prove that $AT = RC$.

As everyone knows, the people of [i]Plane Land[/i] love Planimetrics. Therefore, they imagine their country as completely planar, every city in the country as a geometric point and every road as the line segment connecting two points. Additionally to the existing cities, it is possible to build [i]roundabouts[/i], i.e. points in the road network from where at least two roads emanate. All road crossings or junctions are build as roundabouts. Via this route network, every two cities should be connected by a sequence of roads and possibly roundabouts. In Plane Land, the length of a road is taken as the geometric length of the corresponding line segment. The ingenious road engineer Armin Asphalt presents a new road map, of which it is known that there is no road network with a smaller total length of all roads. Moreover, there is no road map with the same total length of all roads and fewer roundabouts. Prove that in the road map of Armin Asphalt, at most three roads emanate from each city, and exactly three from each roundabout.

Prove that there exists an integer $n$, $n\geq 2002$, and $n$ distinct positive integers $a_1,a_2,\ldots,a_n$ such that the number $N= a_1^2a_2^2\cdots a_n^2 - 4(a_1^2+a_2^2+\cdots + a_n^2) $ is a perfect square.

Compute the area of the trapezoid $ABCD$ with right angles $BAD$ and $ADC$ and side lengths of $AB=3$, $BC=5$, and $CD=7$.