Let $n$ be a fixed positive integer and let $x, y$ be positive integers such that $xy = nx+ny$. Determine the minimum and the maximum of $x$ in terms of $n$.

Find all pairs $ (p, q)$ of primes such that $ {p}^{p}\plus{}{q}^{q}\plus{}1$ is divisible by $ pq$.

Find all real number $x$ which could be represented as $x = \frac{a_0}{a_1a_2 . . . a_n} + \frac{a_1}{a_2a_3 . . . a_n} + \frac{a_2}{a_3a_4 . . . a_n} + . . . + \frac{a_{n-2}}{a_{n-1}a_n} + \frac{a_{n-1}}{a_n}$ , with $n, a_1, a_2, . . . . , a_n$ are positive integers and $1 = a_0 \leq a_1 < a_2 < . . . < a_n$

Let there be positive integers $a, c$. Positive integer $b$ is a divisor of $ac-1$. For a positive rational number $r$ which is less than $1$, define the set $A(r)$ as follows. $$A(r) = \{m(r-ac)+nab| m, n \in \mathbb{Z} \}$$ Find all rational numbers $r$ which makes the minimum positive rational number in $A(r)$ greater than or equal to $\frac{ab}{a+b}$.

Given two positive integers $a$ and $b$, an [i]legal move[/i] consists in choosing a proper divisor of one of them and adding it to $a$ or adding it to $b$. Two players, Agustin and Ian, take turns making an legal move; Agustin plays first. Whoever gets a number greater than or equal to $2015$ wins the game. [list=a] [*]Determine which of the players has a winning strategy if $a=3, b=5$. [*]Determine which of the players has a winning strategy if $a=6, b=7$. [/list]

Let $n$ be a given positive integer. Prove that there exist infinitely many integer triples $(x,y,z)$ such that \[nx^2+y^3=z^4,\ \gcd (x,y)=\gcd (y,z)=\gcd (z,x)=1.\]

Let $n\geqslant 2$ and $a_1,a_2,\ldots,a_n$ be non-zero integers such that $a_1+a_2+\cdots+a_n=a_1a_2\cdots a_n.$ Prove that \[(a_1^2-1)(a_2^2-1)\cdots(a_n^2-1)\]is a perfect square.

At a recent math contest, Evan was asked to find $2^{2016} \pmod{p}$ for a given prime number $p$ with $100 < p < 500$. Evan has forgotten what the prime $p$ was, but still remembers how he solved it: [list] [*] Evan first tried taking $2016$ modulo $p - 1$, but got a value $e$ larger than $100$. [*] However, Evan noted that $e - \frac{1}{2}(p - 1) = 21$, and then realized the answer was $-2^{21} \pmod{p}$. [/list] What was the prime $p$?

Let $P(x)=x^{2000}-x^{1000}+1$. Do there exist distinct positive integers $a_1,\dots,a_{2001}$ such that $a_ia_j|P(a_i)P(a_j)$ for all $i\neq j$? [I]Proposed by A. Baranov[/i]

For any real $ x$, let $ \lfloor x\rfloor$ be the largest integer that is not more than $ x$. Given a sequence of positive integers $ a_1,a_2,a_3,\ldots$ such that $ a_1>1$ and \[ \left\lfloor\frac{a_1\plus{}1}{a_2}\right\rfloor\equal{}\left\lfloor\frac{a_2\plus{}1}{a_3}\right\rfloor\equal{}\left\lfloor\frac{a_3\plus{}1}{a_4}\right\rfloor\equal{}\cdots\] Prove that \[ \left\lfloor\frac{a_n\plus{}1}{a_{n\plus{}1}}\right\rfloor\leq1\] holds for every positive integer $ n$.

Let $M_n$ be the $n\times n$ matrix with entries as follows: for $1\leq i \leq n$, $m_{i,i}=10$; for $1\leq i \leq n-1, m_{i+1,i}=m_{i,i+1}=3$; all other entries in $M_n$ are zero. Let $D_n$ be the determinant of matrix $M_n$. Then $\displaystyle \sum_{n=1}^{\infty} \dfrac{1}{8D_n+1}$ can be represented as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. Note: The determinant of the $1\times 1$ matrix $[a]$ is $a$, and the determinant of the $2\times 2$ matrix $\left[ \begin{array}{cc} a & b \\ c & d \end{array} \right]=ad-bc$; for $n\geq 2$, the determinant of an $n\times n$ matrix with first row or first column $a_1\ a_2\ a_3 \dots\ a_n$ is equal to $a_1C_1 - a_2C_2 + a_3C_3 - \dots + (-1)^{n+1} a_nC_n$, where $C_i$ is the determinant of the $(n-1)\times (n-1)$ matrix found by eliminating the row and column containing $a_i$.

