Determine the greatest natural number $n$, such that for each set $S$ of 2015 different integers there exist 2 subsets of $S$ (possible to be with 1 element and not necessarily non-intersecting) each of which has a sum of its elements divisible by $n$.

Let $n>2$ be a given positive integer. There are $n$ guests at Georg's bachelor party and each guest is friends with at least one other guest. Georg organizes a party game among the guests. Each guest receives a jug of water such that there are no two guests with the same amount of water in their jugs. All guests now proceed simultaneously as follows. Every guest takes one cup for each of his friends at the party and distributes all the water from his jug evenly in the cups. He then passes a cup to each of his friends. Each guest having received a cup of water from each of his friends pours the water he has received into his jug. What is the smallest possible number of guests that do not have the same amount of water as they started with?

$(x_1, y_1,z_1)$ and $(x_2, y_2, z_2)$ are triples of real numbers such that for every pair of integers $(m,n)$ at least one of $x_{1m} + y_{1n} + z_1$, $x_{2m} + y_{2n} + z_2$ is an even integer. Prove that one of the triples consists of three integers.

If $a=\sqrt[3]{9}-\sqrt[3]{3}+1$, what is $(\frac {4-a}a)^6$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 12 $

A given finite number of lines in the plane, no two of which are parallel and no three of which are concurrent, divide the plane into finite and infinite regions. In each finite region we write $1$ or $-1$. In one operation, we can choose any triangle made of three of the lines (which may be cut by other lines in the collection) and multiply by $-1$ each of the numbers in the triangle. Determine if it is always possible to obtain $1$ in all the finite regions by successively applying this operation, regardless of the initial distribution of $1$s and $-1$s.

Two players in turns color the squares of a $4 \times 4$ grid, one square at the time. Player loses if after his move a square of $2\times2$ is colored completely. Which of the players has the winning strategy, First or Second? [i](3 points)[/i]

If $a$ is a root of $x^3-x-1 = 0$, compute the value of $$a^{10 }+ 2a^8 -a^7 - 3a^6 - 3a^5 + 4a^4 + 2a^3 - 4a^4 - 6a - 17.$$

$S$ be a set of ordered triples $(a,b,c)$ of distinct elements of a finite set $A$. Suppose that [list=1] [*] $(a,b,c)\in S\iff (b,c,a)\in S$ [*] $(a,b,c)\in S\iff (c,b,a)\not\in S$ [*] $(a,b,c),(c,d,a)\text{ both }\in S\iff (b,c,d),(d,a,b)\text{ both }\in S$[/list] Prove there exists $g: A\to \mathbb{R}$, such that $g$ is one-one and $g(a)<g(b)<g(c)\implies (a,b,c)\in S$

