The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]

[b]p1.[/b] Consider a parallelogram $ABCD$ with sides of length $a$ and $b$, where $a \ne b$. The four points of intersection of the bisectors of the interior angles of the parallelogram form a rectangle $EFGH$. A possible configuration is given below. Show that $$\frac{Area(ABCD)}{Area(EFGH)}=\frac{2ab}{(a - b)^2}$$ [img]https://cdn.artofproblemsolving.com/attachments/e/a/afaf345f2ef7c8ecf4388918756f0b56ff20ef.png[/img] [b]p2.[/b] A metal wire of length $4\ell$ inches (where $\ell$ is a positive integer) is used as edges to make a cardboard rectangular box with surface area $32$ square inches and volume $8$ cubic inches. Suppose that the whole wire is used. (i) Find the dimension of the box if $\ell= 9$, i.e., find the length, the width, and the height of the box without distinguishing the different orders of the numbers. Justify your answer. (ii) Show that it is impossible to construct such a box if $\ell = 10$. [b]p3.[/b] A Pythagorean n-tuple is an ordered collection of counting numbers $(x_1, x_2,..., x_{n-1}, x_n)$ satisfying the equation $$x^2_1+ x^2_2+ ...+ x^2_{n-1} = x^2_{n}.$$ For example, $(3, 4, 5)$ is an ordinary Pythagorean $3$-tuple (triple) and $(1, 2, 2, 3)$ is a Pythagorean $4$-tuple. (a) Given a Pythagorean triple $(a, b, c)$ show that the $4$-tuple $(a^2, ab, bc, c^2)$ is Pythagorean. (b) Extending part (a) or using any other method, come up with a procedure that generates Pythagorean $5$-tuples from Pythagorean $3$- and/or $4$-tuples. Few numerical examples will not suffice. You have to find a method that will generate infinitely many such $5$-tuples. (c) Find a procedure to generate Pythagorean $6$-tuples from Pythagorean $3$- and/or $4$- and/or $5$-tuples. Note. You can assume without proof that there are infinitely many Pythagorean triples. [b]p4.[/b] Consider the recursive sequence defined by $x_1 = a$, $x_2 = b$ and $$x_{n+2} =\frac{x_{n+1} + x_n - 1}{x_n - 1}, n \ge 1 .$$ We call the pair $(a, b)$ the seed for this sequence. If both $a$ and $b$ are integers, we will call it an integer seed. (a) Start with the integer seed $(2, 2019)$ and find $x_7$. (b) Show that there are infinitely many integer seeds for which $x_{2020} = 2020$. (c) Show that there are no integer seeds for which $x_{2019} = 2019$. [b]p5.[/b] Suppose there are eight people at a party. Each person has a certain amount of money. The eight people decide to play a game. Let $A_i$, for $i = 1$ to $8$, be the amount of money person $i$ has in his/her pocket at the beginning of the game. A computer picks a person at random. The chosen person is eliminated from the game and their money is put into a pot. Also magically the amount of money in the pockets of the remaining players goes up by the dollar amount in the chosen person's pocket. We continue this process and at the end of the seventh stage emerges a single person and a pot containing $M$ dollars. What is the expected value of $M$? The remaining player gets the pot and the money in his/her pocket. What is the expected value of what he/she takes home? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The integers $1, 2, 3,. . . , 2016$ are written in a board. You can choose any pair of numbers in the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After such replacements, the board will have only one number. (a) Prove that there is a sequence of substitutions that will make let the final number be $2$. (b) Prove that there is a sequence of substitutions that will make let the final number be $1000$.

Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that $$ (x+y)f(2yf(x)+f(y))=x^{3}f(yf(x)), \ \ \ \forall x,y\in \mathbb{R}^{+}.$$ (Albania)

For a positive integer $n$ we denote by $s(n)$ the sum of the digits of $n$. Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a polynomial, where $n \geqslant 2$ and $a_i$ is a positive integer for all $0 \leqslant i \leqslant n-1$. Could it be the case that, for all positive integers $k$, $s(k)$ and $s(P(k))$ have the same parity?

The trinomial $f(x)$ is such that $(f(x))^3-f(x)=0$ has three real roots. Find the y-coordinate of the vertex of $f(x)$.

For any positive integer $n$, let $f(n)$ denote the $n$- th positive nonsquare integer, i.e., $f(1) = 2, f(2) = 3, f(3) = 5, f(4) = 6$, etc. Prove that $f(n)=n +\{\sqrt{n}\}$ where $\{x\}$ denotes the integer closest to $x$. (For example, $\{\sqrt{1}\} = 1, \{\sqrt{2}\} = 1, \{\sqrt{3}\} = 2, \{\sqrt{4}\} = 2$.)

Determine if there exists a function f: $N^*\to N^*$ that satisfies that for all $n \in N^*$, $$10^{f (n)} <10n + 1 <10^{f (n) +1}.$$ Justify your answer. Note: $N^*$ denotes the set of positive integers.

Solve the equation $$ |\cos 3x - tgt| + |\cos 3x + tgt| = |tg^2t -3|.$$

