Find all triples $(x,y,z)$ of positive rationals such that $x + y + z$, $\dfrac{1}{x} + \dfrac{1}{y} + \dfrac{1}{z}$ and $xyz$ are all integers.

[b](a)[/b] Prove that every positive integer $n$ can be written uniquely in the form \[n=\sum_{j=1}^{2k+1}(-1)^{j-1}2^{m_j},\] where $k\geq 0$ and $0\le m_1<m_2\cdots <m_{2k+1}$ are integers. This number $k$ is called [i]weight[/i] of $n$. [b](b)[/b] Find (in closed form) the difference between the number of positive integers at most $2^{2017}$ with even weight and the number of positive integers at most $2^{2017}$ with odd weight.

A [i]weak binary representation[/i] of a nonnegative integer $n$ is a representation $n=a_0+2\cdot a_1+2^2\cdot a_2+\dots$ such that $a_i\in\{0,1,2,3,4,5\}$. Determine the number of such representations for $513$.

Suppose $P$ is a quintic polynomial with real coefficients with $P(0)=2$ and $P(1)=3$ such that $|z|=1$ whenever $z$ is a complex number satisfying $P(z) = 0$. What is the smallest possible value of $P(2)$ over all such polynomials $P$?

Find all positive integers $k<202$ for which there exist a positive integers $n$ such that $$\bigg {\{}\frac{n}{202}\bigg {\}}+\bigg {\{}\frac{2n}{202}\bigg {\}}+\cdots +\bigg {\{}\frac{kn}{202}\bigg {\}}=\frac{k}{2}$$

Alice has $n > 1$ one variable quadratic polynomials written on paper she keeps secret from Bob. On each move, Bob announces a real number and Alice tells him the value of one of her polynomials at this number. Prove that there exists a constant $C > 0$ such that after $Cn^5$ questions, Bob can determine one of Alice’s polynomials. [i]Proposed by Rohan Goyal and Anant Mudgal[/i]

Two three-digit numbers are given. The hundreds digit of each of them is equal to the units digit of the other. Find these numbers if their difference is $297$ and the sum of digits of the smaller number is $23$.

Find $f(2)$ given that $f$ is a real-valued function that satisfies the equation $$4f(x)+\left(\frac23\right)(x^2+2)f\left(x-\frac2x\right)=x^3+1.$$

Solve the system of equations \[\begin{cases}x^5=y+y^5\\ y^5=z+z^5\\ z^5=t+t^5\\ t^5=x+x^5.\end{cases}\]

Determine all integers \( x \) for which the expression \( x^2 + 10x + 160 \) is a perfect square.

A sequence of integers $a_0,\ a_1,\dots a_n \dots $ is defined by the following rules: $a_0=0,\ a_1=1,\ a_{n+1} > a_n$ for each $n\in \mathbb{N}$, and $a_{n+1}$ is the minimum number such that no three numbers among $a_0,\ a_1,\dots a_{n+1}$ form an arithmetical progression. Prove that $a_{2^n}=3^n$ for each $n \in \mathbb{N}.$

Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$

Prove that for any positive reals $ a,b,c,d $ with $ a+b+c+d = 4 $, we have $$ \sum\limits_{cyc}{\frac{3a^3}{a^2+ab+b^2}}+\sum\limits_{cyc}{\frac{2ab}{a+b}} \ge 8 $$

Define $\displaystyle{f(x) = x + \sqrt{x + \sqrt{x + \sqrt{x + \sqrt{x + \ldots}}}}}$. Find the smallest integer $x$ such that $f(x)\ge50\sqrt{x}$. (Edit: The official question asked for the "smallest integer"; the intended question was the "smallest positive integer".)

Let $S(b)$ be the number of nonuples of positive integers $(a_1, a_2, \ldots , a_9)$ satisfying $3b-1=a_1+a_2+\ldots+a_9$ and $b^2+1=a_1^2+\ldots+a_9^2$. Prove that for all $\epsilon>0$, there exists $C_{\epsilon}>0$ such that $S(b)\leq C_{\epsilon}b^{3+\epsilon}$.

Show that in the plane there exists a convex polygon of 1992 sides satisfying the following conditions: [i](i)[/i] its side lengths are $ 1, 2, 3, \ldots, 1992$ in some order; [i](ii)[/i] the polygon is circumscribable about a circle. [i]Alternative formulation:[/i] Does there exist a 1992-gon with side lengths $ 1, 2, 3, \ldots, 1992$ circumscribed about a circle? Answer the same question for a 1990-gon.