Let us call the number of factors in the prime decomposition of an integer $n > 1$ the complexity of $n$. For example, [i]complexity [/i] of numbers $4$ and $6$ is equal to $2$. Find all $n$ such that all integers between $n$ and $2n$ have complexity a) not greater than the complexity of $n$. b) less than the complexity of $n$. (Boris Frenkin)

Olya wrote fractions of the form $1 / n$ on cards, where $n$ is all possible divisors the numbers $6^{100}$ (including the unit and the number itself). These cards she laid out in some order. After that, she wrote down the number on the first card, then the sum of the numbers on the first and second cards, then the sum of the numbers on the first three cards, etc., finally, the sum of the numbers on all the cards. Every amount Olya recorded on the board in the form of irreducible fraction. What is the least different denominators could be on the numbers on the board?

Starting from the number $ 1$ we write down a sequence of numbers where the next number in the sequence is obtained from the previous one either by doubling it, or by rearranging its digits (not allowing the first digit of the rearranged number to be $0$). For instance we might begin: $$1, 2, 4, 8, 16, 61, 122, 212, 424,...$$ Is it possible to construct such a sequence that ends with the number $1,000,000,000$? Is it possible to construct one that ends with the number $9,876,543,210$?

Determine all even numbers $n$, $n \in \mathbb N$ such that \[{ \frac{1}{d_{1}}+\frac{1}{d_{2}}+ \cdots +\frac{1}{d_{k}}=\frac{1620}{1003}}, \] where $d_1, d_2, \ldots, d_k$ are all different divisors of $n$.

Prove that if the product of four consecutive natural numbers is added one unit, the result is a perfect square.

Juan writes the list of pairs $(n, 3^n)$, with $n=1, 2, 3,...$ on a chalkboard. As he writes the list, he underlines the pairs $(n, 3^n)$ when $n$ and $3^n$ have the same units digit. What is the $2013^{th}$ underlined pair?

Find all pairs $(m,n)$ of positive integers such that $m^2 + n^2 = 3(m + n)$.

Find all functions $f$ from positive integers to themselves such that: 1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$ 2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.

The positive integer $m$ and non-negative integers $x_0, x_1,..., x_{1001}$ satisfy the following equation: $$m^{x_0} =\sum_{i=1}^{1001}m^{x_i}.$$ How many possibilities are there for the value of $m$?

Denote $n$ as a natural number, and $m$ as the result of writing the digits of $n$ in reverse order. Determine, if they exist, the numbers of three digits which satisfy $2m + S = n$, $S$ being the sum of the digits of $n$.