Without using a calculator, prove that $$2^{1995} >5^{854},$$

Find all real numbers $a,b,c$ and $d$ such that: $a^2+b^2+c^2+d^2=a+b+c+d-ab=3.$

The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point \(A\). At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path \(AJABCHCHIJA\), which has \(10\) steps. Let \(n\) be the number of paths with \(15\) steps that begin and end at point \(A\). Find the remainder when \(n\) is divided by \(1000\). [asy] unitsize(32); draw(unitcircle); draw(scale(2) * unitcircle); for(int d = 90; d < 360 + 90; d += 72){ draw(2 * dir(d) -- dir(d)); } real s = 4; dot(1 * dir( 90), linewidth(s)); dot(1 * dir(162), linewidth(s)); dot(1 * dir(234), linewidth(s)); dot(1 * dir(306), linewidth(s)); dot(1 * dir(378), linewidth(s)); dot(2 * dir(378), linewidth(s)); dot(2 * dir(306), linewidth(s)); dot(2 * dir(234), linewidth(s)); dot(2 * dir(162), linewidth(s)); dot(2 * dir( 90), linewidth(s)); defaultpen(fontsize(10pt)); real r = 0.05; label("$A$", (1-r) * dir( 90), -dir( 90)); label("$B$", (1-r) * dir(162), -dir(162)); label("$C$", (1-r) * dir(234), -dir(234)); label("$D$", (1-r) * dir(306), -dir(306)); label("$E$", (1-r) * dir(378), -dir(378)); label("$F$", (2+r) * dir(378), dir(378)); label("$G$", (2+r) * dir(306), dir(306)); label("$H$", (2+r) * dir(234), dir(234)); label("$I$", (2+r) * dir(162), dir(162)); label("$J$", (2+r) * dir( 90), dir( 90)); [/asy]

Let $A$ be a set of positive integers satisfying the following : $a.)$ If $n \in A$ , then $n \le 2018$. $b.)$ If $S \subset A$ such that $|S|=3$, then there exists $m,n \in S$ such that $|n-m| \ge \sqrt{n}+\sqrt{m}$ What is the maximum cardinality of $A$ ?

The positive integers $ \alpha, \beta, \gamma$ are the roots of a polynomial $ f(x)$ with degree $ 4$ and the coefficient of the first term is $ 1$. If there exists an integer such that $ f(\minus{}1)\equal{}f^2(s)$. Prove that $ \alpha\beta$ is not a perfect square.

Let $n > 2$ be an integer and let $m = \sum k^3$, where the sum is taken over all integers $k$ with $1 \leq k < n$ that are relatively prime to $n$. Prove that $n$ divides $m$.

Let $x,y,z$ be positive real numbers with $x+y+z \ge 3$. Prove that $\frac{1}{x+y+z^2} + \frac{1}{y+z+x^2} + \frac{1}{z+x+y^2} \le 1$ When does equality hold? (Karl Czakler)

Find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for any two real numbers $x,y$ holds $$f(xf(y)+2y)=f(xy)+xf(y)+f(f(y)).$$ [i]Proposed by Patrik Bak, Slovakia[/i]

Find all functions $f:\mathbb{R}^{+}\rightarrow \mathbb{R}^{+}$ such that $x,y\in \mathbb{R}^{+},$ \[ f\left(\frac{y}{f(x+1)}\right)+f\left(\frac{x+1}{xf(y)}\right)=f(y) \]

Denote by $Q$ and $N^*$ the set of all rational and positive integer numbers, respectively. Suppose that $\frac{ax + b}{x} \in Q$ for every $x \in N^*$: Prove that there exist integers $A,B,C$ such that $\frac{ax + b}{x}= \frac{Ax + B}{Cx}$ for all $x \in N^* $

Let $n$ be an odd positive integer and let $x_1,x_2,...,x_n$ be n distinct real numbers that satisfy $|x_i -x_j| \le 1$ for $1 \le i < j \le n$. Prove that $$\sum_{i<j} |x_i -x_j| \le \left[\frac{n}{2} \right] \left(\left[\frac{n}{2} \right]-1 \right)$$

Let $S$ be a set of integers containing the numbers $0$ and $1996$. Suppose further that any integer root of any non-zero polynomial with coefficients in $S$ also belongs to $S$. Prove that $-2$ belongs to $S$.

Prove that for every positive integer $n$, there exists a polynomial with integer coefficients whose values at points $1,2,\dots,n$ are pairwise different powers of $2$.

Show that \[1 \leq \frac{(x+y)(x^3+y^3)}{(x^2+y^2)^2} \leq \frac98\] holds for all positive real numbers $x,y$.

Let $a, b, c$ be naturals. The equation $ax^2-bx + c = 0$ has two roots at $[0, 1]$. Prove that $a\ge 5$ and $b\ge 5$.

A sequence $(a_n)$ is defined as follows: $a_1 = p$ is a prime number with exactly $300$ nonzero digits, and for each $n \geq 1, a_{n+1}$ is the decimal period of $1/a_n$ multiplies by $2$. Determine $a_{2003}.$