Olympiad problems

1990 Nordic, 4

It is possible to perform three operations $f, g$, and $h$ for positive integers: $f(n) = 10n, g(n) = 10n + 4$, and $h(2n) = n$; in other words, one may write $0$ or $4$ in the end of the number and one may divide an even number by $2$. Prove: every positive integer can be constructed starting from $4$ and performing a finite number of the operations $f, g,$ and $h$ in some order.

1974 Vietnam National Olympiad, 1

Tags: number theory , digit , positive integer

Find all positive integers $n$ and $b$ with $0 < b < 10$ such that if $a_n$ is the positive integer with $n$ digits, all of them $1$, then $a_{2n} - b a_n$ is a square.

1993 Nordic, 3

Tags: system of equations , digit , positive integer , number theory

Find all solutions of the system of equations $\begin{cases} s(x) + s(y) = x \\ x + y + s(z) = z \\ s(x) + s(y) + s(z) = y - 4 \end{cases}$ where $x, y$, and $z$ are positive integers, and $s(x), s(y)$, and $s(z)$ are the numbers of digits in the decimal representations of $x, y$, and $z$, respectively.

2002 Rioplatense Mathematical Olympiad, Level 3, 2

Tags: integer , positive integer , inequality , number theory , algebra

Let $\lambda$ be a real number such that the inequality $0 <\sqrt {2002} - \frac {a} {b} <\frac {\lambda} {ab}$ holds for an infinite number of pairs $ (a, b)$ of positive integers. Prove that $\lambda \geq 5 $.

1983 Austrian-Polish Competition, 4

Tags: number theory , positive integer , partition , set

The set $N$ has been partitioned into two sets A and $B$. Show that for every $n \in N$ there exist distinct integers $a, b > n$ such that $a, b, a + b$ either all belong to $A$ or all belong to $B$.

2006 MOP Homework, 7

Tags: positive integer , function , number theory

Let $n$ be a given integer greater than two, and let $S = \{1, 2,...,n\}$. Suppose the function $f : S^k \to S$ has the property that $f(a) \ne f(b)$ for every pair $a$ and $b$ of elements in $S^k$ with $a$ and $b$ differ in all components. Prove that $f$ is a function of one of its elements.

2013 JBMO Shortlist, 5

Tags: positive integer , number theory , diophantine equation

Solve in positive integers: $\frac{1}{x^2}+\frac{y}{xz}+\frac{1}{z^2}=\frac{1}{2013}$ .

2024 Mozambican National MO Selection Test, P3

Tags: positive integer , nt , number theory , diophantine equation , factorization , prime number

Find all triples of positive integers $(a,b,c)$ such that: $a^2bc-2ab^2c-2abc^2+b^3c+bc^3+2b^2c^2=11$

2007 Korea Junior Math Olympiad, 8

Tags: prime , positive integer , divisor , number theory

Prime $p$ is called [i]Prime of the Year[/i] if there exists a positive integer $n$ such that $n^2+ 1 \equiv 0$ ($mod p^{2007}$). Prove that there are infinite number of [i]Primes of the Year[/i].

2014 Korea Junior Math Olympiad, 4

Tags: number theory , greatest common divisor , positive integer

Positive integers $p, q, r$ satisfy $gcd(a,b,c) = 1$. Prove that there exists an integer $a$ such that $gcd(p,q+ar) = 1$.

2018 Mexico National Olympiad, 4

Tags: positive integer , algebra , inequality , maximum value

Let $n\geq 2$ be an integer. For each $k$-tuple of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+\cdots +a_k=n$, consider the sums $S_i=1+2+\ldots +a_i$ for $1\leq i\leq k$. Determine, in terms of $n$, the maximum possible value of the product $S_1S_2\cdots S_k$. [i]Proposed by Misael Pelayo[/i]

2019 Saint Petersburg Mathematical Olympiad, 6

Tags: positive integer , combinatorial geometry , combinatorics , chessboard , infinite chessboard

Is it possible to arrange everything in all cells of an infinite checkered plane all natural numbers (once) so that for each $n$ in each square $n \times n$ the sum of the numbers is a multiple of $n$?

2006 Bosnia and Herzegovina Team Selection Test, 3

Tags: fractional part , inequality , number theory , positive integer , inequalities

Prove that for every positive integer $n$ holds inequality $\{n\sqrt{7}\}>\frac{3\sqrt{7}}{14n}$, where $\{x\}$ is fractional part of $x$.

2018 Rioplatense Mathematical Olympiad, Level 3, 5

Tags: positive integer , product , number theory , integer

Let $n$ be a positive integer. Find all $n$- rows $( a_1 , a_2 ,..., a_n )$ of different positive integers such that $$ \frac{(a_1 + d ) (a_2 + d ) \cdot\cdot\cdot ( a_n + d )}{a_1a_2\cdot \cdot \cdot a_n }$$ is integer for every integer $d\ge 0$

2008 India Regional Mathematical Olympiad, 3

Tags: positive integer , inequalities , inequality , real number

Prove that for every positive integer $n$ and a non-negative real number $a$, the following inequality holds: $$n(n+1)a+2n \geqslant 4\sqrt{a}(\sqrt{1}+\sqrt{2}+\dots+\sqrt{n}).$$

2021 Polish Junior MO Finals, 1

Tags: positive integer , square root , algebra

Positive integers $a$, $b$ an $n$ satisfy \[ \frac{a}{b}=\frac{a^2+n^2}{b^2+n^2}. \] Prove that $\sqrt{ab}$ is an integer.

2013 Dutch BxMO/EGMO TST, 2

Tags: positive integer , triple , combinatorics , number theory , sum

Consider a triple $(a, b, c)$ of pairwise distinct positive integers satisfying $a + b + c = 2013$. A step consists of replacing the triple $(x, y, z)$ by the triple $(y + z - x,z + x - y,x + y - z)$. Prove that, starting from the given triple $(a, b,c)$, after $10$ steps we obtain a triple containing at least one negative number.

2017 Czech-Polish-Slovak Match, 1

Tags: perfect square , positive integer , number theory

Find all positive real numbers $c$ such that there are infinitely many pairs of positive integers $(n,m)$ satisfying the following conditions: $n \ge m+c\sqrt{m - 1}+1$ and among numbers $n. n+1,.... 2n-m$ there is no square of an integer. (Slovakia)

1982 Brazil National Olympiad, 2

Tags: number theory , sequence , positive integer

Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.

2010 IMO Shortlist, 6

Tags: positive integer , function , functional equation , algebra

Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$ [i]Proposed by Alex Schreiber, Germany[/i]