We are given two two-digit numbers , $x$ and $y$. It is known that $x$ is twice as big as $y$. One of the digits of $y$ is the sum, while the other digit of $y$ is the difference, of the digits of $x$ . Find the values of $x$ and $y$, proving that there are no others.

Assume that a set $M$ of real numbers is the union of finitely many disjoint intervals with the total length greater than $1$. Prove that $M$ contains a pair of distinct numbers whose difference is an integer.

Prove that among any $100$ natural numbers there are two numbers whose difference is divisible by $99$.

Let $n$ be a positive integer. For each of the numbers $1, 2,.., n$ we compute the difference between the number of its odd positive divisors and its even positive divisors. Prove that the sum of these differences is at least $0$ and at most $n$.

Let $x_1,x_2,x_3,...,x_{102}$ be natural numbers such that $x_1<x_2<x_3<...<x_{102}<255$. Prove that among the numbers $d_1=x_2-x_1, d_2=x_3-x_2, ..., d_{101}=x_{102}-x_{101}$ there are at least $26$ equal.

What is the greatest number of integers that can be selected from a set of $2015$ consecutive numbers so that no sum of any two selected numbers is divisible by their difference?

Determine the locus of points, for each of which the difference between the squares of the distances to two given points is a constant value.

Let $k$ and $n$ be positive integers with $k < n$. Find the number of subsets of $\{1, 2, . . . , n\}$ such that the difference between the largest and smallest elements in the subset is $k$.

The numbers $1, 2, 3, ... , n$ are written on a blackboard (where $n \ge 3$). A move is to replace two numbers by their sum and non-negative difference. A series of moves makes all the numbers equal $k$. Find all possible $k$

(a) Prove that from $2007$ given positive integers, one of them can be chosen so the product of the remaining numbers is expressible in the form $a^2 - b^2$ for some positive integers $a$ and $b$. (2) (b) One of $2007$ given positive integers is $2006$. Prove that if there is a unique number among them such that the product of the remaining numbers is expressible in the form $a^2 - b^2$ for some positive integers $a$ and $b$, then this unique number is $2006$. (2)

Does there exist a number $N$ so that there are $N - 1$ infinite arithmetic progressions with differences $2 , 3 , 4 ,..., N$ , and every natural number belongs to at least one of these progressions?

Find all primes that can be written both as a sum and as a difference of two primes (note that $ 1$ is not a prime).

Suppose that there are $2001$ golf balls which are numbered from $1$ to $2001$ respectively, and some of these golf balls are placed inside a box. It is known that the difference between the two numbers of any two golf balls inside the box is neither $5$ nor $8$. How many such golf balls the box can contain at most? Justify your answer.

The difference between the product and the sum of two different integers is equal to the sum of their GCD (greatest common divisor) and LCM (least common multiple). Findall these pairs of numbers. Justify your answer.

Prove that among any $k + 1$ natural numbers there are two numbers whose difference is divisible by $k$.

Prove that each positive integer is equal to a difference of two positive integers with the same number of the prime divisors.

Two distinct positive integers are called [i]close [/i] if their greatest common divisor equals their difference. Show that for any $n$, there exists a set $S$ of $n$ elements such that any two elements of $S$ are close.

From the set of numbers $1 , 2, 3, . . . , 1985$ choose the largest subset such that the difference between any two numbers in the subset is not a prime number (the prime numbers are $2, 3 , 5 , 7,... , 1$ is not a prime number) .

Thomas and Nils are playing a game. They have a number of cards, numbered $1, 2, 3$, et cetera. At the start, all cards are lying face up on the table. They take alternate turns. The person whose turn it is, chooses a card that is still lying on the table and decides to either keep the card himself or to give it to the other player. When all cards are gone, each of them calculates the sum of the numbers on his own cards. If the difference between these two outcomes is divisible by $3$, then Thomas wins. If not, then Nils wins. (a) Suppose they are playing with $2018$ cards (numbered from $1$ to $2018$) and that Thomas starts. Prove that Nils can play in such a way that he will win the game with certainty. (b) Suppose they are playing with $2020 $cards (numbered from $1$ to $2020$) and that Nils starts. Which of the two players can play in such a way that he wins with certainty?

The positive differences $a_i-a_j$ of five different positive integers $a_1, a_2, a_3, a_4, a_5$ are all different (there are altogether $10$ such differences). Find the least possible value of the largest number among the $a_i$.

a) Show that the product of all differences of possible couples of six given positive integers is divisible by $960$ b) Show that the product of all differences of possible couples of six given positive integers is divisible by $34560$ PS. a) original from Albania b) modified by problem selecting committee

Numbers from $1$ to $1000$ are arranged around a circle. Prove that it is possible to form $500$ non-intersecting line segments, each joining two such numbers, and so that in each case the difference between the numbers at each end (in absolute value) is not greater than $749$. (AA Razborov, Moscow)

A $3\times 3$ table is filled with real numbers in such a way that each number in the table is equal to the absolute value of the difference of the sum of numbers in its row and the sum of numbers in its column. (a) Show that any number in this table can be expressed as a sum or a difference of some two numbers in the table. (b) Show that there is such a table not all of whose entries are $0$.

The digits of a $3$-digit number are interchanged so that none of the digits retain their original position. The difference of the two numbers is a $2$-digit number and is a perfect square. Find the difference.

For a finite set $A$ of integers, define $s(A)$ as the number of values obtained by adding any two elements of $A$, not necessarily different. Analogously, define $r (A)$ as the number of values obtained by subtracting any two elements of $A$, not necessarily different. For example, if $A = \{3,1,-1\}$ $\bullet$ The values obtained by adding any two elements of $A$ are $\{6,4,2,0,-2\}$ and so $s (A) = 5$. $\bullet$ The values obtained by subtracting any two elements of $A$ are $\{4,2,0,-2,-4\}$ and as $r (A) = 5$. Prove that for each positive integer $n$ there is a finite set $A$ of integers such that $r (A) \ge n s (A)$.