Show that there exists a set of infinite positive integers such that the sum of an arbitrary finite subset of these is never a perfect square. What happens if we change the condition from not being a perfect square to not being a perfect power?

Solve the following system in the set of real numbers: $x^2 -xy+y^2 = 7$, $x^2y+xy^2 = -2$.

a) Find all integers that can divide both the numerator and denominator of the ratio $\frac{5m + 6}{8m + 7}$ for an integer $m$. b) Let $a, b, c, d, m$ be integers. Prove that if the numerator and denominator of the ratio $\frac{am + b}{cm+ d}$ are both divisible by $k$, then so is $ad - bc$.

Suppose that a function $f:\mathbb R\to\mathbb R$ is such that for any real $h$ there exist at most $19990509$ different values of $x$ for which $f(x)\ne f(x+h)$. Prove that there is a set of at most $9995256$ real numbers such that $f$ is constant outside of this set.

Let $a$ be a positive integer such that $\gcd(an+1, 2n+1) = 1$ for all integer $n$. a) Prove that $\gcd(a-2, 2n+1) = 1$ for all integer $n$. b) Find all possible $a$.

Alice and Bob play the following game. They write the expressions $x + y$, $x - y$, $x^2+xy+y^2$ and $x^2-xy+y^2$ each on a separate card. The four cards are shuffled and placed face down on a table. One of the cards is turned over, revealing the expression written on it, after which Alice chooses any two of the four cards, and gives the other two to Bob. All cards are then revealed. Now Alice picks one of the variables $x$ and $y$, assigns a real value to it, and tells Bob what value she assigned and to which variable. Then Bob assigns a real value to the other variable. Finally, they both evaluate the product of the expressions on their two cards. Whoever gets the larger result, wins. Which player, if any, has a winning strategy?

Incircle of triangle $ABC$ tangent to $AB$ and $AC$ on $E$ and $F$ respectively. If $X$ is the midpoint of $EF$, prove $\angle BXC > 90^{\circ}$

Determine, with proof, the smallest positive integer $c$ such that for any positive integer $n$, the decimal representation of the number $c^n+2014$ has digits all less than $5$. [i]Proposed by Evan Chen[/i]

If $a, b, c$ are real numbers such that $$a^2 + b^2 + c^2 = 1$$ prove the inequalities $$- \frac12 \le ab + bc + ca \le 1$$

Construct a triangle, the base of which lies on the given line, and the feet of the altitudes, drawn on the sides, coincide with the given points.

Max has a light bulb and a defective switch. The light bulb is initially off, and on the $n$th time the switch is flipped, the light bulb has a $\tfrac 1{2(n+1)^2}$ chance of changing its state (i.e. on $\to$ off or off $\to$ on). If Max flips the switch 100 times, find the probability the light is on at the end. [i]Proposed by Connor Gordon[/i]

Prove that for any set containing $2047$ positive integers, there exists $1024$ positive integers in the set such that the sum of these positive integers is divisible by $1024$.

Consider the set $S = \{1, 2, . . . , 2015\}$. How many ways are there to choose $2015$ distinct (possibly empty and possibly full) subsets $X_1, X_2, . . . , X_{2015}$ of $S$ such that $X_i$ is strictly contained in $X_{i+1}$ for all $1 \le i \le 2014$?

a) Prove that there exists a sequence of digits $\{c_n\}_{n\geq 1}$ such that or each $n\geq 1$ no matter how we interlace $k_n$ digits, $1\leq k_n\leq 9$, between $c_n$ and $c_{n+1}$, the infinite sequence thus obtained does not represent the fractional part of a rational number. b) Prove that for $1\leq k_n\leq 10$ there is no such sequence $\{c_n\}_{n\geq 1}$. [i]Dan Schwartz[/i]

Let the set of all bijective functions taking positive integers to positive integers be $\mathcal B.$ Find all functions $\mathbf F:\mathcal B\to \mathbb R$ such that $$(\mathbf F(p)+\mathbf F(q))^2=\mathbf F(p \circ p)+\mathbf F(p\circ q)+\mathbf F(q\circ p)+\mathbf F(q\circ q)$$ for all $p,q \in \mathcal B.$ [i]Proposed by ckliao914[/i]

Let $f:[0,1]\to\mathbb R$ be a continuous function such that $\int^1_0x^mf(x)dx=0$ for $m=0,1,\ldots,1999$. Prove that $f$ has at least $2000$ zeroes on the segment $[0,1]$.

The numbers from 1 to 1996 are written down ------ 12345678910111213.... How many zeros are written? A. 489 B. 699 C. 796 D. 996 E. None of these

Let $n$ and $k$ be given integers such that $n\ge k\ge 2$. Alice and Bob play a game on an $n$ by $n$ table with white cells. They take turns to pick a white cell and color it black. Alice moves first. The game ends as soon as there is at least one black cell in every $k$ by $k$ square after a player moves, who is declared the winner of the game. Who has the winning strategy?

Given are $n$ points with different abscissas in the plane. Through every pair points is drawn a parabola - a graph of a square trinomial with leading coefficient equal to $1$. A parabola is called $good$ if there are no other marked points on it, except for the two through which it is drawn, and there are no marked points above it (i.e. inside it). What is the greatest number of $good$ parabolas?

Ten million fireflies are glowing in $\mathbb{R}^3$ at midnight. Some of the fireflies are friends, and friendship is always mutual. Every second, one firefly moves to a new position so that its distance from each one of its friends is the same as it was before moving. This is the only way that the fireflies ever change their positions. No two fireflies may ever occupy the same point. Initially, no two fireflies, friends or not, are more than a meter away. Following some finite number of seconds, all fireflies find themselves at least ten million meters away from their original positions. Given this information, find the greatest possible number of friendships between the fireflies. [i]Nikolai Beluhov[/i]

Point $C$ is chosen on the arc of a semicircle with diameter $AB$. The two circles with diameters of $AC$ and $BC$ intersect again at point $D$. If $DA=20$ and $DB=16$, compute the length of $DC$.

$9$ horizontal and $9$ vertical lines are drawn through a square. Prove that it is possible to select $20$ rectangles so that the sides of each rectangle is a segment of one of the given lines (including the sides of the square), and for any two of the $20$ rectangles, it is possible to cover one of them with the other (rotations are allowed).

Consider the following one-person game: A player starts with score $0$ and writes the number $20$ on an empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers (call them $b$ and $c$) such that $b + c = a$. The player then adds $b\times c$ to her score. She repeats the step several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is calculated. Let $M, m$ be the maximum and minimum final score that can be possibly obtained respectively. Find $M-m$.

Determine the smallest $n$ such that $n \equiv (a - 1)$ mod $a$ for all $a \in \{2,3,..., 10\}$.

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]