Find the smallest positive integer $n$ such that $n^2+4$ has at least four distinct prime factors. [i]Proposed by Michael Tang[/i]

Let $f: N \to N$ satisfy $n=\sum_{d|n} f(d), \forall n \in N$. Then sum of all possible values of $f(100)$ is?

Let $n$ be a positive integer. Find all positive integers $m$ for which there exists a polynomial $f(x) = a_{0} + \cdots + a_{n}x^{n} \in \mathbb{Z}[X]$ ($a_{n} \not= 0$) such that $\gcd(a_{0},a_{1},\cdots,a_{n},m)=1$ and $m|f(k)$ for each $k \in \mathbb{Z}$.

For all positive integer $ n \ge 2 $, prove that $ 2^n -1 $ can't be a divisor of $ 3^n -1 $.

Let $n$ be a positive integer. Let $D_n$ be the set of all divisors of $n$ and let $f(n)$ denote the smallest natural $m$ such that the elements of $D_n$ are pairwise distinct in mod $m$. Show that there exists a natural $N$ such that for all $n \geq N$, one has $f(n) \leq n^{0.01}$.

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Find all natural numbers $n$ for which each natural number written with $~$ $n-1$ $~$ 'ones' and one 'seven' is prime.

There are $2022$ natural numbers written in a row. Product of any two adjacent numbers is a perfect cube. Prove that the product of the two extremes is also a perfect cube.

Find all permutations $(a_1, a_2,...,a_{2021})$ of $(1,2,...,2021)$, such that for every two positive integers $m$ and $n$ with difference bigger than $20^{21}$, the following inequality holds: $GCD(m+1, n+a_1)+GCD(m+2, n+a_2)+...+GCD(m+2021, n+a_{2021})<2|m-n|$.

Let $p$ be a prime of the form $p=4n-1$ where $n$ is a positive integer. Prove that $$\prod_{k=1}^p(k^2+1)\equiv4\pmod p.$$

For a number $n$ in base $10$, let $f(n)$ be the sum of all numbers possible by removing some digits of $n$ (including none and all). For example, if $n = 1234$, $f(n) = 1234 + 123 + 124 + 134 + 234 + 12 + 13 + 14 + 23 + 24 + 34 + 1 + 2 + 3 + 4 = 1979$; this is formed by taking the sums of all numbers obtained when removing no digit from $n$ (1234), removing one digit from $n$ (123, 124, 134, 234), removing two digits from $n$ (12, 13, 14, 23, 24, 34), removing three digits from $n$ (1, 2, 3, 4), and removing all digits from $n$ (0). If $p$ is a 2011-digit integer, prove that $f(p)-p$ is divisible by $9$. Remark: If a number appears twice or more, it is counted as many times as it appears. For example, with the number $101$, $1$ appears three times (by removing the first digit, giving $01$ which is equal to $1$, removing the first two digits, or removing the last two digits), so it is counted three times.

Define a finite sequence $ \left( s_i \right)_{1\le i\le 2004} $ with $ s_0+2=s_1+1=s_2=2 $ and the recurrence relation $$ s_n=1+s_{n-1} +s_{n-2} -s_{n-3} . $$ Calculate its last element.

Find all integers $n$ such that if \[ 1 = d_1 < d_2 < \cdots < d_{k-1} < d_k = n \] are the divisors of $n$, then the sequence \[ d_2 - d_1,\, d_3 - d_2,\, \ldots,\, d_k - d_{k-1} \] forms a permutation of an arithmetic progression. [i](Kritesh Dhakal, Nepal)[/i]

Let $a_0=0,a_1\in\mathbb Z_+.$ For integer $n\geq 2,a_n$ is the smallest positive integer satisfy that for $\forall 0\leq i\neq j\leq n-1,a_n\nmid (a_i-a_j).$ (1) If $a_1=2023,$ calculate $a_{10000}.$ (2) If $a_t\leq\frac{a_1}2,$ find the maximum value of $\frac t{a_1}.$

