Let $A,B\in\mathcal{M}_n(\mathbb{Z})$ and $p$ a prime number. Prove that $$\text{Tr}((A+B)^p)\equiv\text{Tr}(A^p+B^p)\pmod p.$$

What is the sum of the digits of the smallest prime that can be written as a sum of $5$ distinct primes? $\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$

A [i]special number[/i] is a positive integer $n$ for which there exists positive integers $a$, $b$, $c$, and $d$ with \[ n = \frac {a^3 + 2b^3} {c^3 + 2d^3}. \] Prove that i) there are infinitely many special numbers; ii) $2014$ is not a special number. [i]Romania[/i]

Positive integers $a_1, a_2, ... , a_7, b_1, b_2, ... , b_7$ satisfy $2 \leq a_i \leq 166$ and $a_i^{b_i} \cong a_{i+1}^2$ (mod 167) for each $1 \leq i \leq 7$ (where $a_8=a_1$). Compute the minimum possible value of $b_1b_2 ... b_7(b_1 + b_2 + ...+ b_7)$.

Let $p>3$ be a prime and let $1+\frac 12 +\frac 13 +\cdots+\frac 1p=\frac ab$.Prove that $p^4$ divides $ap-b$.

Let $n \geq 2$ be an integer. Define $x_i =1$ or $-1$ for every $i=1,2,3,\cdots, n$. Call an operation [i]adhesion[/i], if it changes the string $(x_1,x_2,\cdots,x_n)$ to $(x_1x_2, x_2x_3, \cdots ,x_{n-1}x_n, x_nx_1)$ . Find all integers $n \geq 2$ such that the string $(x_1,x_2,\cdots, x_n)$ changes to $(1,1,\cdots,1)$ after finitely [i]adhesion[/i] operations.

Let $a$ and $b$ be two distinct positive integers with the same parity. Prove that the fraction $\frac{a!+b!}{2^a}$ is not an integer.

A sequence $a_1,\ldots,a_n$ of positive integers is given. For each $l$ from $1$ to $n-1$ the array $(gcd(a_1,a_{1+l}),\ldots,gcd(a_n,a_{n+l}))$ is considered, where indices are taken modulo $n$. It turned out that all this arrays consist of the same $n$ pairwise distinct numbers and differ only,possibly, by their order. Can $n$ be a) $21$ b) $2021$

Find all integers $x,y$ such that $x^3(y+1)+y^3(x+1)=19$. [i]Proposed by Bulgaria[/i]

We say that a positive integer $k$ is tricubic if there are three positive integers $a, b, c,$ not necessarily different, such that $k=a^3+b^3+c^3.$ a) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly one of the three numbers $n, n+2$ and $n+28$ is tricubic. b) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly two of the three numbers $n, n+2$ and $n+28$ are tricubic. c) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: the three numbers $n, n+2$ and $n+28$ are tricubic.

Find all prime $x,y$ and $z,$ such that $x^5 +y^3 -(x+y)^2=3z^3$

There is a unique degree-$10$ monic polynomial with integer coefficients $f(x)$ such that $$f \left( \sum^9_{j=0}\sqrt[10]{2021^j}\right)= 0.$$ Find the remainder when $f(1)$ is divided by $1000$.

[b]Problem 2[/b] Determine all pairs $(n, m)$ of positive integers satisfying the equation $$5^n = 6m^2 + 1\ . $$

What is the number of integral solutions of the equation $a^{b^2}=b^{2a}$, where a > 0 and $|b|>|a|$ [list=1] [*] 3 [*] 4 [*] 6 [*] 8 [/list]

Determine the number of integer solutions $(x, y, z)$, with $0 \le x, y, z \le 100$, for the equation $$(x - y)^2 + (y + z)^2 = (x + y)^2 + (y - z)^2.$$

For all positive integer $n$, we consider the number $$a_n =4^{6^n}+1943$$ Prove that $a_n$ is dividible by $2013$ for all $n\ge 1$, and find all values of $n$ for which $a_n - 207$ is the cube of a positive integer.

Find all positive integers $n$, such that $n$ is a perfect number and $\varphi (n)$ is power of $2$. [i]Note:a positive integer $n$, is called perfect if the sum of all its positive divisors is equal to $2n$.[/i]

For each $1\leq i\leq 9$ and $T\in\mathbb N$, define $d_i(T)$ to be the total number of times the digit $i$ appears when all the multiples of $1829$ between $1$ and $T$ inclusive are written out in base $10$. Show that there are infinitely many $T\in\mathbb N$ such that there are precisely two distinct values among $d_1(T)$, $d_2(T)$, $\dots$, $d_9(T)$.

For a positive integer $N$, let $c_1 < c_2 < \cdots < c_m$ be all positive integers smaller than $N$ that are coprime to $N$. Find all $N \geqslant 3$ such that $$\gcd( N, c_i + c_{i+1}) \neq 1$$ for all $1 \leqslant i \leqslant m-1$ \\[i]Here $\gcd(a, b)$ is the largest positive integer that divides both $a$ and $b$. Integers $a$ and $b$ are coprime if $\gcd(a, b) = 1$.[/i] \\ [i]Proposed by Paulius Aleknavičius, Lithuania[/i]

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

Prove that for any integer $n$ there exist integers $a, b$ and $c$ such that $n=a^2+b^2-c^2$.

Find the smallest number of the form $1...1$ in its decimal expression which is divisible by $\underbrace{\hbox{3...3}}_{\hbox{100}}$,.

Find all positive integers $x, y, z$ that satisfy the conditions: $$[x,y,z] =(x,y)+(y,z) + (z,x), x\le y\le z, (x,y,z) = 1$$ The symbols $[m,n]$ and $(m,n)$ respectively represent positive integers, the least common multiple and the greatest common divisor of $m$ and $n$.

Determine all ordered pairs $(a,p)$ of positive integers, with $p$ prime, such that $p^a+a^4$ is a perfect square. [i]Proposed by Tahjib Hossain Khan, Bangladesh[/i]

[b]p4[/b] Define the sequence ${a_n}$ as follows: 1) $a_1 = -1$, and 2) for all $n \ge 2$, $a_n = 1 + 2 + . . . + n - (n + 1)$. For example, $a_3 = 1+2+3-4 = 2$. Find the largest possible value of $k$ such that $a_k+a_{k+1} = a_{k+2}$. [b]p5[/b] The taxicab distance between two points $(a, b)$ and $(c, d)$ on the coordinate plane is $|c-a|+|d-b|$. Given that the taxicab distance between points $A$ and $B$ is $8$ and that the length of $AB$ is $k$, find the minimum possible value of $k^2$. [b]p6[/b] For any two-digit positive integer $\overline{AB}$, let $f(\overline{AB}) = \overline{AB}-A\cdot B$, or in other words, the result of subtracting the product of its digits from the integer itself. For example, $f(\overline{72}) = 72-7\cdot 2 = 58$. Find the maximum possible $n$ such that there exist distinct two-digit integers$ \overline{XY}$ and $\overline{WZ}$ such that $f(\overline{XY} ) = f(\overline{WZ}) = n$.