[u]Set 7[/u] [b]p19.[/b] Let circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively, intersect at $X$ and $Y$ . A lies on $\omega_1$ and $B$ lies on $\omega_2$ such that $AO_1$ and $BO_2$ are both parallel to $XY$, and $A$ and $B$ lie on the same side of $O_1O_2$. If $XY = 60$, $\angle XAY = 45^o$, and $\angle XBY = 30^o$, then the length of $AB$ can be expressed in the form $\sqrt{a - b\sqrt2 + c\sqrt3}$, where $a, b, c$ are positive integers. Determine $a + b + c$. [b]p20.[/b] If $x$ is a positive real number such that $x^{x^2}= 2^{80}$, find the largest integer not greater than $x^3$. [b]p21.[/b] Justin has a bag containing $750$ balls, each colored red or blue. Sneaky Sam takes out a random number of balls and replaces them all with green balls. Sam notices that of the balls left in the bag, there are $15$ more red balls than blue balls. Justin then takes out $500$ of the balls chosen randomly. If $E$ is the expected number of green balls that Justin takes out, determine the greatest integer less than or equal to $E$. [u]Set 8[/u] These three problems are interdependent; each problem statement in this set will use the answers to the other two problems in this set. As such, let the positive integers $A, B, C$ be the answers to problems $22$, $23$, and $24$, respectively, for this set. [b]p22.[/b] Let $WXYZ$ be a rectangle with $WX =\sqrt{5B}$ and $XY =\sqrt{5C}$. Let the midpoint of $XY$ be $M$ and the midpoint of $YZ$ be $N$. If $XN$ and $W Y$ intersect at $P$, determine the area of $MPNY$ . [b]p23.[/b] Positive integers $x, y, z$ satisfy $$xy \equiv A \,\, (mod 5)$$ $$yz \equiv 2A + C\,\, (mod 7)$$ $$zx \equiv C + 3 \,\, (mod 9).$$ (Here, writing $a \equiv b \,\, (mod m)$ is equivalent to writing $m | a - b$.) Given that $3 \nmid x$, $3 \nmid z$, and $9 | y$, find the minimum possible value of the product $xyz$. [b]p24.[/b] Suppose $x$ and $y$ are real numbers such that $$x + y = A$$ $$xy =\frac{1}{36}B^2.$$ Determine $|x - y|$. [u]Set 9[/u] [b]p25. [/b]The integer $2017$ is a prime which can be uniquely represented as the sum of the squares of two positive integers: $$9^2 + 44^2 = 2017.$$ If $N = 2017 \cdot 128$ can be uniquely represented as the sum of the squares of two positive integers $a^2 +b^2$, determine $a + b$. [b]p26.[/b] Chef Celia is planning to unveil her newest creation: a whole-wheat square pyramid filled with maple syrup. She will use a square flatbread with a one meter diagonal and cut out each of the five polygonal faces of the pyramid individually. If each of the triangular faces of the pyramid are to be equilateral triangles, the largest volume of syrup, in cubic meters, that Celia can enclose in her pyramid can be expressed as $\frac{a-\sqrt{b}}{c}$ where $a, b$ and $c$ are the smallest possible possible positive integers. What is $a + b + c$? [b]p27.[/b] In the Cartesian plane, let $\omega$ be the circle centered at $(24, 7)$ with radius $6$. Points $P, Q$, and $R$ are chosen in the plane such that $P$ lies on $\omega$, $Q$ lies on the line $y = x$, and $R$ lies on the $x$-axis. The minimum possible value of $PQ+QR+RP$ can be expressed in the form $\sqrt{m}$ for some integer $m$. Find m. [u]Set 10[/u] [i]Deja vu?[/i] [b]p28. [/b] Let $ABC$ be a triangle with incircle $\omega$. Let $\omega$ intersect sides $BC$, $CA$, $AB$ at $D, E, F$, respectively. Suppose $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ is $K$ and the area of $DEF$ is $\frac{m}{n}\cdot K$, where $m$ and $n$ are relatively prime positive integers, then compute $m + n$. [b]p29.[/b] Sebastian is playing the game Split! again, but this time in a three dimensional coordinate system. He begins the game with one token at $(0, 0, 0)$. For each move, he is allowed to select a token on any point $(x, y, z)$ and take it off, replacing it with three tokens, one at $(x + 1, y, z)$, one at $(x, y + 1, z)$, and one at $(x, y, z + 1)$ At the end of the game, for a token on $(a, b, c)$, it is assigned a score $\frac{1}{2^{a+b+c}}$ . These scores are summed for his total score. If the highest total score Sebastian can get in $100$ moves is $m/n$, then determine $m + n$. [b]p30.[/b] Determine the number of positive $6$ digit integers that satisfy the following properties: $\bullet$ All six of their digits are $1, 5, 7$, or $8$, $\bullet$ The sum of all the digits is a multiple of $5$. [u]Set 11[/u] [b]p31.[/b] The triangular numbers are defined as $T_n =\frac{n(n+1)}{2}$. We also define $S_n =\frac{n(n+2)}{3}$. If the sum $$\sum_{i=16}^{32} \left(\frac{1}{T_i}+\frac{1}{S_i}\right)= \left(\frac{1}{T_{16}}+\frac{1}{S_{16}}\right)+\left(\frac{1}{T_{17}}+\frac{1}{S_{17}}\right)+...+\left(\frac{1}{T_{32}}+\frac{1}{S_{32}}\right)$$ can be written in the form $a/b$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$, then find $a + b$. [b]p32.[/b] Farmer Will is considering where to build his house in the Cartesian coordinate plane. He wants to build his house on the line $y = x$, but he also has to minimize his travel time for his daily trip to his barnhouse at $(24, 15)$ and back. From his house, he must first travel to the river at $y = 2$ to fetch water for his animals. Then, he heads for his barnhouse, and promptly leaves for the long strip mall at the line $y =\sqrt3 x$ for groceries, before heading home. If he decides to build his house at $(x_0, y_0)$ such that the distance he must travel is minimized, $x_0$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ , where $a, b, c, d$ are positive integers, $b$ is not divisible by the square of a prime, and $gcd(a, c, d) = 1$. Compute $a+b+c+d$. [b]p33.[/b] Determine the greatest positive integer $n$ such that the following two conditions hold: $\bullet$ $n^2$ is the difference of consecutive perfect cubes; $\bullet$ $2n + 287$ is the square of an integer. [u]Set 12[/u] The answers to these problems are nonnegative integers that may exceed $1000000$. You will be awarded points as described in the problems. [b]p34.[/b] The “Collatz sequence” of a positive integer n is the longest sequence of distinct integers $(x_i)_{i\ge 0}$ with $x_0 = n$ and $$x_{n+1} =\begin{cases} \frac{x_n}{2} & if \,\, x_n \,\, is \,\, even \\ 3x_n + 1 & if \,\, x_n \,\, is \,\, odd \end{cases}.$$ It is conjectured that all Collatz sequences have a finite number of elements, terminating at $1$. This has been confirmed via computer program for all numbers up to $2^{64}$. There is a unique positive integer $n < 10^9$ such that its Collatz sequence is longer than the Collatz sequence of any other positive integer less than $10^9$. What is this integer $n$? An estimate of $e$ gives $\max\{\lfloor 32 - \frac{11}{3}\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p35.[/b] We define a graph $G$ as a set $V (G)$ of vertices and a set $E(G)$ of distinct edges connecting those vertices. A graph $H$ is a subgraph of $G$ if the vertex set $V (H)$ is a subset of $V (G)$ and the edge set $E(H)$ is a subset of $E(G)$. Let $ex(k, H)$ denote the maximum number of edges in a graph with $k$ vertices without a subgraph of $H$. If $K_i$ denotes a complete graph on $i$ vertices, that is, a graph with $i$ vertices and all ${i \choose 2}$ edges between them present, determine $$n =\sum_{i=2}^{2018} ex(2018, K_i).$$ An estimate of $e$ gives $\max\{\lfloor 32 - 3\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p36.[/b] Write down an integer between $1$ and $100$, inclusive. This number will be denoted as $n_i$ , where your Team ID is $i$. Let $S$ be the set of Team ID’s for all teams that submitted an answer to this problem. For every ordered triple of distinct Team ID’s $(a, b, c)$ such that a, b, c ∈ S, if all roots of the polynomial $x^3 + n_ax^2 + n_bx + n_c$ are real, then the teams with ID’s $a, b, c$ will each receive one virtual banana. If you receive $v_b$ virtual bananas in total and $|S| \ge 3$ teams submit an answer to this problem, you will be awarded $$\left\lfloor \frac{32v_b}{3(|S| - 1)(|S| - 2)}\right\rfloor$$ points for this problem. If $|S| \le 2$, the team(s) that submitted an answer to this problem will receive $32$ points for this problem. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777264p24369138]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x,y$ and $z$ be real numbers such that $0 \leq x,y,z \leq 1.$ Prove that \[xyz+(1-x)(1-y)(1-z) \leq 1.\] When does equality hold?

Points $A$, $B$, and $C$ lie on a line, in that order, with $AB=8$ and $BC=2$. $B$ is rotated $20^\circ$ counter-clockwise about $A$ to a point $B'$, tracing out an arc $R_1$. $C$ is then rotated $20^\circ$ clockwise about $A$ to a point $C'$, tracing out an arc $R_2$. What is the area of the region bounded by arc $R_1$, segment $B'C$, arc $R_2$, and segment $C'B$? [i]Proposed by Thomas Lam[/i]

Let triangle $\vartriangle ABC$ have circumcenter $O$ and circumradius $r$, and let $\omega$ be the circumcircle of ntriangle $\vartriangle BOC$. Let $F$ be the intersection of $\overleftrightarrow{AO}$ and $\omega$ not equal to $O$. Let $E$ be on line $\overleftrightarrow{AB}$ such that $\overline{EF} \perp \overline{AE}$, and let $G$ be on line $\overleftrightarrow{AC}$ such that $\overline{GF} \perp \overline{AG}$. If $AC =\frac{65}{63}$ , $BC = \frac{24}{13}r$, and $AB = \frac{126}{65}r$, compute $AF \cdot EG$.

Given quadrilateral $ABCD$ with $AB=BC=CD$. Let $AC\cap BD=O$, $X,Y$ are symmetry points of $O$ respect to midpoints of $BC$, $AD$, and $Z$ is intersection point of lines, which perpendicular bisects of $AC$, $BD$. Prove that $X,Y,Z$ are collinear.

Determine all real solutions $(a_1,...,a_n)$ of the following system of equations: $$\begin{cases}a_3 = a_2 + a_1\\ a_4 = a_3 + a_2\\ ...\\ a_n = a_{n-1} + a_{n-2}\\ a_1= a_n +a_{n-1} \\ a_2 = a_1 + a_n \end{cases}$$

Let $U$ be the sum of lengths of sides of a tetrahedron (triangular pyramid) with vertices $O,A,B,C$. Let $V$ be the volume of the convex shape whose vertices are the midpoints of the sides of the tetrahedron. Show that $V\leq \frac{(U-|OA|-|BC| )(U-|OB|-|AC| )(U-|OC|-|AB| )}{(2^{7} \cdot 3)}$.

Suppose that $a > 0; b > 0$ and $a + b \leq 1$. Determine the minimum value of $M=\frac{1}{ab} +\frac{1}{a^2+ab}+\frac{1}{ab+b^2}+\frac{1}{a^2+b^2}$.

Prove that \[\tan 7 30^{\prime }=\sqrt{6}+\sqrt{2}-\sqrt{3}-2.\]

$\displaystyle 2n$ students $\displaystyle (n \geq 5)$ participated at table tennis contest, which took $\displaystyle 4$ days. In every day, every student played a match. (It is possible that the same pair meets twice or more times, in different days) Prove that it is possible that the contest ends like this: - there is only one winner; - there are $\displaystyle 3$ students on the second place; - no student lost all $\displaystyle 4$ matches. How many students won only a single match and how many won exactly $\displaystyle 2$ matches? (In the above conditions)

$S_n$ is a square side $\frac{1}{n}$. Find the smallest $k$ such that the squares $S_1, S_2,S_3, ...$ can be put into a square side $k$ without overlapping.

The line $l$ intersects the extension of $AB$ in $D$ ($D$ is nearer to $B$ than $A$) and the extension of $AC$ in $E$ ($E$ is nearer to $C$ than $A$) of triangle $ABC$. Suppose that reflection of line $l$ to perpendicular bisector of side $BC$ intersects the mentioned extensions in $D'$ and $E'$ respectively. Prove that if $BD+CE=DE$, then $BD'+CE'=D'E'$.

Let $ f$ be a finite real function of one variable. Let $ \overline{D}f$ and $ \underline{D}f$ be its upper and lower derivatives, respectively, that is, \[ \overline{D}f\equal{}\limsup_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}\] , \[ \underline{D}f\equal{}\liminf_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}.\] Show that $ \overline{D}f$ and $ \underline{D}f$ are Borel-measurable functions. [A. Csaszar]

