Find the greatest prime factor of $20!+20!+21!$.

Prove that among any $43$ positive integers there exist two $a$ and $b$ such that $a^2 - b^2$ is divisible by $100$.

Let $a_0,a_1,a_2...$ be a sequence of natural numbers with the following property: $a_n^2$ divides $a_{n-1} a_{n+1}$ for $\forall$ $n\in \mathbb{N}$. Prove that, if for some natural $k\geq 2$ the numbers $a_1$ and $a_k$ are coprime, then $a_1$ divides $a_0$.

Determine all positive integers $n$ for which there exist positive integers $a_1,a_2, ..., a_n$ with $a_1 + 2a_2 + 3a_3 +... + na_n = 6n$ and $\frac{1}{a_1}+\frac{2}{a_2}+\frac{3}{a_3}+ ... +\frac{n}{a_n}= 2 + \frac1n$

Metadieu, Tercieu and Quartieu are three bodybuilder warriors who fight against an $n$-headed monster. Each of them can attack the monster according to the following rules: (1) Metadieu's attack consists of cutting off half of the monster's heads, then cutting off one more head. If the monster's number of heads is odd, Metadieu cannot attack; (2) Tercieu's attack consists of cutting off a third of the monster's heads, then cutting off two more heads. If the monster's number of heads is not a multiple of 3, Tercieu cannot attack; (3) Quartieu's attack consists of cutting off a quarter of the monster's heads, then cutting off three more heads. If the monster's number of heads is not a multiple of 4, Quartieu cannot attack; If none of the three warriors can attack the monster at some point, then it will devour our three heroes. The objective of the three warriors is to defeat the monster, and for that they need to cut off all its heads, one warrior attacking at a time. For what positive integer values of $n$ is it possible for the three warriors to combine a sequence of attacks in order to defeat the monster?

Decide if the vertices of a regular $30$-gon can be numbered by numbers $1, 2,.., 30$ in such a way that the sum of the numbers of every two neighboring to be a square of a certain natural number.

Let $\varphi(n)$ denotes the number of positive integers less than or equal to $n$ which are relatively prime to $n$. Determine the number of positive integers $2\leq n\leq 50$ such that all coefficients of the polynomial \[ \left(x^{\varphi(n)} - 1\right) - \prod_{\substack{1\leq k\leq n\\\gcd(k,n) = 1}}(x-k) \] are divisible by $n$.

Starting from a positive integer $n$, we can replace the current number with a multiple of the current number or by deleting one or more zeroes from the decimal representation of the current number. Prove that for all values of $n$, it is possible to obtain a single-digit number by applying the above algorithm a finite number of times. There is a nice solution to this...

Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

prove for all $k> 1$ equation $(x+1)(x+2)...(x+k)=y^{2}$ has finite solutions.

Let $n$ be a positive odd integer , $a_1,a_2,\cdots,a_n$ be any permutation of the positive integers $1,2,\cdots,n$ . Prove that :$(a_1-1)(a^2_2-2)(a^3_3-3)\cdots (a^n_n-n)$ is an even number.

Let $n$ be an odd positive integer. Prove that if the equation $\frac1x+\frac1y=\frac4n$ has a solution in positive integers $x,y$, then $n$ has at least one divisor of the form $4k-1$, $k\in\mathbb N$.

Determine all positive integers $ n\geq 2$ that satisfy the following condition: for all $ a$ and $ b$ relatively prime to $ n$ we have \[a \equiv b \pmod n\qquad\text{if and only if}\qquad ab\equiv 1 \pmod n.\]

Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$. [i]Proposed by Evan Chen[/i]

Prove that there are no pairs of nonnegative integers $(x,y)$ that satisfy the equality $$x^3-y^3=x-y+2^{x-y}.$$

Find the largest positive integer $n$ such that $n^2 + 10$ is divisible by $n-5$.

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)

Let $u$, $v$, $w$ complex numbers such that: $u + v + w = 1$, $u^2 + v^2 + w^2 = 3$, $uvw = 1$. Prove that [list=1] [*] $u$, $v$, $w$ are distinct numbers two by two [*] If $S(k)= u^k + v^k + w^k$, then $S(k)$ is an odd natural number [*] The expression$$\frac{u^{2n+1} - v^{2n+1}}{u-v}+\frac{v^{2n+1}-w^{2n+1}}{v-w}+\frac{w^{2n+1}-u^{2n+1}}{w-u}$$is an integer number. [/list]

Let $\mathbb{P}$ be the set of all prime numbers. Find all functions $f:\mathbb{P}\rightarrow\mathbb{P}$ such that: $$f(p)^{f(q)}+q^p=f(q)^{f(p)}+p^q$$ holds for all $p,q\in\mathbb{P}$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

The given natural numbers are $ k, n $. We inductively define two sequences of numbers $ (a_j) $ and $ (r_j) $ as follows: Step one: we divide $ k $ by $ n $ and get the quotient $ a_1 $ and the remainder $ r_i $, step j: we divide $ k+r_{j-1} $ by $ n $ and get the quotient $ a_j $ and the remainder $ r_j $. Calculate the sum of $ a_1 + \ldots + a_n $.

Find all prime numbers $p$ for which the number of ordered pairs of integers $(x, y)$ with $0\leq x, y < p$ satisfying the condition \[y^2 \equiv  x^3 - x \pmod p\] is exactly $p.$

We consider the following operation applied to a positive integer: The integer is represented in an arbitrary base $b \ge 2$, in which it has exactly two digits and in which both digits are different from $0$. Then the two digits are swapped and the result in base $b$ is the new number. Is it possible to transform every number $> 10$ to a number $\le 10$ with a series of such operations? (Theresia Eisenkölbl)

Let $n$ be a positive integer. - Find, in terms of $n$, the number of pairs $(x,y)$ of positive integers that are solutions of the equation : $$x^2-y^2=10^2.30^{2n}$$ - Prove further that this number is never a square

A $24$-hour digital clock shows times $h : m : s$, where $h$, $m$, and $s$ are integers with $0 \le h \le 23$, $0 \le m \le 59$, and $0 \le s \le 59$. How many times $h : m : s$ satisfy $h + m = s$?

Find all ordered pairs $(a, b)$ of positive integers such that $a^2 + b^2 + 25 = 15ab$ and $a^2 + ab + b^2$ is prime.