(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a + b + c + d = 0$, \[ \max(a, b) + \max(a, c) + \max(a, d) + \max(b, c) + \max(b, d) + \max(c, d) \geqslant 0. \] (b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a + b + c + d = 0$.

Find all pairs of polynomials $p(x)$ and $q(x)$ with real coefficients for which \[p(x)q(x+1)-p(x+1)q(x)=1.\]

Let $f$ be a function that is defined for all positive integers and whose values are positive integers. For $f$ it also holds that $f (n + 1)> f (n)$ and $f (f (n)) = 3n$, for each positive integer $n$. Calculate $f (2019)$.

For given positive integers $n$ and $N$, let $P_n$ be the set of all polynomials $f(x)=a_0+a_1x+\cdots+a_nx^n$ with integer coefficients such that: [list] (a) $|a_j| \le N$ for $j = 0,1, \cdots ,n$; (b) The set $\{ j \mid a_j = N\}$ has at most two elements. [/list] Find the number of elements of the set $\{f(2N) \mid f(x) \in P_n\}$.

We say that a function $f: \mathbb{N}\rightarrow\mathbb{N}$ has the $(\mathcal{P})$ property if, for any $y\in\mathbb{N}$, the equation $f(x)=y$ has exactly 3 solutions. a) Prove that there exist an infinity of functions with the $(\mathcal{P})$ property ; b) Find all monotonously functions with the $(\mathcal{P})$ property ; c) Do there exist monotonously functions $f: \mathbb{Q}\rightarrow\mathbb{Q}$ satisfying the $(\mathcal{P})$ property ?

The sequence of real numbers $\{a_n\}$, $n \in \mathbb{N}$ satisfies the following condition: $a_{n+1}=a_n(a_n+2)$ for any $n \in \mathbb{N}$. Find all possible values for $a_{2004}$.

[u]Set 1[/u] [b]p1.[/b] Arnold is currently stationed at $(0, 0)$. He wants to buy some milk at $(3, 0)$, and also some cookies at $(0, 4)$, and then return back home at $(0, 0)$. If Arnold is very lazy and wants to minimize his walking, what is the length of the shortest path he can take? [b]p2.[/b] Dilhan selects $1$ shirt out of $3$ choices, $1$ pair of pants out of $4$ choices, and $2$ socks out of $6$ differently-colored socks. How many outfits can Dilhan select? All socks can be worn on both feet, and outfits where the only difference is that the left sock and right sock are switched are considered the same. [b]p3.[/b] What is the sum of the first $100$ odd positive integers? [b]p4.[/b] Find the sum of all the distinct prime factors of $1591$. [b]p5.[/b] Let set $S = \{1, 2, 3, 4, 5, 6\}$. From $S$, four numbers are selected, with replacement. These numbers are assembled to create a $4$-digit number. How many such $4$-digit numbers are multiples of $3$? [u]Set 2[/u] [b]p6.[/b] What is the area of a triangle with vertices at $(0, 0)$, $(7, 2)$, and $(4, 4)$? [b]p7.[/b] Call a number $n$ “warm” if $n - 1$, $n$, and $n + 1$ are all composite. Call a number $m$ “fuzzy” if $m$ may be expressed as the sum of $3$ consecutive positive integers. How many numbers less than or equal to $30$ are warm and fuzzy? [b]p8.[/b] Consider a square and hexagon of equal area. What is the square of the ratio of the side length of the hexagon to the side length of the square? [b]p9.[/b] If $x^2 + y^2 = 361$, $xy = -40$, and $x - y$ is positive, what is $x - y$? [b]p10.[/b] Each face of a cube is to be painted red, orange, yellow, green, blue, or violet, and each color must be used exactly once. Assuming rotations are indistinguishable, how many ways are there to paint the cube? [u]Set 3[/u] [b]p11.[/b] Let $D$ be the midpoint of side $BC$ of triangle $ABC$. Let $P$ be any point on segment $AD$. If $M$ is the maximum possible value of $\frac{[PAB]}{[PAC]}$ and $m$ is the minimum possible value, what is $M - m$? Note: $[PQR]$ denotes the area of triangle $PQR$. [b]p12.[/b] If the product of the positive divisors of the positive integer $n$ is $n^6$, find the sum of the $3$ smallest possible values of $n$. [b]p13.[/b] Find the product of the magnitudes of the complex roots of the equation $(x - 4)^4 +(x - 2)^4 + 14 = 0$. [b]p14.[/b] If $xy - 20x - 16y = 2016$ and $x$ and $y$ are both positive integers, what is the least possible value of $\max (x, y)$? [b]p15.[/b] A peasant is trying to escape from Chyornarus, ruled by the Tsar and his mystical faith healer. The peasant starts at $(0, 0)$ on a $6 \times 6$ unit grid, the Tsar’s palace is at $(3, 3)$, the healer is at $(2, 1)$, and the escape is at $(6, 6)$. If the peasant crosses the Tsar’s palace or the mystical faith healer, he is executed and fails to escape. The peasant’s path can only consist of moves upward and rightward along the gridlines. How many valid paths allow the peasant to escape? PS. You should use hide for answers. Rest sets have been posted [url=https://artofproblemsolving.com/community/c3h2784259p24464954]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose a function $f : \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ satisfies $f(f(n)) + f(n+1) = n+2$ for all positive integer $n$. Prove that $f(f(n)+n) = n+1$ for all positive integer $n$.

A positive rational number $x$ is called [i]banzai [/i] if the following conditions are met: $\bullet$ $x=\frac{p}{q}&gt;1$ where $p,q$ are comprime natural numbers $\bullet$ exist constants $\alpha,N$ such that for all integers $n\geq N$,$$\mid \left\{\,x^n\right\} -\alpha\mid \leq \dfrac{1}{2(p+q)}.$$ Find the total number of banzai numbers. Note:$\left\{\,x\right\}$ means fractional part of $x$ [i](tatari/nightmare)[/i]