Let $a_k$ be the number of nonnegative integers $ n $ with the properties: a) $n\in[0, 10^k)$ has exactly $ k $ digits, such that he zeroes on the first positions of $ n $ are included in the decimal writting. b) the digits of $ n $ can be permutated such that the new number is divisible by $11.$ Show that $a_{2m}=10a_{2m-1}$ for every $m\in\mathbb{N}.$

Let $n$ be a positive integer greater than $1$, and let $p$ be a prime such that $n$ divides $p-1$ and $p$ divides $n^3-1$. Prove that $4p-3$ is a square.

Prove there do exist infinitely many positive integers $n$ such that if a prime $p$ divides $n(n+1)$ then $p^2$ also divides it (all primes dividing $n(n+1)$ bear exponent at least two). Exhibit (at least) two values, one even and one odd, for such numbers $n>8$. (Pál Erdös & Kurt Mahler)

Let $n$ be a positive integer less than $1000$. The remainders obtained when dividing $n$ by $2, 2^2, 2^3, ... , 2^8$, and $2^9$ , are calculated. If the sum of all these remainders is $137$, what are all the possible values ​​of $n$?

Let $P(x)$ be a polynomial in one variable with integer coefficients. Prove that the number of pairs $(m,n)$ of positive integers such that $2^n + P(n) = m!$, is finite.

The number $\overline{13\ldots 3}$, with $k>1$ digits $3$, is a prime. Prove that $6\mid k^{2}-2k+3$.

Positive integer $n$ is not larger than $2000$, and $n$ is equal to the sum of no less than sixty adjacent positive integers. Then number of such numbers is________.

The positive divisors of a positive integer $n$ are written in increasing order starting with 1. \[1=d_1<d_2<d_3<\cdots<n\] Find $n$ if it is known that: [b]i[/b]. $\, n=d_{13}+d_{14}+d_{15}$ [b]ii[/b]. $\,(d_5+1)^3=d_{15}+1$

Find all triples $(p,m,n)$ satisfying the equation $p^m-n^3=8$ where $p$ is a prime number and $m,n$ are nonnegative integers.

Prove that number $1$ has infinitely many representations of the form $$1 =\frac{1}{5}+\frac{1}{a_1}+\frac{1}{a_2}+ ...+\frac{1}{a_n}$$ , where$ n$ and $a_i $ are positive integers with $5 < a_1 < a_2 < ... < a_n$.

Find all pairs of integers $(m, n)$ such that \[ \left| (m^2 + 2000m+ 999999)- (3n^3 + 9n^2 + 27n) \right|= 1.\]

Let $n \ge 2$ be a natural number. For an $n$-element subset $F$ of $\{1, . . . , 2n\}$ we define $m(F)$ as the minimum of all $lcm \,\, (x, y)$ , where $x$ and $y$ are two distinct elements of $F$. Find the maximum value of $m(F)$.

Let $n$ be a positive integer. Let $f(n)$ be the probability that, if divisors $a, b, c$ of $n$ are selected uniformly at random with replacement, then $\gcd(a, \text{lcm}(b, c)) = \text{lcm}(a, \gcd(b, c))$. Let $s(n)$ be the sum of the distinct prime divisors of $n$. If $f(n) < \frac{1}{2018}$, compute the smallest possible value of $s(n)$.

If $r$ is real number sampled at random with uniform probability, find the probability that $r$ is [i]strictly [/i] closer to a multiple of $58$ than it is to a multiple of $37$.

$n$ is a natural number larger than $3$ and denote all positive coprime numbers with $n$ as $1= b_1 < b_2 < \cdots b_k$. For a positive integer $m$ which is larger than $3$ and is coprime with $n$, let $A$ be the set of tuples $(a_1,a_2, \cdots a_k)$ satisfying the condition. $$\textbf{Condition}: \text{For all integers } i, 0 \le a_i < m \text{ and } a_1b_1 + a_2b_2 + \cdots a_kb_k \text{ is a mutiple of } n$$ For elements of $A$, show that the difference of number of elements such that $a_1 = 1$ and the number of elements such that $a_2 = 2$ maximum $1$

Let $p$ be a prime number. How many solutions does the congruence $x^2+y^2+z^2+1\equiv 0\pmod{p}$ have among the modulo $p$ remainder classes? [i]Proposed by: Zoltán Gyenes, Budapest[/i]

Find the all $(m,n)$ integer pairs satisfying $m^4+2n^3+1=mn^3+n$.

Archimedes planned to count all of the prime numbers between $2$ and $1000$ using the Sieve of Eratosthenes as follows: (a) List the integers from $2$ to $1000$. (b) Circle the smallest number in the list and call this $p$. (c) Cross out all multiples of $p$ in the list except for $p$ itself. (d) Let $p$ be the smallest number remaining that is neither circled nor crossed out. Circle $p$. (e) Repeat steps $(c)$ and $(d)$ until each number is either circled or crossed out. At the end of this process, the circled numbers are prime and the crossed out numbers are composite. Unfortunately, while crossing out the multiples of $2$, Archimedes accidentally crossed out two odd primes in addition to crossing out all the even numbers (besides $2$). Otherwise, he executed the algorithm correctly. If the number of circled numbers remaining when Archimedes finished equals the number of primes from $2$ to $1000$ (including $2$), then what is the largest possible prime that Archimedes accidentally crossed out?

Find all integer solutions $(x,y)$ of the equation $y^2=x^3-p^2x,$ where $p$ is a prime such that $p\equiv 3 \mod 4.$

Use each of the digits 1,2,3,4,5,6,7,8,9 exactly twice to form distinct prime numbers whose sum is as small as possible. What must this minimal sum be? (Note: The five smallest primes are 2,3,5,7, and 11)

Let $ R$ be an infinite ring such that every subring of $ R$ different from $ \{0 \}$ has a finite index in $ R$. (By the index of a subring, we mean the index of its additive group in the additive group of $ R$.) Prove that the additive group of $ R$ is cyclic. [i]L. Lovasz, J. Pelikan[/i]

A composite natural number $n$ is called [i]happy [/i] if at most one of the numbers $2^{2^n}+ 1$ and $6^{2^n}+ 1$ is prime. Show that there are infinitely many happy numbers.

Compare the following two numbers: $2^{2^{2^{2^{2}}}}$ and $3^{3^{3^{3}}}$.

Let $n > 1$ be a positive integer. Prove that every term of the sequence $$ n - 1, n^n - 1, n^{n^2} - 1, n^{n^3} - 1, \dots $$ has a prime divisor that does not divide any of the previous terms.

Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.