[u]Round 5[/u] [b]p13.[/b] Two closed disks of radius $\sqrt2$ are drawn centered at the points $(1,0)$ and $(-1, 0)$. Let P be the region belonging to both disks. Two congruent non-intersecting open disks of radius $r$ have all of their points in $P$ . Find the maximum possible value of $r$ . [b]p14.[/b] A rectangle has positive integer side lengths. The sum of the numerical values of its perimeter and area is $2017$. Find the perimeter of the rectangle. [b]p15.[/b] Find all ordered triples of real numbers $(a,b,c)$ which satisfy $$a +b +c = 6$$ $$a \cdot (b +c) = 6$$ $$(a +b) \cdot c = 6$$ [u]Round 6[/u] [b]p16.[/b] A four digit positive integer is called confused if it is written using the digits $2$, $0$, $1$, and $7$ in some order, each exactly one. For example, the numbers $7210$ and $2017$ are confused. Find the sum of all confused numbers. [b]p17.[/b] Suppose $\vartriangle ABC$ is a right triangle with a right angle at $A$. Let $D$ be a point on segment $BC$ such that $\angle BAD = \angle CAD$. Suppose that $AB = 20$ and $AC = 17$. Compute $AD$. [b]p18.[/b] Let $x$ be a real number. Find the minimum possible positive value of $\frac{|x -20|+|x -17|}{x}$. [u]Round 7[/u] [b]p19.[/b] Find the sum of all real numbers $0 < x < 1$ that satisfy $\{2017x\} = \{x\}$. [b]p20.[/b] Let $a_1,a_2, ,,, ,a_{10}$ be real numbers which sum to $20$ and satisfy $\{a_i\} <0.5$ for $1 \le i\le 10$. Find the sum of all possible values of $\sum_{ 1 \le i <j\le 10} \lfloor a_i +a_j \rfloor .$ Here, $\lfloor x \rfloor$ denotes the greatest integer $x_0$ such that $x_0 \le x$ and $\{x\} =x -\lfloor x \rfloor$. [b]p21.[/b] Compute the remainder when $20^{2017}$ is divided by $17$. [u]Round 8[/u] [b]p22.[/b] Let $\vartriangle ABC$ be a triangle with a right angle at $B$. Additionally, letM be the midpoint of $AC$. Suppose the circumcircle of $\vartriangle BCM$ intersects segment $AB$ at a point $P \ne B$. If $CP = 20$ and $BP = 17$, compute $AC$. [b]p23.[/b] Two vertices on a cube are called neighbors if they are distinct endpoints of the same edge. On a cube, how many ways can a nonempty subset $S$ of the vertices be chosen such that for any vertex $v \in S$, at least two of the three neighbors of $v$ are also in $S$? Reflections and rotations are considered distinct. [b]p24.[/b] Let $x$ be a real number such that $x +\sqrt[4]{5-x^4}=2$. Find all possible values of $x\sqrt[4]{5-x^4}$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3158491p28715220]here[/url].and 9-12 [url=https://artofproblemsolving.com/community/c3h3162362p28764144]here[/url] Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$(HUN 1)$ Let $a$ and $b$ be arbitrary integers. Prove that if $k$ is an integer not divisible by $3$, then $(a + b)^{2k}+ a^{2k} +b^{2k}$ is divisible by $a^2 +ab+ b^2$

We will call the ordered pair $(a,b)$ “parallel”, where $a,b\in \mathbb{N}$, if $\sqrt{ab}\in \mathbb{N}$. Prove that the number of “parallel” pairs $(a,b)$, for which $1\leq a,b\leq 10^6$ is at least $3.10^6(ln\, 10-1)$.

Find the number of nonnegative integers $k$, $0 \leq k \leq 2188$, and such that $\binom{2188}{k}$ is divisible by 2188.

Find the largest number $n$ that for which there exists $n$ positive integers such that non of them divides another one, but between every three of them, one divides the sum of the other two. [i]Proposed by Morteza Saghafian[/i]

Suppose $ABC$ is a triangle inscribed in circle $\omega$ . Let $A'$ be the point on $\omega$ so that $AA'$ is a diameter, and let $G$ be the centroid of $ABC$. Given that $AB = 13$, $BC = 14$, and $CA = 15$, let $x$ be the area of triangle $AGA'$ . If $x$ can be expressed in the form $m/n$ , where m and n are relatively prime positive integers, compute $100n + m$.

Let $p$ of prime of the form $3k+2$ such that $a^2+ab+b^2$ is divisible by $p$ for some integers $a$ and $b$. Prove that both of $a$ and $b$ are divisible by $p$.

Let $n \ge 3$ be a fixed integer. The numbers $1,2,3, \cdots , n$ are written on a board. In every move one chooses two numbers and replaces them by their arithmetic mean. This is done until only a single number remains on the board. Determine the least integer that can be reached at the end by an appropriate sequence of moves. (Theresia Eisenkölbl)

Find all pairs of positive integers $m$ and $n$ such that $$m! + n! = m^n.$$ .

Find all pairs of integers $(m,n)$ such that $m^3-n^3=2mn +8$

Prove that the number $\binom np-\left\lfloor\frac np\right\rfloor$ is divisible by $p$ for every prime number and integer $n\ge p$.

Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.

Given two positive integers $a \ne b$, let $f(a, b)$ be the smallest integer that divides exactly one of $a, b$, but not both. Determine the number of pairs of positive integers $(x, y)$, where $x \ne y$, $1\le x, y, \le 100$ and $\gcd(f(x, y), \gcd(x, y)) = 2$.

Solve in prime numbers the equation $x^y - y^x = xy^2 - 19$.

Find all positive integers $n$ so that both $n$ and $n + 100$ have odd numbers of divisors.

Let $ A$ be a unitary finite ring with $ n$ elements, such that the equation $ x^n\equal{}1$ has a unique solution in $ A$, $ x\equal{}1$. Prove that a) $ 0$ is the only nilpotent element of $ A$; b) there exists an integer $ k\geq 2$, such that the equation $ x^k\equal{}x$ has $ n$ solutions in $ A$.

