Let be a natural number $ a\ge 2. $ [b]a)[/b] Show that there is no infinite sequence $ \left( k_n \right)_{n\ge 1} $ of pairwise distinct natural numbers greater than $ 1 $ having the property that the sequence $ \left( a^{1/k_n} \right)_{n\ge 1} $ is a geometric progression. [b]b)[/b] Show that there are finite sequences $ \left( l_i \right)_i, $ of any length, of pairwise distinct natural numbers greater than $ 1 $ with the property that $ \left( a^{1/l_i} \right)_{i} $ is a geometric progression. [i]Bogdan Enescu[/i]

Let $n$ be a natural number, for which we define $S(n)=\{1+g+g^2+...+g^{n-1}|g\in{\mathbb{N}},g\geq2\}$ $a)$ Prove that: $S(3)\cap S(4)=\varnothing$ $b)$ Determine: $S(3)\cap S(5)$

Let $x, y$ be real numbers such that $x-y, x^2-y^2, x^3-y^3$ are all prime numbers. Prove that $x-y=3$. EDIT: Problem submitted by Leonel Castillo, Panama.

Let $m$ and $n{}$ be positive integers of the same parity such that $n^2-1$ divides $|m^2+1-n^2|$. Is the number $|m^2+1-n^2|$ is a perfect square?

Given the endless arithmetic progression with the positive integer members. One of those is an exact square. Prove that the progression contain the infinite number of the exact squares.

A math contest consists of $9$ objective type questions and $6$ fill in the blanks questions. From a school some number of students took the test and it was noticed that all students had attempted exactly $14$ out of $15$ questions. Let $O_1, O_2, \dots , O_9$ be the nine objective questions and $F_1, F_2, \dots , F_6$ be the six fill inthe blanks questions. Let $a_{ij}$ be the number of students who attemoted both questions $O_i$ and $F_j$. If the sum of all the $a_{ij}$ for $i=1, 2,\dots , 9$ and $j=1, 2,\dots , 6$ is $972$, then find the number of students who took the test in the school.

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

Find all prime numbers $p$ such that $p^3-4p+9$ is a perfect square.

To celebrate the 20th Thailand Mathematical Olympiad (TMO), Ratchasima Witthayalai School put up flags around the Thao Suranari Monument so that [list=i] [*] Each flag is painted in exactly one color, and at least $2$ distinct colors are used. [*] The number of flags are odd. [*] Every flags are on a regular polygon such that each vertex has one flag. [*] Every flags with the same color are on a regular polygon. [/list] Prove that there are at least $3$ colors with the same amount of flags.

Let $p$ be a prime number. We construct a directed graph of $p$ vertices, labeled with integers from $0$ to $p-1$. There is an edge from vertex $x$ to vertex $y$ if and only if $x^2+1\equiv y \pmod{p}$. Let $f(p)$ denotes the length of the longest directed cycle in this graph. Prove that $f(p)$ can attain arbitrarily large values.

$N$ in natural. There are natural numbers from $N^3$ to $N^3+N$ on the board. $a$ numbers was colored in red, $b$ numbers was colored in blue. Sum of red numbers in divisible by sum of blue numbers. Prove, that $b|a$

Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$

Prove that for any integer $n>1$ there are distinct integers $a,b,c$ between $n^2$ and $(n+1)^2$ such that $c$ divides $a^2+b^2$.

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]

Let $P(x) \in \mathbb{Q}[x]$ be a polynomial with rational coefficients and degree $d\ge 2$. Prove there is no infinite sequence $a_0, a_1, \ldots$ of rational numbers such that $P(a_i)=a_{i-1}+i$ for all $i\ge 1$. [i]Proposed by Pranjal Srivastava and Rohan Goyal[/i]

Find the smallest prime number $p$ that cannot be represented in the form $|3^{a} - 2^{b}|$, where $a$ and $b$ are non-negative integers.

Find all triples $(a,b,c)$ such that $a,b,c$ are integers in the set $\{2000,2001,\ldots,3000\}$ satisfying $a^2+b^2=c^2$ and $\text{gcd}(a,b,c)=1$.

A positive integer $t$ is called a Jane's integer if $t = x^3+y^2$ for some positive integers $x$ and $y$. Prove that for every integer $n \ge 2$ there exist infinitely many positive integers $m$ such that the set of $n^2$ consecutive integers $\{m+1,m+2,\dotsc,m+n^2\}$ contains exactly $n + 1$ Jane's integers.

Let $A$ be a finite set of positive integers. Prove that there exists a finite set $B$ of positive integers such that $A \subset B$ and $$\prod_{x \in B} x =\sum_{x \in B}x^2$$

Define alternate sum of a set of real numbers $A =\{a_1,a_2,...,a_k\}$ with $a_1 < a_2 <...< a_k$, the number $S(A) = a_k - a_{k-1} + a_{k-2} - ... + (-1)^{k-1}a_1$ (for example if $A = \{1,2,5, 7\}$ then $S(A) = 7 - 5 + 2 - 1$) Consider the alternate sums, of every subsets of $A = \{1, 2, 3, 4, 5, 6, 7, 8,9, 10\}$ and sum them. What is the last digit of the sum obtained?

A positive integer is written on each of the six faces of a cube. For each vertex of the cube we compute the product of the numbers on the three adjacent faces. The sum of these products is $1001$. What is the sum of the six numbers on the faces?

Provided the equation $xyz = p^n(x + y + z)$ where $p \geq 3$ is a prime and $n \in \mathbb{N}$. Prove that the equation has at least $3n + 3$ different solutions $(x,y,z)$ with natural numbers $x,y,z$ and $x < y < z$. Prove the same for $p > 3$ being an odd integer.

Let $n>1$ be a positive integer. Show that the number of residues modulo $n^2$ of the elements of the set $\{ x^n + y^n : x,y \in \mathbb{N} \}$ is at most $\frac{n(n+1)}{2}$. [I]Proposed by N. Safaei (Iran)[/i]

Sabine has a very large collection of shells. She decides to give part of her collection to her sister. On the first day, she lines up all her shells. She takes the shells that are in a position that is a perfect square (the first, fourth, ninth, sixteenth, etc. shell), and gives them to her sister. On the second day, she lines up her remaining shells. Again, she takes the shells that are in a position that is a perfect square, and gives them to her sister. She repeats this process every day. The $27$th day is the first day that she ends up with fewer than $1000$ shells. The $28$th day she ends up with a number of shells that is a perfect square for the tenth time. What are the possible numbers of shells that Sabine could have had in the very beginning?