(a) Prove that in the set $ S=\{2008,2009,. . .,4200\}$ there are $ 5^3$ elements such that any three of them are not in arithmetic progression. (b) Bonus: Try to find a smaller integer $ n \in (2008,4200)$ such that in the set $ S'=\{2008,2009,...,n\}$ there are $ 5^3$ elements such that any three of them are not in arithmetic progression.

[b]Determine all four digit numbers [/b]$\bar{a}\bar{b}\bar{c}\bar{d}$[b] such that[/b] $$a(a+b+c+d)(a^{2}+b^{2}+c^{2}+d^{2})(a^{6}+2b^{6}+3c^{6}+4d^{6})=\bar{a}\bar{b}\bar{c}\bar{d}$$

Let $p$, $q$, and $r$ be distinct positive prime numbers. Show that if \[pqr\mid (pq)^r+(qr)^p+(rp)^q-1,\] then \[(pqr)^3\mid 3((pq)^r+(qr)^p+(rp)^q-1).\]

Find all functions $f:\mathbb{Z}^+\rightarrow \mathbb{Z}^+$ satisfying $$m!!+n!!\mid f(m)!!+f(n)!!$$for each $m,n\in \mathbb{Z}^+$, where $n!!=(n!)!$ for all $n\in \mathbb{Z}^+$. [i]Proposed by DVDthe1st[/i]

Of all functions $h : Z_{>0} \to Z_{\ge 0}$, choose one satisfying $h(ab) = ah(b) + bh(a)$ for all $a, b \in Z_{>0}$ and $h(p) = p$ for all prime numbers $p$. Find the sum of all positive integers $n\le 100$ such that $h(n) = 4n$.

Let $p$ and $q$ be prime numbers. Show that $p^2+q^2+2020$ is composite.

Let $A$ be the sum of the first $2k+1$ positive odd integers, and let $B$ be the sum of the first $2k+1$ positive even integers. Show that $A+B$ is a multiple of $4k+3$.

Let $z$ be a positive integer that is not divisible by $8$. Furthermore, let $n \geqslant 2$ be a positive integer. Prove that none of the numbers of the form $z^n + z + 1$ is a square number. [i](Walther Janous)[/i]

Given odd prime $p$. Sequence ${x_n}$ is defined by $x_{n+2}= 4x_{n+1}-x_n$. Choose $x_0,x_1$ such that for every random positive integer $k$, there exists $i\in \mathbb N$ such that $4p^2-8p+1|x_i - (2p)^k$.

Let $q(n)$ denote the sum of the digits of a natural number $n$. Determine $q(q(q(2000^{2000})))$.

Let $a$ be a positive number, and we show decimal part of the $a$ with $\left\{a\right\}$.For a positive number $x$ with $\sqrt 2< x <\sqrt 3$ such that, $\left\{\frac{1}{x}\right\}$=$\left\{x^2\right\}$.Find value of the $$x(x^7-21)$$

Let $d_1,d_2,\ldots,d_k$ be all factors of a positive integer $n$ including $1$ and $n$. If $d_1+d_2+\ldots+d_k=72$ then $\frac1{d_1}+\frac1{d_2}+\ldots+\frac1{d_k}$ is $\textbf{(A)}~\frac{k^2}{72}$ $\textbf{(B)}~\frac{72}k$ $\textbf{(C)}~\frac{72}n$ $\textbf{(D)}~\text{None of the above}$

Let $s,t$ be given nonzero integers, $(x,y)$ be any (ordered) pair of integers. A sequence of moves is performed as follows: per move $(x,y)$ changes to $(x+t, y-s)$. The pair (x,y) is said to be [i]good [/i] if after some (may be, zero) number of moves described a pair of integers arises that are not relatively prime. a) Determine whether $(s,t)$ is itself a good pair; bj Prove that for any nonzero $s$ and $t$ there is a pair $(x,y)$ which is not good.

Determine all integer solutions $(x, y)$ of the equation \[(x - 1)x(x + 1) + (y - 1)y(y + 1) = 24 - 9xy\mbox{.}\]

