Let $x$ and $y$ be two rational numbers such that $$x^5 + y^5 = 2x^2y^2.$$ Prove that $\sqrt{1-xy}$ is also a rational number.

Given that $n$ is a natural number such that the leftmost digits in the decimal representations of $2^n$ and $3^n$ are the same, find all possible values of the leftmost digit.

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).

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$) over the integers for every $i$.

[b]p1.[/b] The oil pipeline passes by three villages $A$, $B$, $C$. In the first village, $30\%$ of the initial amount of oil is drained, in the second - $40\%$ of the amount that will reach village $B$, and in the third - $50\%$ of the amount that will reach village $C$ What percentage of the initial amount of oil reaches the end of the pipeline? [b]p2.[/b] There are several ordinary irreducible fractions (not necessarily proper) with natural numerators and denominators (and the denominators are greater than $1$). The product of all fractions is equal to $10$. All numerators and denominators are increased by $1$. Can the product of the resulting fractions be greater than $10$? [b]p3.[/b] The garland consists of $10$ light bulbs connected in series. Exactly one of the light bulbs has burned out, but it is not known which one. There is a suitable light bulb available to replace a burnt out one. To unscrew a light bulb, you need $10$ seconds, to screw it in - also $10$ seconds (the time for other actions can be neglected). Is it possible to be guaranteed to find a burnt out light bulb: a) in $10$ minutes, b) in $5$ minutes? [b]p4.[/b] When fast and slow athletes run across the stadium in one direction, the fast one overtakes the slow one every $15$ minutes, and when they run towards each other, they meet once every $5$ minutes. How many times is the speed of a fast runner greater than the speed of a slow runner? [b]p5.[/b] Petya was $35$ minutes late for school. Then he decided to run to the kiosk for ice cream. But when he returned, the second lesson had already begun. He immediately ran for ice cream a second time and was gone for the same amount of time. When he returned, it turned out that he was late again, and he had to wait $50$ minutes before the start of the fourth lesson. How long does it take to run from school to the ice cream stand and back if each lesson, including recess after it, lasts $55$ minutes? [b]p6.[/b] In a convex heptagon, draw as many diagonals as possible so that no three of them are sides of the same triangle, the vertices of which are at the vertices of the original heptagon. [b]p7.[/b] In the writing of the antipodes, numbers are also written with the digits $0, ..., 9$, but each of the numbers has different meanings for them and for us. It turned out that the equalities are also true for the antipodes $5 * 8 + 7 + 1 = 48$ $2 * 2 * 6 = 24$ $5* 6 = 30$ a) How will the equality $2^3 = ...$ in the writing of the antipodes be continued? b) What does the number 9 mean among the Antipodes? Clarifications: a) It asks to convert $2^3$ in antipodes language, and write with what number it is equal and find a valid equality in both numerical systems. b) What does the digit $9$ mean among the antipodes, i.e. with which digit is it equal in our number system? [b]p8.[/b] They wrote the numbers $1, 2, 3, 4, ..., 1996, 1997$ in a row. Which digits were used more when writing these numbers - ones or twos? How long? [b]p9.[/b] On the number axis there lives a grasshopper who can jump $1$ and $4$ to the right and left. Can he get from point $1$ to point $2$ of the numerical axis $in 1996$ jumps if he must not get to points with coordinates divisible by $ 4$ (points $0$, $\pm 4$, $\pm 8$, etc.)? [b]p10.[/b] Is there a convex quadrilateral that can be cut along a straight line into two parts of the same size and shape, but neither the diagonal nor the straight line passing through the midpoints of opposite sides divides it into two equal parts? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Show that the equation $x^3 + 2y^2 + 4z = n$ has an integral solution $(x, y, z)$ for all integers $n.$

Let S be the set of positive integers $n$ for which $\frac{3}{n}$ cannot be written as the sum of two rational numbers of the form $\frac{1}{k}$, where $k$ is a positive integer. Prove that $S$ cannot be written as the union of finitely many arithmetic progressions.

Find the largest integer $ n$ satisfying the following conditions: (i) $ n^2$ can be expressed as the difference of two consecutive cubes; (ii) $ 2n\plus{}79$ is a perfect square.

