Given a positive integer $n$, determine all functions $f$ from the first $n$ positive integers to the positive integers, satisfying the following two conditions: [b](1)[/b] $\sum_{k=1}^{n}{f(k)}=2n$; and [b](2)[/b] $\sum_{k\in K}{f(k)}=n$ for no subset $K$ of the first $n$ positive integers.

Let $ ABC $ be an acute triangle. Denote by $ D $ the foot of the perpendicular line drawn from the point $ A $ to the side $ BC $, by $M$ the midpoint of $ BC $, and by $ H $ the orthocenter of $ ABC $. Let $ E $ be the point of intersection of the circumcircle $ \Gamma $ of the triangle $ ABC $ and the half line $ MH $, and $ F $ be the point of intersection (other than $E$) of the line $ ED $ and the circle $ \Gamma $. Prove that $ \tfrac{BF}{CF} = \tfrac{AB}{AC} $ must hold. (Here we denote $XY$ the length of the line segment $XY$.)

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

Let $a_0,a_1,\dots,a_n \in \mathbb N$. Prove that there exist positive integers $b_0,b_1,\dots,b_n$ such that for $0 \leq i \leq n : a_i \leq b_i \leq 2a_i$ and polynomial \[P(x) = b_0 + b_1 x + \dots + b_n x^n\] is irreducible over $\mathbb Q[x]$. (10 points)

Let $n>100$ be a positive integer and originally the number $1$ is written on the blackboard. Petya and Vasya play the following game: every minute Petya represents the number of the board as a sum of two distinct positive fractions with coprime nominator and denominator and Vasya chooses which one to delete. Show that Petya can play in such a manner, that after $n$ moves, the denominator of the fraction left on the board is at most $2^n+50$, no matter how Vasya acts.

Republic has $n \geq 2$ cities, between some pairs of cities there are non-directed flight routes. From each city it is possible to get to any other city, and we will call the minimal number of flights required to do that the [i]distance[/i] between the cities. For every city consider the biggest distance to another city. It turned out that for every city this number is equal to $m$. Find all values $m$ can attain for given $n$

Find all continuous real functions $ f,g$ and $ h$ defined on the set of positive real numbers and satisfying the relation \[ f(x\plus{}y)\plus{}g(xy)\equal{}h(x)\plus{}h(y)\] for all $ x>0$ and $ y>0$. [i]Z. Daroczy[/i]

Outside triangle $ ABC $ equilateral triangles $ BMC $, $ CNA $, and $ APB $ are constructed. Prove that the centers $ S $, $ T $, $ U $ of these triangles form an equilateral triangle.

Let $n$ be a positive integer. Let $S=\{a_1,\ldots, a_{k}\}$ be a finite collection of at least $n$ not necessarily distinct positive real numbers. Let $$f(S)=\left(\sum_{i=1}^{k} a_{i}\right)^{n}$$ and $$g(S)=\sum_{1\leq i_{1}<\ldots<i_{n} \leq k} a_{i_{1}}\cdot\ldots\cdot a_{i_{n}}.$$ Determine $\sup_{S} \frac{g(S)}{f(S)}$.

Over all real numbers $x$, let $k$ be the minimum possible value of the expression $$\sqrt{x^2 + 9} +\sqrt{x^2 - 6x + 45}.$$ Determine $k^2$.

Let $n\geq1$ be an integer and let $t_1<t_2<\dots<t_n$ be positive integers. In a group of $t_n+1$ people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time: (i) The number of games played by each person is one of $t_1,t_2,\dots,t_n$. (ii) For every $i$ with $1\leq i\leq n$, there is someone who has played exactly $t_i$ games of chess.

There are $14$ students with different heights. At each step, two adjacent students will be swapped. Whatever the first arrangement is, in at least how many steps the students can be lined up? $\textbf{(A)}\ 42 \qquad\textbf{(B)}\ 43 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 52 \qquad\textbf{(E)}\ \text{None}$

A picture with an area of $160$ square inches is surrounded by a $2$ inch border. The picture with its border is a rectangle twice as long as it is wide. How many inches long is that rectangle?

What is the smallest non-square positive integer that is the product of four prime numbers (not necessarily distinct)?

