Prove: From the set $\{1,2,...,n\}$, one can choose a subset with at most $2 \left\lfloor \sqrt n \right\rfloor +1$ elements such that the set of the pairwise differences from this subset is $\{1,2,...,n-1\}$. ($\left\lfloor x \right\rfloor$ means the greatest integer $\leq x$)

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Find the angles of the pentagon $ABCDE$ in the figure below.

Find all polynomials $P_n(x)$ of the form $$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\ldots+a_1x+(-1)^nn(n+1),$$with integer coefficients, such that its roots $x_1,x_2,\ldots,x_n$ satisfy $k\le x_k\le k+1$ for $k=1,2,\ldots,n$.

[u]Round 1[/u] [b]p1.[/b] Six pirates – Captain Jack and his five crewmen – sit in a circle to split a treasure of $99$ gold coins. Jack must decide how many coins to take for himself and how many to give each crewman (not necessarily the same number to each). The five crewmen will then vote on Jack's decision. Each is greedy and will vote “aye” only if he gets more coins than each of his two neighbors. If a majority vote “aye”, Jack's decision is accepted. Otherwise Jack is thrown overboard and gets nothing. What is the most coins Captain Jack can take for himself and survive? [b]p2[/b]. Rose and Bella take turns painting cells red and blue on an infinite piece of graph paper. On Rose's turn, she picks any blank cell and paints it red. Bella, on her turn, picks any blank cell and paints it blue. Bella wins if the paper has four blue cells arranged as corners of a square of any size with sides parallel to the grid lines. Rose goes first. Show that she cannot prevent Bella from winning. [img]https://cdn.artofproblemsolving.com/attachments/d/6/722eaebed21a01fe43bdd0dedd56ab3faef1b5.png[/img] [b]p3.[/b] A $25\times 25$ checkerboard is cut along the gridlines into some number of smaller square boards. Show that the total length of the cuts is divisible by $4$. For example, the cuts shown on the picture have total length $16$, which is divisible by $4$. [img]https://cdn.artofproblemsolving.com/attachments/c/1/e152130e48b804fe9db807ef4f5cd2cbad4947.png[/img] [b]p4.[/b] Each robot in the Martian Army is equipped with a battery that lasts some number of hours. For any two robots, one's battery lasts at least three times as long as the other's. A robot works until its battery is depleted, then recharges its battery until it is full, then goes back to work, and so on. A battery that lasts $N$ hours takes exactly $N$ hours to recharge. Prove that there will be a moment in time when all the robots are recharging (so you can invade the planet). [b]p5.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png [/img] [u]Round 2[/u] [b]p6.[/b] The sum of $2015$ rational numbers is an integer. The product of every pair of them is also an integer. Prove that they are all integers. (A rational number is one that can be written as $m/n$, where $m$ and $n$ are integers and $n\ne 0$.) [b]p7.[/b] An $N \times N$ table is filled with integers such that numbers in cells that share a side differ by at most $1$. Prove that there is some number that appears in the table at least $N$ times. For example, in the $5 \times 5$ table below the numbers $1$ and $2$ appear at least $5$ times. [img]https://cdn.artofproblemsolving.com/attachments/3/8/fda513bcfbe6834d88fb8ca0bfcdb504d8b859.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ann and Drew have purchased a mysterious slot machine; each time it is spun, it chooses a random positive integer such that $k$ is chosen with probability $2^{-k}$ for every positive integer $k$, and then it outputs $k$ tokens. Let $N$ be a fixed integer. Ann and Drew alternate turns spinning the machine, with Ann going first. Ann wins if she receives at least $N$ total tokens from the slot machine before Drew receives at least $M=2^{2018}$ total tokens, and Drew wins if he receives $M$ tokens before Ann receives $N$ tokens. If each person has the same probability of winning, compute the remainder when $N$ is divided by $2018$. [i]Proposed by Brandon Wang[/i]

Compute the smallest positive integer that is $3$ more than a multiple of $5$, and twice a multiple of $6$.

Let $v_0 = 0, v_1 = 1$ and $v_{n+1} = 8 \cdot v_n - v_{n-1},$ $n = 1,2, ...$. Prove that in the sequence $\{v_n\}$ there aren't terms of the form $3^{\alpha} \cdot 5^{\beta}$ with $\alpha, \beta \in \mathbb{N}.$

$X$ and $Y$ are two points lying on or on the extensions of side $BC$ of $\triangle{ABC}$ such that $\widehat{XAY} = 90$. Let $H$ be the orthocenter of $\triangle{ABC}$. Take $X'$ and $Y'$ as the intersection points of $(BH,AX)$ and $(CH,AY)$ respectively. Prove that circumcircle of $\triangle{CYY'}$,circumcircle of $\triangle{BXX'}$ and $X'Y'$ are concurrent.

