Show that in any set of three distinct integers there are two of them, say $a$ and $b$ such that the number $a^5b^3-a^3b^5$ is a multiple of $10$.

a) Given any positive integer $n$, show that there exist distint positive integers $x$ and $y$ such that $x + j$ divides $y + j$ for $j = 1 , 2, 3, \ldots, n$; b) If for some positive integers $x$ and $y$, $x+j$ divides $y+j$ for all positive integers $j$, prove that $x = y$.

Find the largest positive integer $N$ such that the equation $99x + 100y + 101z = N$ has an unique solution in the positive integers $x, y, z$. [i](7 points)[/i]

Prove that if $n$ is an odd natural number, then $1^n +2^n +\cdots +n^n$ is divisible by $n^2$.

Find the sum of all positive integers $x$ such that $$|x^2-x-6|$$ has exactly $4$ positive integer divisors. [i]Proposed by Evan Chang (squareman), USA[/i]

Bob has invented the Very Normal Coin (VNC). When the VNC is flipped, it shows heads $\textstyle\frac{1}{2}$ of the time and tails $\textstyle\frac{1}{2}$ of the time - unless it has yielded the same result five times in a row, in which case it is guaranteed to yield the opposite result. For example, if Bob flips five heads in a row, then the next flip is guaranteed to be tails. Bob flips the VNC an infinite number of times. On the $n$th flip, Bob bets $2^{-n}$ dollars that the VNC will show heads (so if the second flip shows heads, Bob wins $\$0.25$, and if the third flip shows tails, Bob loses $\$0.125$). Assume that dollars are infinitely divisible. Given that the first flip is heads, the expected number of dollars Bob is expected to win can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

For a point $P$ on the plane, denote by $\lVert P \rVert$ the distance to its nearest lattice point. Prove that there exists a real number $L > 0$ satisfying the following condition: For every $\ell > L$, there exists an equilateral triangle $ABC$ with side-length $\ell$ and $\lVert A \rVert, \lVert B \rVert, \lVert C \rVert < 10^{-2017}$.

Show that there is an infinite number of positive integers $t$ such that none of the equations $$ \begin{cases} x^2 + y^6 = t \\ x^2 + y^6 = t + 1 \\ x^2 - y^6 = t \\ x^2 - y^6 = t + 1 \end{cases}$$ has solutions $(x, y) \in Z \times Z$.

Let $P(x) = x^3 - px^2 + qx - r$ be a cubic polynomial with integer roots $a, b, c$. [b](a)[/b] Show that the greatest common divisor of $p, q, r$ is equal to $1$ if the greatest common divisor of $a, b, c$ is equal to $1$. [b](b)[/b] What are the roots of polynomial $Q(x) = x^3-98x^2+98sx-98t$ with $s, t$ positive integers.

Consider the finite sequence $\left\lfloor \frac{k^2}{1998} \right\rfloor$, for $k=1,2,\ldots, 1997$. How many distinct terms are there in this sequence? [i]Greece[/i]

Find all ordered triples of primes $(p, q, r)$ such that \[ p \mid q^r + 1, \quad q \mid r^p + 1, \quad r \mid p^q + 1. \] [i]Reid Barton[/i]

Once upon a time, three boys visited a library for the first time. The first decided to visit the library every second day. The second decided to visit the library every third day. The third decided to visit the library every fourth day. The librarian noticed, that the library doesn't work on Wednesdays. The boys decided to visit library on Thursdays, if they have to do it on Wednesdays, but to restart the day counting in these cases. They strictly obeyed these rules. Some Monday later I met them all in that library. What day of week was when they visited a library for the first time?

Two people take turns writing natural numbers from $1$ to $1000$. On the first move, the first player writes the number $1$ on the board. Then with your next move you can write either the number $2a$ or the number $a+1$ on the board if number $a$ is already written on the board. In this case, it is forbidden to write down numbers that are already written on the board. The one who writes out wins the number $1000$ on the board. Who wins if played correctly?

For any positive integer $n$, let $D_n$ denote the greatest common divisor of all numbers of the form $a^n + (a + 1)^n + (a + 2)^n$ where $a$ varies among all positive integers. (a) Prove that for each $n$, $D_n$ is of the form $3^k$ for some integer $k \ge 0$. (b) Prove that, for all $k\ge 0$, there exists an integer $n$ such that $D_n = 3^k$.

Let $d(k)$ denote the number of positive divisors of a positive integer $k$. Prove that there exist infinitely many positive integers $M$ that cannot be written as \[M=\left(\frac{2\sqrt{n}}{d(n)}\right)^2\] for any positive integer $n$.

Let $m$ and $n$ be relatively prime positive integers. Determine all possible values of \[\gcd(2^m - 2^n, 2^{m^2+mn+n^2}- 1).\]

Let $a$ and $ b$ be even numbers, such that $M = (a + b)^2-ab$ is a multiple of $5$. Consider the following statements: I) The unit digits of $a^3$ and $b^3$ are different. II) $M$ is divisible by $100$. Please indicate which of the above statements are true with certainty.

The sequence $a_{n,k} \ , k = 1, 2, 3,\ldots, 2^n \ , n = 0, 1, 2,\ldots,$ is defined by the following recurrence formula: \[a_1 = 2,\qquad a_{n,k} = 2a_{n-1,k}^3, \qquad , a_{n,k+2^{n-1}} =\frac 12 a_{n-1,k}^3\]\[\text{for} \quad k = 1, 2, 3,\ldots, 2^{n-1} \ , n = 0, 1, 2,\ldots\] Prove that the numbers $a_{n,k}$ are all different.

Let $\mathbb{N}$ be the set of positive integers. Let $n\in \mathbb{N}$ and let $d(n)$ be the number of divisors of $n$. Let $\varphi(n)$ be the Euler-totient function (the number of co-prime positive integers with $n$, smaller than $n$). Find all non-negative integers $c$ such that there exists $n\in\mathbb{N}$ such that \[ d(n) + \varphi(n) = n+c , \] and for such $c$ find all values of $n$ satisfying the above relationship.

Consider the following sequence: $a_1 = 1$, $a_2 = 2$, $a_3 = 3$, and \[a_{n+3} = \frac{a_{n+1}^2 + a_{n+2}^2 - 2}{a_n}\] for all integers $n \ge 1$. Prove that every term of the sequence is a positive integer.

The sequence $a_n$ for $n \in \mathbb{N}$ is defined as follows: \[ a_0 = 6, \quad a_1 = 7, \quad a_{n+2} = 3a_{n+1} - 2a_n \] Find all values of $n$ such that $n^2 = a_n$.

For any nonnegative integer $ n$, let $ f(n)$ be the greatest integer such that $ 2^{f(n)} | n \plus{} 1$. A pair $ (n, p)$ of nonnegative integers is called nice if $ 2^{f(n)} > p$. Find all triples $ (n, p, q)$ of nonnegative integers such that the pairs $ (n, p)$, $ (p, q)$ and $ (n \plus{} p \plus{} q, n)$ are all nice.

Prove or disprove: For any positive integer $k$ there exists an integer $n > 1$ such that the binomial coeffcient $\binom{n}{i}$ is divisible by $k$ for any $1 \leq i \leq n-1.$

Show that the equation $x^2 + y^2 + z^2 = ( x-y)(y-z)(z-x)$ has infintely many solutions in integers $x,y,z$.

Show that there is a positive number in the Fibonacci sequence which is divisible by $ 1000$.