Determine the integers $a, b, c$ for which $$\frac{a+1}{3}=\frac{b+2}{4}=\frac{5}{c+3}$$

Determine all sequences $a_0 , a_1 , a_2 , \ldots$ of positive integers with $a_0 \ge 2015$ such that for all integers $n\ge 1$: (i) $a_{n+2}$ is divisible by $a_n$ ; (ii) $|s_{n+1} - (n + 1)a_n | = 1$, where $s_{n+1} = a_{n+1} - a_n + a_{n-1} - \cdots + (-1)^{n+1} a_0$ . [i]Proposed by Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

Find all pairs of function $ f: \mathbb{N} \rightarrow \mathbb{N}$ and polynomial with integer coefficients $ p$ such that: (i) $ p(mn) \equal{} p(m)p(n)$ for all positive integers $ m,n > 1$ with $ \gcd(m,n) \equal{} 1$, and (ii) $ \sum_{d|n}f(d) \equal{} p(n)$ for all positive integers $ n$.

Does there exist an increasing arithmetic progression of (a) $11$ (b) $10000$ (c) infinitely many positive integers such that the sums of their digits in base $10$ also form an increasing arithmetic progression? (A Shapovalov)

For what real values of $k$ do $1988x^2 + kx + 8891$ and $8891x^2 + kx + 1988$ have a common zero?

The following number is the product of the divisors of $n$. $$46, 656, 000, 000$$ What is $n$?

Suppose that $a$ and $ b$ are distinct positive integers satisfying $20a + 17b = p$ and $17a + 20b = q$ for certain primes $p$ and $ q$. Determine the minimum value of $p + q$.

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]

Let $a_1, a_2, . . . , a_n$ be positive integers, with $n \ge 2$, such that $$ \lfloor \sqrt{a_1 \cdot a_2\cdot\cdot\cdot a_n} \rfloor = \lfloor \sqrt{a_1} \rfloor \cdot \lfloor \sqrt{a_2} \rfloor \cdot\cdot\cdot \lfloor \sqrt{a_n} \rfloor.$$ Prove that at least $n - 1$ of these numbers are perfect squares. Clarification: Given a real number $x$, $\lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$. For example $\lfloor \sqrt2\rfloor$ and $\lfloor 3\rfloor =3$.

Let's call a pair of positive integers $\overline{a_1a_2\ldots a_k}$ and $\overline{b_1b_2\ldots b_k}$ $k$-similar if all digits $a_1, a_2, \ldots, a_k , b_1 , b_2, \ldots, b_k$ are distinct, and there exist distinct positive integers $m, n$, for which the following equality holds: $$a_1^m + a_2^m + \ldots + a_k^m = b_1^n + b_2^n + \ldots + b_k^n$$ For which largest $k$ do there exist $k$-similar numbers? [i]Proposed by Oleksiy Masalitin[/i]

How many distinct ordered pairs of integers $(b, m, t)$ satisfy the equation $b^8+m^4+t^2+1 = 2019$?

What are the last two digits of $$2003^{{2005}^{{2007}^{2009}}}$$ , where $a^{b{^c}}$ means $a^{(b^c)}$?

Given the endless arithmetic progression with the positive integer members. One of those is an exact square. Prove that the progression contain the infinite number of the exact squares.

Let $n$ be a positive integer. Find, with proof, the least positive integer $d_{n}$ which cannot be expressed in the form \[\sum_{i=1}^{n}(-1)^{a_{i}}2^{b_{i}},\] where $a_{i}$ and $b_{i}$ are nonnegative integers for each $i.$

Are there any integers $a,b$ and $c$, not all of them $0$, such that $$a^2=2021b^2+2022c^2~~?$$ [i] (Cosmin Gavrilă)[/i]

Does there exist a number $n=\overline{a_1a_2a_3a_4a_5a_6}$ such that $\overline{a_1a_2a_3}+4 = \overline{a_4a_5a_6}$ (all bases are $10$) and $n=a^k$ for some positive integers $a,k$ with $k \geq 3 \ ?$