[u]General Round[/u] [b]p1.[/b] Alice can bake a pie in $5$ minutes. Bob can bake a pie in $6$ minutes. Compute how many more pies Alice can bake than Bob in $60$ minutes. [b]p2.[/b] Ben likes long bike rides. On one ride, he goes biking for six hours. For the first hour, he bikes at a speed of $15$ miles per hour. For the next two hours, he bikes at a speed of $12$ miles per hour. He remembers biking $90$ miles over the six hours. Compute the average speed, in miles per hour, Ben biked during the last three hours of his trip. [b]p3.[/b] Compute the perimeter of a square with area $36$. [b]p4.[/b] Two ants are standing side-by-side. One ant, which is $4$ inches tall, casts a shadow that is $10$ inches long. The other ant is $6$ inches tall. Compute, in inches, the length of the shadow that the taller ant casts. [b]p5.[/b] Compute the number of distinct line segments that can be drawn inside a square such that the endpoints of the segment are on the square and the segment divides the square into two congruent triangles. [b]p6.[/b] Emily has a cylindrical water bottle that can hold $1000\pi$ cubic centimeters of water. Right now, the bottle is holding $100\pi$ cubic centimeters of water, and the height of the water is $1$ centimeter. Compute the radius of the water bottle. [b]p7.[/b] Given that $x$ and $y$ are nonnegative integers, compute the number of pairs $(x, y)$ such that $5x + y = 20$. [b]p8.[/b] A sequence an is recursively defined where $a_n = 3(a_{n-1}-1000)$ for $n > 0$. Compute the smallest integer $x$ such that when $a_0 = x$, $a_n > a_0$ for all $n > 0$. [b]p9.[/b] Compute the probability that two random integers, independently chosen and both taking on an integer value between $1$ and $10$ with equal probability, have a prime product. [b]p10.[/b] If $x$ and $y$ are nonnegative integers, both less than or equal to $2$, then we say that $(x, y)$ is a friendly point. Compute the number of unordered triples of friendly points that form triangles with positive area. [b]p11.[/b] Cindy is thinking of a number which is $4$ less than the square of a positive integer. The number has the property that it has two $2$-digit prime factors. What is the smallest possible value of Cindy's number? [b]p12.[/b] Winona can purchase a pencil and two pens for $250$ cents, or two pencils and three pens for $425$ cents. If the cost of a pencil and the cost of a pen does not change, compute the cost in cents of five pencils and six pens. [b]p13.[/b] Colin has an app on his phone that generates a random integer betwen $1$ and $10$. He generates $10$ random numbers and computes the sum. Compute the number of distinct possible sums Colin can end up with. [b]p14.[/b] A circle is inscribed in a unit square, and a diagonal of the square is drawn. Find the total length of the segments of the diagonal not contained within the circle. [b]p15.[/b] A class of six students has to split into two indistinguishable teams of three people. Compute the number of distinct team arrangements that can result. [b]p16.[/b] A unit square is subdivided into a grid composed of $9$ squares each with sidelength $\frac13$ . A circle is drawn through the centers of the $4$ squares in the outermost corners of the grid. Compute the area of this circle. [b]p17.[/b] There exists exactly one positive value of $k$ such that the line $y = kx$ intersects the parabola $y = x^2 + x + 4$ at exactly one point. Compute the intersection point. [b]p18.[/b] Given an integer $x$, let $f(x)$ be the sum of the digits of $x$. Compute the number of positive integers less than $1000$ where $f(x) = 2$. [b]p19.[/b] Let $ABCD$ be a convex quadrilateral with $BA = BC$ and $DA = DC$. Let $E$ and $F$ be the midpoints of $BC$ and $CD$ respectively, and let $BF$ and $DE$ intersect at $G$. If the area of $CEGF$ is $50$, what is the area of $ABGD$? [b]p20.[/b] Compute all real solutions to $16^x + 4^{x+1} - 96 = 0$. [b]p21.[/b] At an M&M factory, two types of M&Ms are produced, red and blue. The M&Ms are transported individually on a conveyor belt. Anna is watching the conveyor belt, and has determined that four out of every five red M&Ms are followed by a blue one, while one out of every six blue M&Ms is followed by a red one. What proportion of the M&Ms are red? [b]p22.[/b] $ABCDEFGH$ is an equiangular octagon with side lengths $2$, $4\sqrt2$, $1$, $3\sqrt2$, $2$, $3\sqrt2$, $3$, and $2\sqrt2$,in that order. Compute the area of the octagon. [b]p23.[/b] The cubic $f(x) = x^3 +bx^2 +cx+d$ satisfies $f(1) = 3$, $f(2) = 6$, and $f(4) = 12$. Compute $f(3)$. [b]p24.[/b] Given a unit square, two points are chosen uniformly at random within the square. Compute the probability that the line segment connecting those two points touches both diagonals of the square. [b]p25.[/b] Compute the remainder when: $$5\underbrace{666...6666}_{2016 \,\, sixes}5$$ is divided by $17$. [u]General Tiebreaker [/u] [b]Tie 1.[/b] Trapezoid $ABCD$ has $AB$ parallel to $CD$, with $\angle ADC = 90^o$. Given that $AD = 5$, $BC = 13$ and $DC = 18$, compute the area of the trapezoid. [b]Tie 2.[/b] The cubic $f(x) = x^3- 7x - 6$ has three distinct roots, $a$, $b$, and $c$. Compute $\frac{1}{a} + \frac{1}{b} + \frac{1}{c}$ . [b]Tie 3.[/b] Ben flips a fair coin repeatedly. Given that Ben's first coin flip is heads, compute the probability Ben flips two heads in a row before Ben flips two tails in a row. PS. You should use hide for answers.

Let $(a_n)$ be a sequence of integers, with $a_1 = 1$ and for evert integer $n \ge 1$, $a_{2n} = a_n + 1$ and $a_{2n+1} = 10a_n$. How many times $111$ appears on this sequence?

Find all terms of the arithmetic progression $-1, 18, 37, 56, ...$ whose only digit is $5$.

The board has a natural number greater than $1$. At each step, Igor writes the number $n +\frac{n}{p}$ instead of the number $n$ on the board , where $p$ is some prime divisor of $n$. Prove that if Igor continues to rewrite the number infinite times, then he will choose infinitely times the number $3$ as a prime divisor of $p$. [hide=original wording]На доске записано какое-то натуральное число, большее 1. На каждом шагу Игорь переписывает имеющееся на доске число n на число n +n/p, где p - это какой-нибудь простой делитель числа n. Доказать, что если Игорь будет продолжать переписывать число бесконечно долго, то он бесконечно много раз выберет в качестве простого делителя p число 3.[/hide]