A [i]pucelana[/i] sequence is an increasing sequence of $16$ consecutive odd numbers whose sum is a perfect cube. How many pucelana sequences are there with $3$-digit numbers only?

Natural $a,b,c$ are $>100$ and $(a,b,c)=1$. $c|a+b,a|b+c$ Find minimal $b$

Determine all triples $(k, m, n) $ of positive integers satisfying $$k!+m!=k!n!.$$

Let $n\ge1$ and $r\ge2$ be positive integers. Prove that there is no integer $m$ such that $n(n+1)(n+2)=m^r$.

Find all integers $x,y,z$ such that \[x^3+y^3+z^3=x+y+z=8\]

Let $n=(q + 2)q^{2021}$ where $q=10^9+7$. For every $k<=n$ and prime $p|n$, define $f_{p,k}(n)$ =$ v_{p}$$ (\binom{n}{k}) $ ($v_{p}$$(i)$ is the highest power of $p$ that divides $i$). Let $m$ be the maximum possible (over all $k$) value of the expression $\prod_{p\text{,prime,} p|n} f_{p,k}$. Find the sum of the digits of $m$.

Let $n$ be a constant positive integer. Show that for only non-negative integers $k$, the Diophantine equation $\sum_{i=1 }^{n}{ x_i ^3}=y^{3k+2}$ has infinitely many solutions in the positive integers $x_i, y$.

Let $f\left(x\right)$ be a non-constant polynomial with integer coefficients, and let $u$ be an arbitrary positive integer. Prove that there is an integer $n$ such that $f\left(n\right)$ has at least $u$ distinct prime factors and $f\left(n\right) \neq 0$.

Let $ a\ge 2 $ be a natural number. Show that the following relations are equivalent: $ \text{(i)} \ a $ is the hypothenuse of a right triangle whose sides are natural numbers. $ \text{(ii)}\quad $ there exists a natural number $ d $ for which the polynoms $ X^2-aX\pm d $ have integer roots.

Solve in positive integers $x^yy^x=(x+y)^z$

You have four fair $6$-sided dice, each numbered $1$ to $6$ (inclusive). If all four dice are rolled, the probability that the product of the rolled numbers is prime can be written as $\tfrac{a}{b}$, where $a$ and $b$ are relatively prime. What is $a+b$?

Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\] [i]Proposed by Angelo Di Pasquale, Australia[/i]

Let $a > b > c > d$ be positive integers and suppose that \[ ac + bd = (b+d+a-c)(b+d-a+c). \] Prove that $ab + cd$ is not prime.

Dima has red and blue felt—tip pens, with one of them he paints rational points on the numerical axis, and with the other - irrational ones. Dima colored $100$ rational and $100$ irrational points, after which he erased the signatures that allowed to find out where the origin was and what the scale was. Sergey has a compass with which he can measure the distance between any two colored points $A$ and $B$, and then mark on the axis a point located at a measured distance from any colored point $C$ (left or right); at the same time, Dima immediately paints it with the appropriate felt-tip pen. How Sergei can find out what color Dima paints rational points and what color he paints irrational ones?

Show that there are infinitely many natural numbers which are simultaneously a sum of two squares and a sum of two cubes but which are not a sum of two $6-$th powers.

Determine the last digit of $5^5+6^6+7^7+8^8+9^9$.

Let $k = 2^6 \cdot 3^5 \cdot 5^2 \cdot 7^3 \cdot 53$. Let $S$ be the sum of $\frac{gcd(m,n)}{lcm(m,n)}$ over all ordered pairs of positive integers $(m, n)$ where $mn = k$. If $S$ can be written in simplest form as $\frac{r}{s}$, compute $r + s$.

Given integers $0 < a_1 < a_2 <... < a_{101} < 5050$, prove that one can always choose for different numbers $a_k,a_l,a_m,a_n$ such that $5050 | a_k +a_l -a_m -a_n$

A number is [i]special[/i] if its tens digit is $9$. For example, $499$ and $1092$ are special, but $509$ is not. Diego has several cards. On each of them, he wrote a special number (he may write the same number on more than one card). When he adds up the numbers on the cards, the total is $2024$. What is the smallest number of cards Diego can have?

Two two-digit numbers $a$ and b satisfy that the product $a \cdot b$ divides the four-digit number one gets by writing the two digits in $a$ followed by the two digits in $b$. Determine all possible values of $a$ and $b$.

Let be a sequence of $ 51 $ natural numbers whose sum is $ 100. $ Show that for any natural number $ 1\le k<100 $ there are some consecutive numbers from this sequence whose sum is $ k $ or $ 100-k. $

For positive integer $k$, let $p(k)$ denote the greatest odd divisor of $k$. Prove that for every positive integer $n$, $$\frac{2n}{3} < \frac{p(1)}{1}+ \frac{p(2)}{2}+... +\frac{ p(n)}{n}<\frac{2(n + 1)}{3}$$

For a given positive integer $n$ one has to choose positive integers $a_0, a_1,...$ so that the following conditions hold: (1) $a_i = a_{i+n}$ for any $i$, (2) $a_i$ is not divisible by $n$ for any $i$, (3) $a_{i+a_i}$ is divisible by $a_i$ for any $i$. For which positive integers $n > 1$ is this possible only if the numbers $a_0, a_1, ...$ are all equal?

A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.

Let $a,b$ and $c$ be positive integers that $$\frac{a\sqrt{3}+b}{b\sqrt3+c}$$ is a rational number, show that $$\frac{a^2+b^2+c^2}{a+b+ c}$$ is an integer. [i](Anonymous314)[/i]