[b]7.1[/b] Given a convex $n$-gon all of whose angles are obtuse. Prove that the sum of the lengths of the diagonals in it is greater than the sum of the lengths of the sides. [b]7.2[/b] Find all integer values for $x$ and $y$ such that $x^4 + 4y^4$ is a prime number[b]. (typo corrected)[/b] [b]7.3.[/b] Given a triangle $ABC$. Parallelograms $ABKL$, $BCMN$ and $ACFG$ are constructed on the sides, Prove that the segments $KN$, $MF$ and $GL$ can form a triangle. [img]https://cdn.artofproblemsolving.com/attachments/a/f/7a0264b62754fafe4d559dea85c67c842011fc.png[/img] [b]7.4 / 6.2[/b] Prove that a $10 \times 10$ chessboard cannot be covered with $ 25$ figures like [img]https://cdn.artofproblemsolving.com/attachments/0/4/89aafe1194628332ec13ad1c713bb35cbefff7.png[/img]. [b]7.5[/b] Find the greatest number of different natural numbers, each of which is less than $50$, and every two of which are coprime. [b]7.6.[/b] Given a triangle $ABC$.$ D$ and $E$ are the midpoints of the sides $AB$ and $BC$. Point$ M$ lies on $AC$ , $ME > EC$. Prove that $MD < AD$. [img]https://cdn.artofproblemsolving.com/attachments/e/c/1dd901e0121e5c75a4039d21b954beb43dc547.png[/img] PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983461_1964_leningrad_math_olympiad]here[/url].

Find the sum of all $4$-digit numbers using the digits $2,3,4,5,6$ without a repetition of any of those digits.

[u]Round 1[/u] [b]p1.[/b] At a fortune-telling exam, $13$ witches are sitting in a circle. To pass the exam, a witch must correctly predict, for everybody except herself and her two neighbors, whether they will pass or fail. Each witch predicts that each of the $10$ witches she is asked about will fail. How many witches could pass? [b]p2.[/b] Out of $152$ coins, $7$ are counterfeit. All counterfeit coins have the same weight, and all real coins have the same weight, but counterfeit coins are lighter than real coins. How can you find $19$ real coins if you are allowed to use a balance scale three times? [b]p3.[/b] The digits of a number $N$ increase from left to right. What could the sum of the digits of $9 \times N$ be? [b]p4.[/b] The sides and diagonals of a pentagon are colored either blue or red. You can choose three vertices and flip the colors of all three lines that join them. Can every possible coloring be turned all blue by a sequence of such moves? [img]https://cdn.artofproblemsolving.com/attachments/5/a/644aa7dd995681fc1c813b41269f904283997b.png[/img] [b]p5.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake and call that number $N$. Pick up the stack of the top $N$ pancakes and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [u]Round 2[/u] [b]p6.[/b] A circus owner will arrange $100$ fleas on a long string of beads, each flea on her own bead. Once arranged, the fleas start jumping using the following rules. Every second, each flea chooses the closest bead occupied by one or more of the other fleas, and then all fleas jump simultaneously to their chosen beads. If there are two places where a flea could jump, she jumps to the right. At the start, the circus owner arranged the fleas so that, after some time, they all gather on just two beads. What is the shortest amount of time it could take for this to happen? [b]p7.[/b] The faraway land of Noetheria has $2016$ cities. There is a nonstop flight between every pair of cities. The price of a nonstop ticket is the same in both directions, but flights between different pairs of cities have different prices. Prove that you can plan a route of $2015$ consecutive flights so that each flight is cheaper than the previous one. It is permissible to visit the same city several times along the way. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$

Given are 100 different positive integers. We call a pair of numbers [i]good[/i] if the ratio of these numbers is either 2 or 3. What is the maximum number of good pairs that these 100 numbers can form? (A number can be used in several pairs.) [i]Proposed by Alexander S. Golovanov, Russia[/i]

Let $n$ be a given positive integer. Prove that there are infinitely many pairs of positive integers $(a, b)$ with $a, b > n$ such that $$\prod_{i=1}^{2015} (a + i) | b(b + 2016), \prod_{i=1}^{2015}(a + i) \nmid b, \prod_{i=1}^{2015} (a + i)\mid (b + 2016)$$.

Given an integer $a>1$. Prove that there exists a sequence of positive integers \[ n_1, n_2, n_3, \ldots \] Such that \[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.

For $n\ge 2$, find the number of integers $x$ with $0\le x<n$, such that $x^2$ leaves a remainder of $1$ when divided by $n$.

Let $a, b \ge 2$ be positive integers with $gcd (a, b) = 1$. Let $r$ be the smallest positive value that $\frac{a}{b}- \frac{c}{d}$ can take, where $c$ and $d$ are positive integers satisfying $c \le a$ and $d \le b$. Prove that $\frac{1}{r}$ is an integer.

Find all positive integers $k$ such that there exists positive integers $a, b$ such that \[a^2+4=(k^2-4)b^2.\]

For a positive integer $n$, let $A_n$ be the set of all positive numbers greater than $1$ and less than $n$ which are coprime to $n$. Find all $n$ such that all the elements of $A_n$ are prime numbers.