Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^{5}$, no three of which are consecutive terms of an arithmetic progression?

Let $ a,b,c,d $ be four non-negative reals such that $ a+b+c+d = 4 $. Prove that $$ a\sqrt{3a+b+c}+b\sqrt{3b+c+d}+c\sqrt{3c+d+a}+d\sqrt{3d+a+b} \ge 4\sqrt{5} $$

Find all pairs of solutions $(x,y)$: \[ x^3 + x^2y + xy^2 + y^3 = 8(x^2 + xy + y^2 + 1). \]

On a blank paper there were drawn two perpendicular axes $x$ and $y$ with the same scale. The graph of a function $y=f(x)$ was drawn in this coordinate system. Then the $y$ axis and all the scale marks on the $x$ axis were erased. Provide a way how to draw again the $y$ axis using pencil, ruler and compass: (a) $f(x)= 3^x$; (b) $f(x)= \log_a x$, where $a>1$ is an unknown number.

Decide if there are ten natural and distinct numbers $a_1,a_2,\ldots ,a_{10}$ such that: $\bullet$ Each of them is a power of a natural number with a natural exponent and greater than $1$. $\bullet$ The numbers $a_1,a_2,\ldots ,a_{10}$ form an arithmetic progression.

In quadrilateral $ABCD$ sides $AD$ and $BC$ aren't parallel. Diagonals $AC$ and $BD$ intersect in $E$. $F$ and $G$ are points on sides $AB$ and $DC$ such $\frac{AF}{FB}=\frac{DG}{GC}=\frac{AD}{BC}$ Prove that if $E, F, G$ are collinear then $ABCD$ is cyclic.

Prove that there exist $C>0$, which satisfies the following conclusion: For any infinite positive arithmetic integer sequence $a_1, a_2, a_3,\cdots$, if the greatest common divisor of $a_1$ and $a_2$ is squarefree, then there exists a positive integer $m\le C\cdot {a_2}^2$, such that $a_m$ is squarefree. Note: A positive integer $N$ is squarefree if it is not divisible by any square number greater than $1$. [i]Proposed by Qu Zhenhua[/i]

Let $p_n$ be the $n$-th prime, so that $p_1 = 2, p_2 = 3,...$ and define $$X_n = \{0\} \cup \{p_1,...,p_n\}$$ for each positive integer $n$. Find all $n$ for which there exist $A,B \subseteq N$ such that$ |A|,|B| \ge 2$ and $$X_n = A + B$$, where $A + B :=\{a + b : a \in A; b \in B \}$ and $N := \{0,1, 2,...\}$. (Salvatore Tringali)

Find the minimum possible least common multiple of twenty natural numbers whose sum is $801$.

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

A concrete sewer pipe fitting is shaped like a cylinder with diameter $48$ with a cone on top. A cylindrical hole of diameter $30$ is bored all the way through the center of the fitting as shown. The cylindrical portion has height $60$ while the conical top portion has height $20$. Find $N$ such that the volume of the concrete is $N \pi$. [asy] import three; size(250); defaultpen(linewidth(0.7)+fontsize(10)); pen dashes = linewidth(0.7) + linetype("2 2"); currentprojection = orthographic(0,-15,5); draw(circle((0,0,0), 15),dashes); draw(circle((0,0,80), 15)); draw(scale3(24)*((-1,0,0)..(0,-1,0)..(1,0,0))); draw(shift((0,0,60))*scale3(24)*((-1,0,0)..(0,-1,0)..(1,0,0))); draw((-24,0,0)--(-24,0,60)--(-15,0,80)); draw((24,0,0)--(24,0,60)--(15,0,80)); draw((-15,0,0)--(-15,0,80),dashes); draw((15,0,0)--(15,0,80),dashes); draw("48", (-24,0,-20)--(24,0,-20)); draw((-15,0,-20)--(-15,0,-17)); draw((15,0,-20)--(15,0,-17)); label("30", (0,0,-15)); draw("60", (50,0,0)--(50,0,60)); draw("20", (50,0,60)--(50,0,80)); draw((50,0,60)--(47,0,60));[/asy]

$f(x)$ is square polynomial and $a \neq b$ such that $f(a)=b,f(b)=a$. Prove that there is not other pair $(c,d)$ that $f(c)=d,f(d)=c$

An integer $n > 1$ and a prime $p$ are such that $n$ divides $p-1$, and $p$ divides $n^3 - 1$. Prove that $4p - 3$ is a perfect square.

Professor Piraldo takes part in soccer matches with a lot of goals and judges a match in his own peculiar way. A match with score of $m$ goals to $n$ goals, $m\geq n$, is [i]tough[/i] when $m\leq f(n)$, where $f(n)$ is defined by $f(0) = 0$ and, for $n \geq 1$, $f(n) = 2n-f(r)+r$, where $r$ is the largest integer such that $r < n$ and $f(r) \leq n$. Let $\phi ={1+\sqrt 5\over 2}$. Prove that a match with score of $m$ goals to $n$, $m\geq n$, is tough if $m\leq \phi n$ and is not tough if $m \geq \phi n+1$.

In a round-robin basketball tournament, each basketball team plays every other basketball team exactly once. If there are $20$ basketball teams, what is the greatest number of basketball teams that could have at least $16$ wins after the tournament is completed? [i]Proposed by James Lin[/i]

Let $a,b,c\in\mathbb R^{n}, a+b+c=0$ and $\lambda>0$. Prove that \[\prod_{cycle}\frac{|a|+|b|+(2\lambda+1)|c|}{|a|+|b|+|c|}\geq(2\lambda+3)^{3}\]