Let $n_1 = \overline{abcabc}$ and $n_2= \overline{d00d}$ be numbers represented in the decimal system, with $a\ne 0$ and $d \ne 0$. a) Prove that $\sqrt{n_1}$ cannot be an integer. b) Find all positive integers $n_1$ and $n_2$ such that $\sqrt{n_1+n_2}$ is an integer number. c) From all the pairs $(n_1,n_2)$ such that $\sqrt{n_1 n_2}$ is an integer find those for which $\sqrt{n_1 n_2}$ has the greatest possible value

Prove that there do not exist eleven primes, all less than $20000$, which form an arithmetic progression.

Find all solutions of the system of equations $\begin{cases} s(x) + s(y) = x \\ x + y + s(z) = z \\ s(x) + s(y) + s(z) = y - 4 \end{cases}$ where $x, y$, and $z$ are positive integers, and $s(x), s(y)$, and $s(z)$ are the numbers of digits in the decimal representations of $x, y$, and $z$, respectively.

$S$ is natural, and $S=d_{1}>d_2>...>d_{1000000}=1$ are all divisors of $S$. What minimal number of divisors can have $d_{250}$?

Find all pairs of integers $(c, d)$, both greater than 1, such that the following holds: For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p > c(2c+1)$, there exists a set $S$ of at most $\big(\tfrac{2c-1}{2c+1}\big)p$ integers, such that \[\bigcup_{s \in S} \{s,\; Q(s),\; Q(Q(s)),\; Q(Q(Q(s))),\; \dots\}\] contains a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$).

Given a polynomial with integer coefficents with degree $n>0:$$$P(x)=a_nx^n+...+a_1x+a_0.$$ Assume that there exists a prime number $p$ satisfying these conditions: [i]i)[/i] $p|a_i$ for all $0\le i<n,$ [i]ii)[/i] $p\nmid a_n,$ [i]iii)[/i] $p^2\nmid a_0.$ Prove that $P(x)$ is irreducible in $\mathbb{Z}[x].$

Circle $\omega_1$ with radius $6$ centered at point $A$ is internally tangent at point $B$ to circle $\omega_2$ with radius $15$. Points $C$ and $D$ lie on $\omega_2$ such that $\overline{BC}$ is a diameter of $\omega_2$ and $\overline{BC} \perp \overline{AD}$. The rectangle $EFGH$ is inscribed in $\omega_1$ such that $\overline{EF} \perp \overline{BC}$, $C$ is closer to $\overline{GH}$ than to $\overline{EF}$, and $D$ is closer to $\overline{FG}$ than to $\overline{EH}$, as shown. Triangles $\triangle DGF$ and $\triangle CHG$ have equal areas. The area of rectangle $EFGH$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(5cm); defaultpen(fontsize(10pt)); pair A = (9, 0), B = (15, 0), C = (-15, 0), D = (9, 12), E = (9+12/sqrt(5), -6/sqrt(5)), F = (9+12/sqrt(5), 6/sqrt(5)), G = (9-12/sqrt(5), 6/sqrt(5)), H = (9-12/sqrt(5), -6/sqrt(5)); filldraw(G--H--C--cycle, lightgray); filldraw(D--G--F--cycle, lightgray); draw(B--C); draw(A--D); draw(E--F--G--H--cycle); draw(circle(origin, 15)); draw(circle(A, 6)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); label("$A$", A, (.8, -.8)); label("$B$", B, (.8, 0)); label("$C$", C, (-.8, 0)); label("$D$", D, (.4, .8)); label("$E$", E, (.8, -.8)); label("$F$", F, (.8, .8)); label("$G$", G, (-.8, .8)); label("$H$", H, (-.8, -.8)); label("$\omega_1$", (9, -5)); label("$\omega_2$", (-1, -13.5)); [/asy]

Find the minimal $N$ such that any $N$-element subset of $\{1, 2, 3, 4,...,7\}$ has a subset $S$ such that the sum of elements of $S$ is divisible by $7$.

The number $2^{29}$ has a $9$-digit decimal representation that contains all but one of the $10$ (decimal) digits. Determine which digit is missing