Let $n$ be a positive integer and let $a_1$, $a_2$,..., $a_n$ be positive integers from set $\{1, 2,..., n\}$ such that every number from this set occurs exactly once. Is it possible that numbers $a_1$, $a_1 + a_2 ,..., a_1 + a_2 + ... + a_n$ all have different remainders upon division by $n$, if: $a)$ $n=7$ $b)$ $n=8$

Show that there are only finitely many solutions to $1/a + 1/b + 1/c = 1/1983$ in positive integers.

For positive integers $x,y$, find all pairs $(x,y)$ such that $x^2y + x$ is a multiple of $xy^2 + 7$.

Does there exist a subset $E$ of the set $N$ of all positive integers such that none of the elements in $E$ can be presented as a sum of at least two other (not necessarily distinct) elements from $E$ ? (E. Barabanov)

Find all pairs of $(x, y)$ of positive integers such that $2x + 7y$ divides $7x + 2y$.

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

Two players play alternately. The first player is given a pair of positive integers $(x_1, y_1)$. Each player must replace the pair $(x_n, y_n)$ that he is given by a pair of non-negative integers $(x_{n+1}, y_{n+1})$ such that $x_{n+1} = min(x_n, y_n)$ and $y_{n+1} = max(x_n, y_n)- k\cdot x_{n+1}$ for some positive integer $k$. The first player to pass on a pair with $y_{n+1} = 0$ wins. Find for which values of $x_1/y_1$ the first player has a winning strategy.

Prove that for every pair of positive integers $(m,n)$, bigger than $2$, there exists positive integer $k$ and numbers $a_0,a_1,...,a_k$, which are bigger than $2$, such that $a_0=m$, $a_1=n$ and for all $i=0,1,...,k-1$ holds $$ a_i+a_{i+1} \mid a_ia_{i+1}+1$$

Find all the positive integers $n$ with the property: there exists an integer $k > 2$ and the positive rational numbers $a_1, a_2, ..., a_k$ such that $a_1 + a_2 + .. + a_k = a_1a_2 . . . a_k = n$.

Consider $10$ distinct positive integers that are all prime to each other (that is, there is no a prime factor common to all), but such that any two of them are not prime to each other. What is the smallest number of distinct prime factors that may appear in the product of $10$ numbers?

We call a positive integer [i] good[/i] if the sum of the reciprocals of all its natural divisors are integers. Prove that if $ m $ is a [i]good [/i] number, and $ p> m $ is a prime number, then $ pm $ is not [i]good[/i].

Determine whether there exist infinitely many triples $(a, b, c)$ of positive integers such that every prime $p$ divides \[\left\lfloor\left(a+b\sqrt{2024}\right)^p\right\rfloor-c.\]

Let $a_1, a_2, ..., a_n$ be positive integers, not necessarily distinct but with at least five distinct values. Suppose that for any $1 \le i < j \le n$, there exist $k,\ell$, both different from $i$ and $j$ such that $a_i + a_j = a_k + a_{\ell}$. What is the smallest possible value of $n$?

Let $a, b$ and $c$ be positive integers such that $a^2 + b^2 + 1 = c^2$ . Prove that $[a/2] + [c / 2]$ is even. Note: $[x]$ is the integer part of $x$.

Let $\mathbb{Z}_+=\{1,2,3,4...\}$ be the set of all positive integers. Determine all functions $f : \mathbb{Z}_+ \mapsto \mathbb{Z}_+$ that satisfy: [list] [*]$f(mn)+1=f(m)+f(n)$ for all positive integers $m$ and $n$; [*]$f(2024)=1$; [*]$f(n)=1$ for all positive $n\equiv22\pmod{23}$. [/list]

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$.

Find all positive integers that can be written in the following way $\frac{b}{a}+\frac{c}{a}+\frac{c}{b}+\frac{a}{b}+\frac{a}{c}+\frac{b}{c}$ . Also, $a,b, c$ are positive integers that are pairwise relatively prime.

Suppose that $k$ is a positive integer. A bijective map $f : Z \to Z$ is said to be $k$-[i]jumpy [/i] if $|f(z) - z| \le k$ for all integers $z$. Is it that case that for every $k$, each $k$-jumpy map is a composition of $1$-jumpy maps? [i]It is well known that this is the case when the support of the map is finite.[/i]

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 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.

For every pair of positive integers $(x, y)$ we define $f(x,y)$ as follows: $f(x,1) = x$ $f(x,y) = 0$ if $y > x$ $f(x +1,y) = y[f(x,y)+ f(x, y-1)]$ Evaluate $f(5, 5)$.

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]

Find all positive integers $1 \le n \le 2008$ so that there exist a prime number $p \ge n$ such that $$\frac{2008^p + (n -1)!}{n}$$ 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?

Find all pairs of positive integers $(x,y)$ such that $2^x + 3^y$ is a perfect square.