Call a number $n$ [i]good[/i] if it can be expressed as $2^x+y^2$ for where $x$ and $y$ are nonnegative integers. (a) Prove that there exist infinitely many sets of $4$ consecutive good numbers. (b) Find all sets of $5$ consecutive good numbers. [i]Proposed by Michael Ma[/i]

Find all integers $x,y$ satisfy the $x^3 + y^3 = 3xy$.

Let $a$ and $b$ be two non-zero rational numbers such that the equation $ax^2+by^2=0$ has a non-zero solution in rational numbers . Prove that for any rational number $t$ , there is a solution of the equation $ax^2+by^2=t$.

2. Positive integer will be called white, if it is equal to $1$ or is a product of even number of primes (not necessarily distinct). Rest of the positive integers will be called black. Determine whether there exists a positive integer which sum of white divisors is equal to sum of black divisors

Two players $A$ and $B$ play the following game. Before the game starts, $A$ chooses 1000 not necessarily different odd primes, and then $B$ chooses half of them and writes them on a blackboard. In each turn a player chooses a positive integer $n$, erases some primes $p_1$, $p_2$, $\dots$, $p_n$ from the blackboard and writes all the prime factors of $p_1 p_2 \dotsm p_n - 2$ instead (if a prime occurs several times in the prime factorization of $p_1 p_2 \dotsm p_n - 2$, it is written as many times as it occurs). Player $A$ starts, and the player whose move leaves the blackboard empty loses the game. Prove that one of the two players has a winning strategy and determine who. Remark: Since 1 has no prime factors, erasing a single 3 is a legal move.

Alexander and Louise are a pair of burglars. Every morning, Louise steals one third of Alexander's money, but feels remorse later in the afternoon and gives him half of all the money she has. If Louise has no money at the beginning and starts stealing on the first day, what is the least positive integer amount of money Alexander must have so that at the end of the 2012th day they both have an integer amount of money?

For positive integers $n$, let $\tau (n)$ denote the number of positive integer divisors of $n$, including $1$ and $n$. For example, $\tau (1)=1$ and $\tau(6) =4$. Define $S(n)$ by \[S(n)=\tau(1)+ \tau(2) + ... + \tau(n).\] Let $a$ denote the number of positive integers $n \leq 2005$ with $S(n)$ odd, and let $b$ denote the number of positive integers $n \leq 2005$ with $S(n)$ even. Find $|a-b|$.

At one moment, a kid noticed that the end of the hour hand, the end of the minute hand and one of the twelve numbers (regarded as a point) of his watch formed an equilateral triangle. He also calculated that $t$ hours would elapse for the next similar case. Suppose that the ratio of the lengths of the minute hand (whose length is equal to the distance from the center of the watch plate to any of the twelve numbers) and the hour hand is $k>1$. Find the maximal value of $t$.

A serie of positive integers $a_{1}$,$a_{2}$,. . . ,$a_{n}$ is $auto-delimited$ if for every index $i$ that holds $1\leq i\leq n$, there exist at least $a_{i}$ terms of the serie such that they are all less or equal to $i$. Find the maximum value of the sum $a_{1}+a_{2}+\cdot \cdot \cdot+a_{n}$, where $a_{1}$,$a_{2}$,. . . ,$a_{n}$ is an $auto-delimited$ serie.

Call a rational number $r$ [i]powerful[/i] if $r$ can be expressed in the form $\dfrac{p^k}{q}$ for some relatively prime positive integers $p, q$ and some integer $k >1$. Let $a, b, c$ be positive rational numbers such that $abc = 1$. Suppose there exist positive integers $x, y, z$ such that $a^x + b^y + c^z$ is an integer. Prove that $a, b, c$ are all [i]powerful[/i]. [i]Jeck Lim, Singapore[/i]

Find the smallest positive integer $k$ which is representable in the form $k=19^n-5^m$ for some positive integers $m$ and $n$.

To each positive integer $ n$ it is assigned a non-negative integer $f(n)$ such that the following conditions are satisfied: (1) $ f(rs) \equal{} f(r)\plus{}f(s)$ (2) $ f(n) \equal{} 0$, if the first digit (from right to left) of $ n$ is 3. (3) $ f(10) \equal{} 0$. Find $f(1985)$. Justify your answer.

a) If $K$ is a finite extension of the field $F$ and $K=F(\alpha,\beta)$ show that $[K: F]\leq [F(\alpha): F][F(\beta): F]$ b) If $gcd([F(\alpha): F],[F(\beta): F])=1$ then does the above inequality always become equality? c) By giving an example show that if $gcd([F(\alpha): F],[F(\beta): F])\neq 1$ then equality might happen.

Prove that for every natural number $k$ there exists an infinite set of such natural numbers $t$, that the decimal notation of $t$ does not contain zeroes and the sums of the digits of the numbers $t$ and $kt$ are equal.

Show that the set of positive integers that cannot be represented as a sum of distinct perfect squares is finite.

The numbers $1, 2, ..., 2020$ and $2021$ are written on a blackboard. The following operation is executed: Two numbers are chosen, both are erased and replaced by the absolute value of their difference. This operation is repeated until there is only one number left on the blackboard. (a) Show that $2021$ can be the final number on the blackboard. (b) Show that $2020$ cannot be the final number on the blackboard. (Karl Czakler)

Find the last eight digits of the binary development of $27^{1986}.$

For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.

Let \( 133\ldots 33 \) be a number with \( k \geq 2 \) digits, which we assume is prime. Prove that \( k(k + 2) \) is a multiple of 24. (For example, 133...33 is a prime number when \( k = 16\)

Let $m,n\ge 2$ be given integers. Prove that there exist positive integers $a_1<a_2<\ldots<a_m$ so that for any $1\le i<j\le m$ the number $\frac{a_j}{a_j-a_i}$ is an integer divisible by $n$.

If a is a natural number, show that the number of positive integral solutions of the indeterminate equation $$x_1 + 2x_2 + 3x_3 + ... + nx_n = a \ \ (1) $$ is equal to the number of non-negative integral solutions of $$y_1 + 2y_2 + 3y_3 + ... + ny_n = a - \frac{n(n + 1)}{2} \ \ (2)$$ [By a solution of equation (1), we mean a set of numbers $\{x_1, x_2,..., x_n\}$ which satisfies equation (1)].

Determine all pairs $(x,y)$ of positive integers such that $x^{2}y+x+y$ is divisible by $xy^{2}+y+7$.

Prove that the sum of the squares of $1984$ consecutive positive integers cannot be the square of an integer.

The first of an infinite triangular spreadsheet the line contains one number, the second line contains two numbers, the third line contains three numbers, and so on. In doing so is in any $k$-th row ($k = 1, 2, 3,...$) in the first and last place the number $k$, each other the number in the table is found, however, than in the previous row the least common of the two numbers above it multiple (the adjacent figure shows the first five rows of this table). We choose any two numbers from the table that are not in their row in the first or last place. Prove that one of the selected numbers is divisible by another. [img]https://cdn.artofproblemsolving.com/attachments/3/7/107d8999d9f04777719a0f1b1df418dbe00023.png[/img]

Today is $26$ May $2021$. This date is traditionally in the form ($DD.MM.YYYY$), using $8$ digits, namely $26.05.2021$. Find the nearest day in the future when the traditional date writing will contain $8$ distinct digits.