Let $ n\ge 2 $ be a natural number. Prove the following propositions: [b]a)[/b] $ a_1,a_2,\ldots ,a_n\in\mathbb{R}\wedge a_1+\cdots +a_n=a_1^2+\cdots +a_n^2\implies a_1+\cdots +a_n\le a_n. $ [b]b)[/b] $ x\in [1,n]\implies\exists b_1,b_2,\ldots ,b_n\in\mathbb{R}_{\ge 0}\quad x=b_1+\cdots +b_n=b_1^2 +\cdots +b_n^2 . $

Let $(x_n)$ be a sequence of positive integers defined as follows: $x_1$ is a fixed six-digit number and for any $n \geq 1$, $x_{n+1}$ is a prime divisor of $x_n + 1$. Find $x_{19} + x_{20}$.

A positive integer $n$ is called a $\textit{supersquare}$ if there exists a positive integer $m$, such that $10 \nmid m$ and the decimal representation of $n=m^2$ consists only of digits among $\{0, 4, 9\}$. Are there infinitely many $\textit{supersquares}$?

For positive integers $a$ and $b$, $gcd (a, b)$ denote their greatest common divisor and $lcm (a, b)$ their least common multiple. Determine the number of ordered pairs (a,b) of positive integers satisfying the equation $ab + 63 = 20\, lcm (a, b) + 12\, gcd (a,b)$

Let $a,b,c$ be integers which are lengths of sides of a triangle, $\gcd(a,b,c)=1$ and all the values $$\frac{a^2+b^2-c^2}{a+b-c},\quad\frac{b^2+c^2-a^2}{b+c-a},\quad\frac{c^2+a^2-b^2}{c+a-b}$$ are integers as well. Show that $(a+b-c)(b+c-a)(c+a-b)$ or $2(a+b-c)(b+c-a)(c+a-b)$ is a perfect square.

Prove that if a natural number $ N $ can be represented in the form the sum of three squares of integers divisible by $3$, then it is also is represented as the sum of three squares of integers that are not divisible by $3$.

Does there exist an infinite subset $S$ of the natural numbers such that for every $a$, $b \in S$, the number $(ab)^2$ is divisible by $a^2-ab+b^2$?

Let $n \geq 2$ be a positive integer. If $m$ is a positive integer, for which all of its positive divisors can be split into $n$ disjoint sets of equal sum, prove that $m \geq 2^{n+1}-2$

6. Let $f(p)$ denote the number of ordered tuples $\left(x_{1}, x_{2}, \ldots, x_{p}\right)$ of nonnegative integers satisfying $\sum_{i=1}^{p} x_{i}=2022$, where $x_{i} \equiv i(\bmod p)$ for all $1 \leq i \leq p$. Find the remainder when $\sum_{p \in \mathcal{S}} f(p)$ is divided by 1000, where $\mathcal{S}$ denotes the set of all primes less than 2022 .

Let $n>1$ be a positive integer. Call a rearrangement $a_1,a_2, \cdots , a_n$ of $1,2, \cdots , n$ [i]nice[/i] if for every $k = 2,3, \cdots , n$, we have that $a_1 + a_2 + \cdots + a_k$ is not divisible by $k$. (a) If $n>1$ is odd, prove that there is no nice arrangement of $1,2, \cdots , n$. (b) If $n$ is even, find a [i]nice[/i] arrangement of $1,2, \cdots , n$.

A cube of size $4 \times 4 \times 4$ is divided into 16 equal squares per face, with numbers from 1 to 96 randomly assigned to these squares. An operation consists of taking two squares that share a vertex, summing their numbers, and rewriting this sum in one of the squares while leaving the other blank. After performing several such operations, only one number remains. Prove that regardless of the order of operations, the final remaining number is always the same. Additionally, find this number.