In the addition problem, each digit has been replaced by a letter. If different letters represent different digits then $C=$ [asy] unitsize(18); draw((-1,0)--(3,0)); draw((-3/4,1/2)--(-1/4,1/2)); draw((-1/2,1/4)--(-1/2,3/4)); label("$A$",(0.5,2.1),N); label("$B$",(1.5,2.1),N); label("$C$",(2.5,2.1),N); label("$A$",(1.5,1.1),N); label("$B$",(2.5,1.1),N); label("$A$",(2.5,0.1),N); label("$3$",(0.5,-.1),S); label("$0$",(1.5,-.1),S); label("$0$",(2.5,-.1),S); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 7 \qquad \text{(E)}\ 9$

Real numbers $x_1, x_2, \dots, x_{2018}$ satisfy $x_i + x_j \geq (-1)^{i+j}$ for all $1 \leq i < j \leq 2018$. Find the minimum possible value of $\sum_{i=1}^{2018} ix_i$.

Prove that if $x>0$ and $n\in\mathbb N,$ then we have \[\frac{x^n(x^{n+1}+1)}{x^n+1}\leq\left(\frac {x+1}{2}\right)^{2n+1}.\]

Solve the system of equations $$\begin{cases} \dfrac{x+y}{1+xy}=\dfrac{1-2y}{2-y} \\ \dfrac{x-y}{1-xy}=\dfrac{1-3x}{3-x} \end{cases}$$

Prove that the sequence $a_{n}=\lfloor n\sqrt 2 \rfloor+\lfloor n\sqrt 3 \rfloor$ contains infintely many even and infinitely many odd numbers.

Let $ABCD$ be a square, and let $\Gamma$ be the circle that is inscribed in square $ABCD$. Let $E$ and $F$ be points on line segments $AB$ and $AD$, respectively, so that $EF$ is tangent to $\Gamma$. Find the ratio of the area of triangle $CEF$ to the area of square $ABCD$.

Let $\Gamma_1$ and $\Gamma_2$ be circles intersecting at points $A$ and $B$. A line through $A$ intersects $\Gamma_1$ and $\Gamma_2$ at $C$ and $D$ respectively. Let $P$ be the intersection of the lines tangent to $\Gamma_1$ at $A$ and $C$, and let $Q$ be the intersection of the lines tangent to $\Gamma_2$ at $A$ and $D$. Let $X$ be the second intersection point of the circumcircles of $BCP$ and $BDQ$, and let $Y$ be the intersection of lines $AB$ and $PQ$. Prove that $C$, $D$, $X$ and $Y$ are concyclic. [i]Proposed by Ariel García[/i]

As shown in the figure, in the acute angle $\vartriangle ABC$, $AB > AC$, $M$ is the midpoint of the minor arc $BC$ of the circumcircle $\Omega$ of $\vartriangle ABC$. $K$ is the intersection point of the bisector of the exterior angle $\angle BAC$ and the extension line of $BC$. From point $A$ draw a line perpendicular on $BC$ and take a point $D$ (different from $A$) on that line , such that $DM = AM$. Let the circumscribed circle of $\vartriangle ADK$ intersect the circle $\Omega$ at point $A$ and at another point $T$. Prove that $AT$ bisects line segment $BC$. [img]https://cdn.artofproblemsolving.com/attachments/1/3/6fde30405101620828d63ae31b8c0ffcec972f.png[/img]

Let $a$ and $b$ be two positive real numbers such that $a+b=ab$. Prove that $\frac{a}{b^{2}+4}+\frac{b}{a^{2}+4}\geq \frac{1}{2}$.

Let be given $a < b < c$ and $f(x) =\frac{c(x - a)(x - b)}{(c - a)(c - b)}+\frac{a(x - b)(x - c)}{(a - b)(a -c)}+\frac{b(x -c)(x - a)}{(b - c)(b - a)}$. Determine $f(2014)$.

Let $S$ be a set, $|S|=35$. A set $F$ of mappings from $S$ to itself is called to be satisfying property $P(k)$, if for any $x,y\in S$, there exist $f_1, \cdots, f_k \in F$ (not necessarily different), such that $f_k(f_{k-1}(\cdots (f_1(x))))=f_k(f_{k-1}(\cdots (f_1(y))))$. Find the least positive integer $m$, such that if $F$ satisfies property $P(2019)$, then it also satisfies property $P(m)$.