Let $M$ be a set containing positive integers with the following three properties: (1) $2018 \in M$. (2) If $m \in M$, then all positive divisors of m are also elements of $M$. (3) For all elements $k, m \in M$ with $1 < k < m$, the number $km + 1$ is also an element of $M$. Prove that $M = Z_{\ge 1}$. [i](Proposed by Walther Janous)[/i]

Find all solutions in positive integers to $(n+1)^k -1 = n!$

Denote by $\mathbb{N}$ the set of positive integers. Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that: [b]•[/b] For all positive integers $a> 2023^{2023}$ it holds that $f(a) \leq a$. [b]•[/b] $\frac{a^2f(b)+b^2f(a)}{f(a)+f(b)}$ is a positive integer for all $a,b \in \mathbb{N}$. [i]Proposed by Nikola Velov[/i]

We start with any finite list of distinct positive integers. We may replace any pair $n, n + 1$ (not necessarily adjacent in the list) by the single integer $n-2$, now allowing negatives and repeats in the list. We may also replace any pair $n, n + 4$ by $n - 1$. We may repeat these operations as many times as we wish. Either determine the most negative integer which can appear in a list, or prove that there is no such minimum.

If $n$ is a positive integer and $a, b$ are relatively prime positive integers, calculate $(a + b,a^n + b^n)$.

Consider a sequence of positive integers with total sum $2019$ such that no number and no sum of a set of consecutive num bers is equal to $40$. What is the greatest possible length of such a sequence? (Alexandr Shapovalov)

Denote by $T(n)$ the sum of the digits of the decimal representation of a positive integer $n$. a) Find an integer $N$, for which $T(k \cdot N)$ is even for all $k, 1 \le k \le 1992, $ but $T(1993 \cdot N)$ is odd. b) Show that no positive integer $N$ exists such that $T(k \cdot N)$ is even for all positive integers $k$.

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.

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.

Let $N$ be the set of positive integers. Find all the functions $f: N\to N$ with $f (1) = 2$ and such that $max \{f(m)+f(n), m+n\}$ divides $min\{2m+2n,f (m+ n)+1\}$ for all $m, n$ positive integers

Is it true that every positive integer greater than $50$ is a sum of $4$ positive integers such that each two of them have a common divisor greater than $1$?

The [i]runcible[/i] positive integers are defined recursively as follows: [list] [*]$1$ and $2$ are runcible [*]If $a$ and $b$ are runcible (where $a$ and $b$ are not necessarily distinct) then $2a + 3b$ is runcible. [/list] Is $2024$ runcible?

Find all positive integers $n$ such that there exists a prime number $p$, such that $p^n-(p-1)^n$ is a power of $3$. Note. A power of $3$ is a number of the form $3^a$ where $a$ is a positive integer.

Vukasin, Dimitrije, Dusan, Stefan and Filip asked their teacher to guess three consecutive positive integers, after these true statements: Vukasin: " The sum of the digits of one number is prime number. The sum of the digits of another of the other two is, an even perfect number.($n$ is perfect if $\sigma\left(n\right)=2n$). The sum of the digits of the third number equals to the number of it's positive divisors". Dimitrije:"Everyone of those three numbers has at most two digits equal to $1$ in their decimal representation". Dusan:"If we add $11$ to exactly one of them, then we have a perfect square of an integer" Stefan:"Everyone of them has exactly one prime divisor less than $10$". Filip:"The three numbers are square free". Professor found the right answer. Which numbers did he mention?