The infinite integer plane $Z\times Z = Z^2$ consists of all number pairs $(x, y)$, where $x$ and $y$ are integers. Let $a$ and $b$ be non-negative integers. We call any move from a point $(x, y)$ to any of the points $(x\pm a, y \pm b)$ or $(x \pm b, y \pm a) $ a $(a, b)$-knight move. Determine all numbers $a$ and $b$, for which it is possible to reach all points of the integer plane from an arbitrary starting point using only $(a, b)$-knight moves.

Find all $n\in \mathbb Z^+$, so that \[ z_n = \underbrace{ 101\dots101}_{2n+1 \text{ digits} } \] is prime.

Call a positive integer, $n$, [i]ready [/i] if all positive integer divisors of $n$ have a ones digit of either $1$ or $3$. Let S be the sum of all positive integer divisors of $32!$ that are ready. Compute the remainder when S is divided by $131$.

$F_n$ is the Fibonacci sequence $F_0 = F_1 = 1$, $F_{n+2} = F_{n+1} + F_n$. Find all pairs $m > k \geq 0$ such that the sequence $x_0, x_1, x_2, ...$ defined by $x_0 = \frac{F_k}{F_m}$ and $x_{n+1} = \frac{2x_n - 1}{1 - x_n}$ for $x_n \not = 1$, or $1$ if $x_n = 1$, contains the number $1$

List the numbers$\sqrt{2}; \sqrt[3]{3}; \sqrt[4]{4}; \sqrt[5]{5}; \sqrt[6]{6}.$ in order from greatest to least.

It is given that for some $n \in \mathbb{N}$ there exists a natural number $a$, such that $a^{n-1} \equiv 1 \pmod{n}$ and that for any prime divisor $p$ of $n-1$ we have $a^{\frac{n-1}{p}} \not \equiv 1 \pmod{n}$. Prove that $n$ is a prime.

Let's call the "Soros product" of two different numbers, $a$ and $b$, the number $a + b + ab$. Is it possible, based on numbers $1$ and $4$, after repeated application of this operation to the already obtained products, to obtain: a) the number $1999$? b) the number $2000$?

By $rad(x)$ we denote the product of all distinct prime factors of a positive integer $n$. Given $a \in N$, a sequence $(a_n)$ is defined by $a_0 = a$ and $a_{n+1} = a_n+rad(a_n)$ for all $n \ge 0$. Prove that there exists an index $n$ for which $\frac{a_n}{rad(a_n)} = 2022$

What is the maximum value of $n$ for which there is a set of distinct positive integers $k_1,k_2,\ldots,k_n$ for which \[k_1^2+k_2^2+\ldots+k_n^2=2002?\] $\textbf{(A) }14\qquad\textbf{(B) }15\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

Find the least integer $n > 60$ so that when $3n$ is divided by $4$, the remainder is $2$ and when $4n$ is divided by $5$, the remainder is $1$.

Find the least number which is divisible by 2009 and its sum of digits is 2009.

If $p$ and $p^2+2$ are prime numbers, at most how many prime divisors can $p^3+3$ have? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Consider a nonconstant arithmetic progression $a_1, a_2,\cdots, a_n,\cdots$. Suppose there exist relatively prime positive integers $p>1$ and $q>1$ such that $a_1^2, a_{p+1}^2$ and $a_{q+1}^2$ are also the terms of the same arithmetic progression. Prove that the terms of the arithmetic progression are all integers.

A sequence $a_1,a_2,\ldots ,a_n,\ldots$ of natural numbers is defined by the rule \[a_{n+1}=a_n+b_n\ (n=1,2,\ldots)\] where $b_n$ is the last digit of $a_n$. Prove that such a sequence contains infinitely many powers of $2$ if and only if $a_1$ is not divisible by $5$.

Prove that there doesn’t exist any prime $p$ such that every power of $p$ is a palindrome (a palindrome is a number that is read the same from the left as it is from the right; in particular, a number that ends in one or more zeros cannot be a palindrome).

Let $x, y$ be positive integers such that $\frac{x^2}{y}+\frac{y^2}{x}$ is an integer. Prove that $y|x^2$.

[b]6.[/b] For a prime factorisation of a positive integer $N$ let us call the exponent of a prime $p$ the integer $k$ for which $p^{k} \mid N$ but $p^{k+1} \nmid N$; let, further, the power $p^{k}$ be called the "contribution" of $p$ to $N$. Show that for any positive integer $n$ and for any primes $p$ and $q$ the contibution of $p$ to $n!$ is greater than the contribution of $q$ if and only if the exponent of $p$ is greater than that of $q$.