Given an integer $n \ge 2$ ,determine the numbers that written in the form $a_1$$a_2$$+$$a_2$$a_3$$+$$...$$a_{k-1}$$a_k$ , where $k$ is an integer greater than or equal to 2, and $a_1$ ,... $a_k$ are positive integers with sum $n$.

Given a prime $p$, show that there exist two integers $a, b$ which satisfies the following. For all integers $m$, $m^3+ 2017am+b$ is not a multiple of $p$.

Let $a_1 \leq a_2 \leq \cdots$ be a non-decreasing sequence of positive integers. A positive integer $n$ is called [i]good[/i] if there is an index $i$ such that $n=\dfrac{i}{a_i}$. Prove that if $2013$ is [i]good[/i], then so is $20$.

A positive integer is called [i]superprime[/i] if the difference between any two of its consecutive positive divisors is a prime number. Determine all superprime integers. [i]Authored by Nikola Velov[/i]

Find the natural numbers $ n\ge 2 $ which have the property that the ring of integers modulo $ n $ has exactly an element that is not a sum of two squares.

Let $a$ be an odd digit and $b$ an even digit. Prove that for every positive integer $n$ there exists a positive integer, divisible by $2^n$, whose decimal representation contains no digits other than $a$ and $b$.

A sequence of positive integers $a_0, a_1, a_2, \dots$ satisfies $a_0 = 83$ and $a_n = (a_{n-1})^{a_{n-1}}$ for all positive integers $n$. Compute the remainder when $a_{2021}$ is divided by $60$.

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Two rational numbers \(\tfrac{m}{n}\) and \(\tfrac{n}{m}\) are written on a blackboard, where \(m\) and \(n\) are relatively prime positive integers. At any point, Evan may pick two of the numbers \(x\) and \(y\) written on the board and write either their arithmetic mean \(\tfrac{x+y}{2}\) or their harmonic mean \(\tfrac{2xy}{x+y}\) on the board as well. Find all pairs \((m,n)\) such that Evan can write 1 on the board in finitely many steps. [i]Proposed by Yannick Yao[/i]

Prove that for every odd positive integer $n$ the number $n^n-n$ is divisible by $24$.

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

Prove: If the sum of all positive divisors of $ n \in \mathbb{Z}^{\plus{}}$ is a power of two, then the number/amount of the divisors is a power of two.

Let $a,b,c$ be non negative integers. Suppose that $c$ is even and $a^5+4b^5=c^5$. Prove that $b=0$.

A triple $(x,y,z)$ of real numbers is called a [i]superparticular[/i] if $$\frac{x+1}{x} \cdot \frac{y+1}{y}=\frac{z+1}{z}$$ Find all superparticular positive integer triples.

Prove that among any $k + 1$ natural numbers there are two numbers whose difference is divisible by $k$.

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

The $53$-digit number $$37,984,318,966,591,152,105,649,545,470,741,788,308,402,068,827,142,719$$ can be expressed as $n^21$ where $n$ is a positive integer. Find $n$.

How many integers in the set $\{1, 2 ,..., 2010\}$ divide $5^{2010!}- 3^{2010!}$?

Find all positive integers $a, b,c$ greater than $1$, such that $ab + 1$ is divisible by $c, bc + 1$ is divisible by $a$ and $ca + 1$ is divisible by $b$.

Let $s(n)$ be the sum of all positive divisors of $n$, so $s(6) = 12$. We say $n$ is almost perfect if $s(n) = 2n - 1$. Let $\mod(n, k)$ denote the residue of $n$ modulo $k$ (in other words, the remainder of dividing $n$ by $k$). Put $t(n) = \mod(n, 1) + \mod(n, 2) + \cdots + \mod(n, n)$. Show that $n$ is almost perfect if and only if $t(n) = t(n-1)$.

Given an arbitrary prime $p>2011$. Prove that there exist positive integers $a, b, c$ not all divisible by $p$ such that for all positive integers $n$ that $p\mid n^4- 2n^2+ 9$, we have $p\mid 24an^2 + 5bn + 2011c$.

Find the smallest prime $p$ for which there exist positive integers $a,b$ such that \[ a^{2} + p^{3} = b^{4}. \]

Prove that, for any integer $x$, $x^2 +5x+16$ is not divisible by $169$.

[b]7.1[/b] Construct a trapezoid given four sides. [b]7.2[/b] Prove that $$(1 + x + x^2 + ...+ x^{100})(1 + x^{102}) - 102x^{101} \ge 0 .$$ [b]7.3 [/b] In a quadrilateral $ABCD$, $M$ is the midpoint of AB, $N$ is the midpoint of $CD$. Lines $AD$ and BC intersect $MN$ at points $P$ and $Q$, respectively. Prove that if $\angle BQM = \angle APM$ , then $BC=AD$. [img]https://cdn.artofproblemsolving.com/attachments/a/2/1c3cbc62ee570a823b5f3f8d046da9fbb4b0f2.png[/img] [b]7.4 / 6.4[/b] Each of the eight given different natural numbers less than $16$. Prove that among their pairwise differences there is at least at least three are the same. [b]7.5 / 8.4[/b] An entire arc of circle is drawn through the vertices $A$ and $C$ of the rectangle $ABCD$ lying inside the rectangle. Draw a line parallel to $AB$ intersecting $BC$ at point $P$, $AD$ at point $Q$, and the arc $AC$ at point $R$ so that the sum of the areas of the figures $AQR$ and $CPR$ is the smallest. [img]https://cdn.artofproblemsolving.com/attachments/1/4/9b5a594f82a96d7eff750e15ca6801a5fc0bf1.png[/img] [b]7.6 / 6.5 [/b]The distance AB is 100 km. From A and B , cyclists simultaneously ride towards each other at speeds of 20 km/h and 30 km/hour accordingly. Together with the first A, a fly flies out with speed 50 km/h, she flies until she meets the cyclist from B, after which she turns around and flies back until she meets the cyclist from A, after which turns around, etc. How many kilometers will the fly fly in the direction from A to B until the cyclists meet? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988083_1967_leningrad_math_olympiad]here[/url].

Consider the sequence of natural numbers $a_n$ defined as $a_0=4$ and $a_{n+1}=\frac{a_n(a_n-1)}{2}$ for each $n\geq 0$. Define a new sequence $b_n$ as follows: $b_n=0$ if $a_n$ is even, and $b_n=1$ if $a_n$ is odd. Prove that for each natural $m$, the sequence \[b_m, b_{m+1}, b_{m+2},b_{m+3}, \dots\] is not periodic.