A regular hexagon and an equilateral triangle have equal perimeter. If the area of the triangle is $4\sqrt3$ square units, the area of the hexagon is (A): $5\sqrt3$, (B): $6\sqrt3$, (C): $7\sqrt3$, (D): $8\sqrt3$, (E): None of the above.

Let $A_{1}$, $B_{1}$, $C_{1}$ be the feet of the altitudes of an acute-angled triangle $ABC$ issuing from the vertices $A$, $B$, $C$, respectively. Let $K$ and $M$ be points on the segments $A_{1}C_{1}$ and $B_{1}C_{1}$, respectively, such that $\measuredangle KAM = \measuredangle A_{1}AC$. Prove that the line $AK$ is the angle bisector of the angle $C_{1}KM$.

For each integer $m$, consider the polynomial \[ P_m(x)=x^4-(2m+4)x^2+(m-2)^2. \] For what values of $m$ is $P_m(x)$ the product of two non-consant polynomials with integer coefficients?

The persons $P_1, P_2, . . . , P_{n-1}, P_n$ sit around a table, in this order, and each one of them has a number of coins. In the start, $P_1$ has one coin more than $P_2, P_2$ has one coin more than $P_3$, etc., up to $P_{n-1}$ who has one coin more than $P_n$. Now $P_1$ gives one coin to $P_2$, who in turn gives two coins to $P_3 $ etc., up to $ Pn$ who gives n coins to $ P_1$. Now the process continues in the same way: $P_1$ gives $n+ 1$ coins to $P_2$, $P_2$ gives $n+2$ coins to $P_3$; in this way the transactions go on until someone has not enough coins, i.e. a person no more can give away one coin more than he just received. At the moment when the process comes to an end in this manner, it turns out that there are two neighbours at the table such that one of them has exactly five times as many coins as the other. Determine the number of persons and the number of coins circulating around the table.