Prove that $$ a+b+c>\left( \sqrt\alpha +\sqrt\beta +\sqrt\gamma \right)^2, $$ for all positive real numbers $ a,b,c,\alpha ,\beta ,\gamma $ that are under the condition $$ abc>\alpha bc+\beta ac+\gamma ab. $$ [i]Țuțescu Lucian[/i] and [i]Chiriță Aurel[/i]

Find all non-negative integers $x, y$ and $z$ satisfying the equation: \[7^{x}+1=3^{y}+5^z\]

The concave decagon shown below is embedded in the Cartesian coordinate plane such that all of its vertices have integer coordinates. Two opposite edges have length $5$, whereas the remaining eight edges have length $\sqrt{10}$. Every pair of opposite edges is parallel. The sides of the decagon do not intersect each other, and the decagon has vertical and horizontal axes of symmetry. Find the area of the decagon. [img]https://cdn.artofproblemsolving.com/attachments/1/5/daa4ab3d71af4b3274cd222f9a091eea3be705.png[/img]

The product, $ \log_a b \cdot \log_b a$ is equal to: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ a \qquad\textbf{(C)}\ b \qquad\textbf{(D)}\ ab \qquad\textbf{(E)}\ \text{none of these}$

For each positive integer $k$, we define the polynomial $S_k(x)=1+x+x^2+x^3+...+x^{k-1}$ Show that $n \choose 1$ $S_1(x) +$ $n \choose 2$ $S_2(x) +$ $n \choose 3$ $S_3(x)+...+$ $n \choose n$ $S_n(x) = 2^{n-1}S_n\left(\frac{1+x}{2}\right)$ for every positive integer $n$ and every real number $x$.

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

A given equilateral triangle of side $10$ is divided into $100$ equilateral triangles of side $1$ by drawing parallel lines to the sides of the original triangle. Find the number of equilateral triangles, having vertices in the intersection points of parallel lines whose sides lie on the parallel lines.

Let \(\mathcal{F}\) be a family of functions from \(\mathbb{R}^+ \to \mathbb{R}^+\). It is known that for all \( f, g \in \mathcal{F} \), there exists \( h \in \mathcal{F} \) such that for all \( x, y \in \mathbb{R}^+ \), the following equation holds: \[ y^2 \cdot f\left(\frac{g(x)}{y}\right) = h(xy) \] Prove that for all \( f \in \mathcal{F} \) and all \( x \in \mathbb{R}^+ \), the following identity is satisfied: \[ f\left(\frac{x}{f(x)}\right) = 1. \]

A positive integer is written on each corner of a square such that numbers on opposite vertices are relatively prime while numbers on adjacent vertices are not relatively prime. What is the smallest possible value of the sum of these $4$ numbers?

Find all function $ f: \mathbb{R} \rightarrow \mathbb{R}$ such that \[ f(x \plus{} y)(f(x) \minus{} y) \equal{} xf(x) \minus{} yf(y) \] for all $ x,y \in \mathbb{R}$.

A square with side length $2$ cm is placed next to a square with side length $6$ cm, as shown in the diagram. Find the shaded area, in cm$^2$. [img]https://cdn.artofproblemsolving.com/attachments/5/7/ceb4912a6e73ca751113b2b5c92cbfdbb6e0d1.png[/img]

Find the number of ordered pairs $(x,y)$, where both $x$ and $y$ are integers between $-100$ and $100$ inclusive, such that $12x^2-xy-6y^2=0$.

Let $ABC$ be a triangle with side lengths $AB = 13$, $AC = 17$, and $BC = 20$. Let $E, F$ be the feet of the altitudes from $B$ onto $AC$ and $C$ onto $AB$, respectively. Let $P$ be the second intersection of the circumcircles of $ABC$ and $AEF$. Suppose that $AP$ can be written as $\frac{a \sqrt{b}}{c}$ where $a, c$ are relatively prime and $b$ is square-free. Compute $a$.

Let $ABC$ be an acute triangle. The interior angle bisectors of $\angle ABC$ and $\angle ACB$ meet the opposite sides in $L$ and $M$ respectively. Prove that there is a point $K$ in the interior of the side $BC$ such that the triangle $KLM$ is equilateral if and only if $\angle BAC = 60^\circ$.

An integer $N > 1$ is written on the board. Alex writes a sequence of positive integers, obtaining new integers in the following manner: he takes any divisor greater than $1$ of the last number and either adds it to, or subtracts it from the number itself. Is it always (for all $N > 1$) possible for Alex to write the number $2011$ at some point?

Given positive reals $a,b,c,p,q$ satisfying $abc=1$ and $p \geq q$, prove that \[ p \left(a^2+b^2+c^2\right) + q\left( \frac{1}{a} + \frac{1}{b} + \frac{1}{c}\right) \geq (p+q) (a+b+c). \][i]Proposed by AJ Dennis[/i]