Find all couples of non-zero integers $(x,y)$ such that, $x^2+y^2$ is a common divisor of $x^5+y$ and $y^5+x$.

On the computer screen there are initially two $1$'s written. The [i] insert [/i] program causes the sum of those numbers to be inserted between each pair of numbers by pressing the $Enter$ key. In the first step a number is inserted and we obtain $1-2-1$; In the second step two numbers are inserted and we have $1-3-2-3-1$; In the third, four numbers are inserted and you have $1-4-3-5-2-5-3-4-1$; etc Find the sum of all the numbers that appear on the screen at the end of step number $25$.

Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime? $\textbf{(A) } \dfrac{8}{99} \qquad\textbf{(B) } \dfrac{2}{5} \qquad\textbf{(C) } \dfrac{9}{20} \qquad\textbf{(D) } \dfrac{1}{2} \qquad\textbf{(E) } \dfrac{9}{16} $

Find all triples $(a, b,c) $ of positive integers, such that: \[ a! + b! = c!! \] where $(2k)!! = 2 \cdot 4 \cdot \ldots \cdot (2k)$ and $ (2k + 1)!! = 1 \cdot 3 \cdot \ldots \cdot (2k+1).$ [i]Proposed by Stijn Cambie, Belgium [/i]

On the board are written $2 , 3 , 5 ,... , 2003$ , that is, all the prime numbers of the interval $[2,2007]$ . The operation of [i]simplification [/i] is the replacement of two numbers $a , b$ by a maximal prime number not exceeding $\sqrt{a^2-a b+b^2}$ . First, the student erases the number $q, 2<q<2003$, then applies the [i]simplification [/i] operation to the remaining numbers until one number remains. Find the maximum possible and minimum possible values of the number obtained in the end. How do these values depend on the number $q$?

Prove that the remainder of dividing the sum of two squares of integers by $4$ is different from $3$.

$a)$ Prove that for all positive integers $n$ exists a set $M_n$ of positive integers with exactly $n$ elements and: $i)$ Arithmetic mean of arbitrary non-empty subset of $M_n$ is integer $ii)$ Geometric mean of arbitrary non-empty subset of $M_n$ is integer $iii)$ Both arithmetic mean and geometry mean of arbitrary non-empty subset of $M_n$ is integer $b)$ Does there exist infinite set $M$ of positive integers such that arithmetic mean of arbitrary non-empty subset of $M$ is integer

Compute the number of ordered pairs $(a, b)$ of positive integers such that $a$ and $b$ divide $5040$ but share no common factors greater than $1$.

For each positive integer $n$, let $s(n)$ be the sum of the digits of $n$. Find the smallest positive integer $k$ such that \[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k).\]