Found problems: 387
1996 Austrian-Polish Competition, 1
Let $k \ge 1$ be a positive integer. Prove that there exist exactly $3^{k-1}$ natural numbers $n$ with the following properties:
(i) $n$ has exactly $k$ digits (in decimal representation),
(ii) all the digits of $n$ are odd,
(iii) $n$ is divisible by $5$,
(iv) the number $m = n/5$ has $k$ odd digits
2010 Thailand Mathematical Olympiad, 3
Show that there are infinitely many positive integers n such that $2\underbrace{555...55}_{n}3$ is divisible by $2553$.
1971 Spain Mathematical Olympiad, 8
Among the $2n$ numbers $1, 2, 3, . . . , 2n$ are chosen in any way $n + 1$ different numbers. Prove that among the chosen numbers there are at least two, such that one divides the other.
2019 Final Mathematical Cup, 3
Determine every prime numbers $p$ and $q , p \le q$ for which $pq | (5^p - 2^ p )(7^q -2 ^q )$
1999 Estonia National Olympiad, 5
On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.
2012 QEDMO 11th, 12
Prove that there are infinitely many different natural numbers of the form $k^2 + 1$, $k \in N$ that have no real divisor of this form.
2015 Saudi Arabia GMO TST, 4
Let $p$ be an odd prime number. Prove that there exists a unique integer $k$ such that $0 \le k \le p^2$ and $p^2$ divides $k(k + 1)(k + 2) ... (k + p - 3) - 1$.
Malik Talbi
2007 Switzerland - Final Round, 2
Let $a, b, c$ be three integers such that $a + b + c$ is divisible by $13$. Prove that $$a^{2007}+b^{2007}+c^{2007}+2 \cdot 2007abc$$ is divisible by $13$.
2012 Austria Beginners' Competition, 1
Let $a, b, c$ and $d$ be four integers such that $7a + 8b = 14c + 28d$.
Prove that the product $a\cdot b$ is always divisible by $14$.
2016 Saudi Arabia Pre-TST, 1.3
Let $a, b$ be two positive integers such that $b + 1|a^2 + 1$,$ a + 1|b^2 + 1$. Prove that $a, b$ are odd numbers.
2013 Balkan MO Shortlist, A5
Determine all positive integers$ n$ such that $f_n(x,y,z) = x^{2n} + y^{2n} + z^{2n} - xy - yz - zx$ divides $g_n(x,y, z) = (x - y)^{5n} + (y -z)^{5n} + (z - x)^{5n}$, as polynomials in $x, y, z$ with integer coefficients.
2013 Abels Math Contest (Norwegian MO) Final, 3
A prime number $p \ge 5$ is given. Write $\frac13+\frac24+... +\frac{p -3}{p - 1}=\frac{a}{b}$ for natural numbers $a$ and $b$. Show that $p$ divides $a$.
2012 China Northern MO, 8
Assume $p$ is a prime number. If there is a positive integer $a$ such that $p!|(a^p + 1)$, prove that :
(1) $(a+1, \frac{a^p+1}{a+1}) = p$
(2) $\frac{a^p+1}{a+1}$ has no prime factors less than $p$.
(3) $p!|(a +1) $.
2021 Durer Math Competition Finals, 14
How many functions $f : \{1, 2, . . . , 16\} \to \{1, 2, . . . , 16\}$ have the property that $f(f(x))-4x$ is divisible by $17$ for all integers $1 \le x \le 16$?
2022 Durer Math Competition Finals, 10
The pair of positive integers $(a, b)$ is such that a does not divide $b$, $b$ does not divide a, both numbers are at most $100$, and they have the maximal possible number of common divisors. What is the largest possible value of $a \cdot· b$?
1977 Swedish Mathematical Competition, 1
$p$ is a prime. Find the largest integer $d$ such that $p^d$ divides $p^4!$.
2008 Switzerland - Final Round, 3
Show that each number is of the form $$2^{5^{2^{5^{...}}}}+ 4^{5^{4^{5^{...}}}}$$
is divisible by $2008$, where the exponential towers can be any independent ones have height $\ge 3$.
1997 All-Russian Olympiad Regional Round, 10.3
Natural numbers $m$ and $n$ are given. Prove that the number $2^n-1$ is divisible by the number $(2^m -1)^2$ if and only if the number $n$ is divisible by the number $m(2^m-1)$.
2017 Regional Olympiad of Mexico West, 6
A [i]change [/i] in a natural number $n$ consists of adding a pair of zeros between two digits or at the end of the decimal representation of $n$. A [i]countryman [/i] of $n$ is a number that can be obtained from one or more changes in $n$. For example. $40041$, $4410000$ and $4004001$ are all countrymen from $441$. Determine all the natural numbers $n$ for which there is a natural number m with the property that $n$ divides $m$ and all the countrymen of $m$.
2009 Thailand Mathematical Olympiad, 10
Let $p > 5$ be a prime. Suppose that $$\frac{1}{2^2} + \frac{1}{4^2}+ \frac{1}{6^2}+ ...+ \frac{1}{(p -1)^2} =\frac{a}{b}$$ where $a/b$ is a fraction in lowest terms. Show that $p | a$.
2019 Junior Balkan Team Selection Tests - Romania, 1
Let $n$ be a nonnegative integer and $M =\{n^3, n^3+1, n^3+2, ..., n^3+n\}$.
Consider $A$ and $B$ two nonempty, disjoint subsets of $M$ such that the sum of elements of the set $A$ divides the sum of elements of the set $B$. Prove that the number of elements of the set $A$ divides the number of elements of the set $B$.
2021 Francophone Mathematical Olympiad, 1
Let $a_1,a_2,a_3,\ldots$ and $b_1,b_2,b_3,\ldots$ be positive integers such that $a_{n+2} = a_n + a_{n+1}$ and $b_{n+2} = b_n + b_{n+1}$ for all $n \ge 1$. Assume that $a_n$ divides $b_n$ for infinitely many values of $n$. Prove that there exists an integer $c$ such that $b_n = c a_n$ for all $n \ge 1$.
1945 Moscow Mathematical Olympiad, 094
Prove that it is impossible to divide a scalene triangle into two equal triangles.
1975 Swedish Mathematical Competition, 5
Show that $n$ divides $2^n + 1$ for infinitely many positive integers $n$.
2010 Saudi Arabia IMO TST, 1
Find all pairs $(m,n)$ of integers, $m ,n \ge 2$ such that $mn - 1$ divides $n^3 - 1$.