Given real numbers $a,\alpha,\beta, \sigma \ and \ \varrho$ s.t. $\sigma, \varrho > 0$ and $\sigma \varrho = \frac{1}{16}$, prove that there exist integers $x$ and $y$ s.t. \[ - \sigma \leq (x+\alpha_(ax + y + \beta ) \leq \varrho \]

Let $a,b,c,d$ be four positive integers such that $a>b>c>d$. Given that $ab+bc+ca+d^2|(a+b)(b+c)(c+a)$. Find the minimal value of $ \Omega (ab+bc+ca+d^2)$. Here $ \Omega(n)$ denotes the number of prime factors $n$ has. e.g. $\Omega(12)=3$

Show that there exist infinitely many composite positive integers $n$ such that $n$ divides $2^{\frac{n-1}{2}}+1$

The sequence $(x_n)_{n\in N}$ satisfies $x_1 = 2015$ and $x_{n+1} =\sqrt[3]{13x_n - 18}$ for all $n \ge 1$. Determine $\lim_{n\to \infty} x_n$.

Let $p$ be a prime number. Find all triples $(a, b, c)$ of integers (not necessarily positive) such that $a^bb^cc^a = p$.

Let $n,k$ be positive integers such that $n^k>(k+1)!$ and consider the set \[ M=\{(x_1,x_2,\ldots,x_n)\dvd x_i\in\{1,2,\ldots,n\},\ i=\overline{1,k}\}. \] Prove that if $A\subset M$ has $(k+1)!+1$ elements, then there are two elements $\{\alpha,\beta\}\subset A$, $\alpha=(\alpha_1,\alpha_2,\ldots,\alpha_n)$, $\beta=(\beta_1,\beta_2,\ldots,\beta_n)$ such that \[ (k+1)! \left| (\beta_1-\alpha_1)(\beta_2-\alpha_2)\cdots (\beta_k-\alpha_k) \right. .\]

Let $T$ be a triangle with side lengths $26$, $51$, and $73$. Let $S$ be the set of points inside $T$ which do not lie within a distance of $5$ of any side of $T$. Find the area of $S$.

Let $\omega$ be the incircle of a fixed equilateral triangle $ABC$. Let $\ell$ be a variable line that is tangent to $\omega$ and meets the interior of segments $BC$ and $CA$ at points $P$ and $Q$, respectively. A point $R$ is chosen such that $PR = PA$ and $QR = QB$. Find all possible locations of the point $R$, over all choices of $\ell$. [i]Proposed by Titu Andreescu and Waldemar Pompe[/i]

2. A unit square paper has a triangle-shaped hole (vertices of the hole are not on the border of the paper). Prove that a triangle with area of $1 / 6$ can be cut from the remaining paper. Alexandr Yuran

Given is a simple graph $G$ with $2022$ vertices, such that for any subset $S$ of vertices (including the set of all vertices), there is a vertex $v$ with $deg_{S}(v) \leq 100$. Find $\chi(G)$ and the maximal number of edges $G$ can have.

Points $A$ and $B$ are given on a line having no common points with a sphere $K$. The feet $P$ of the perpendicular from the center of $K$ to the line $AB$ is positioned between $A$ and $B$, and the lengths of segments $AP$ and $BP$ both exceed the radius of $K$. Consider the set $Z$ of all triangles $ABC$ whose sides $AC$ and $BC$ are tangent to $K$. Prove that among all triangles in $Z$, a triangle $T$ with a maximum perimeter also has a maximum area.

Find all integers of the form $\frac{m-6n}{m+2n}$ where $m,n$ are nonzero rational numbers satisfying $m^3=(27n^2+1)(m+2n)$.

In triangle $ABC$, let $X$ and $Y$ be the midpoints of $AB$ and $AC$, respectively. On segment $BC$, there is a point $D$, different from its midpoint, such that $\angle{XDY}=\angle{BAC}$. Prove that $AD\perp BC$.

For every $k= 1,2, \ldots$ let $s_k$ be the number of pairs $(x,y)$ satisfying the equation $kx + (k+1)y = 1001 - k$ with $x$, $y$ non-negative integers. Find $s_1 + s_2 + \cdots + s_{200}$.

In triangle $ ABC$ points $ E$ and $ F$ lie on sides $ AC$ and $ BC$ such that segments $ AE$ and $ BF$ have equal length, and circles formed by $ A,C,F$ and by $ B,C,E,$ respectively, intersect at point $ C$ and another point $ D.$ Prove that that the line $ CD$ bisects $ \angle ACB.$

In $1960$ only $5\%$ of the working adults in Carlin City worked at home. By $1970$ the "at-home" work force increased to $8\%$. In $1980$ there were approximately $15\%$ working at home, and in $1990$ there were $30\%$. The graph that best illustrates this is [asy] unitsize(13); draw((0,4)--(0,0)--(7,0)); draw((0,1)--(.2,1)); draw((0,2)--(.2,2)); draw((0,3)--(.2,3)); draw((2,0)--(2,.2)); draw((4,0)--(4,.2)); draw((6,0)--(6,.2)); for (int a = 1; a < 4; ++a) { for (int b = 1; b < 4; ++b) { draw((2*a,b-.1)--(2*a,b+.1)); draw((2*a-.1,b)--(2*a+.1,b)); } } label("1960",(0,0),S); label("1970",(2,0),S); label("1980",(4,0),S); label("1990",(6,0),S); label("10",(0,1),W); label("20",(0,2),W); label("30",(0,3),W); label("$\%$",(0,4),N); draw((12,4)--(12,0)--(19,0)); draw((12,1)--(12.2,1)); draw((12,2)--(12.2,2)); draw((12,3)--(12.2,3)); draw((14,0)--(14,.2)); draw((16,0)--(16,.2)); draw((18,0)--(18,.2)); for (int a = 1; a < 4; ++a) { for (int b = 1; b < 4; ++b) { draw((2*a+12,b-.1)--(2*a+12,b+.1)); draw((2*a+11.9,b)--(2*a+12.1,b)); } } label("1960",(12,0),S); label("1970",(14,0),S); label("1980",(16,0),S); label("1990",(18,0),S); label("10",(12,1),W); label("20",(12,2),W); label("30",(12,3),W); label("$\%$",(12,4),N); draw((0,12)--(0,8)--(7,8)); draw((0,9)--(.2,9)); draw((0,10)--(.2,10)); draw((0,11)--(.2,11)); draw((2,8)--(2,8.2)); draw((4,8)--(4,8.2)); draw((6,8)--(6,8.2)); for (int a = 1; a < 4; ++a) { for (int b = 1; b < 4; ++b) { draw((2*a,b+7.9)--(2*a,b+8.1)); draw((2*a-.1,b+8)--(2*a+.1,b+8)); } } label("1960",(0,8),S); label("1970",(2,8),S); label("1980",(4,8),S); label("1990",(6,8),S); label("10",(0,9),W); label("20",(0,10),W); label("30",(0,11),W); label("$\%$",(0,12),N); draw((12,12)--(12,8)--(19,8)); draw((12,9)--(12.2,9)); draw((12,10)--(12.2,10)); draw((12,11)--(12.2,11)); draw((14,8)--(14,8.2)); draw((16,8)--(16,8.2)); draw((18,8)--(18,8.2)); for (int a = 1; a < 4; ++a) { for (int b = 1; b < 4; ++b) { draw((2*a+12,b+7.9)--(2*a+12,b+8.1)); draw((2*a+11.9,b+8)--(2*a+12.1,b+8)); } } label("1960",(12,8),S); label("1970",(14,8),S); label("1980",(16,8),S); label("1990",(18,8),S); label("10",(12,9),W); label("20",(12,10),W); label("30",(12,11),W); label("$\%$",(12,12),N); draw((24,12)--(24,8)--(31,8)); draw((24,9)--(24.2,9)); draw((24,10)--(24.2,10)); draw((24,11)--(24.2,11)); draw((26,8)--(26,8.2)); draw((28,8)--(28,8.2)); draw((30,8)--(30,8.2)); for (int a = 1; a < 4; ++a) { for (int b = 1; b < 4; ++b) { draw((2*a+24,b+7.9)--(2*a+24,b+8.1)); draw((2*a+23.9,b+8)--(2*a+24.1,b+8)); } } label("1960",(24,8),S); label("1970",(26,8),S); label("1980",(28,8),S); label("1990",(30,8),S); label("10",(24,9),W); label("20",(24,10),W); label("30",(24,11),W); label("$\%$",(24,12),N); draw((0,9)--(2,9.25)--(4,10)--(6,11)); draw((12,8.5)--(14,9)--(16,10)--(18,10.5)); draw((24,8.5)--(26,8.8)--(28,10.5)--(30,11)); draw((0,0.5)--(2,1)--(4,2.8)--(6,3)); draw((12,0.5)--(14,.8)--(16,1.5)--(18,3)); label("(A)",(-1,12),W); label("(B)",(11,12),W); label("(C)",(23,12),W); label("(D)",(-1,4),W); label("(E)",(11,4),W);[/asy]

Let $\mathbb R$ be the set of real numbers. Determine all functions $f:\mathbb R\to\mathbb R$ that satisfy the equation\[ f(f(x))+yf(xy+1) = f(x-f(y)) + xf(y)^2. \]for all real numbers $x$ and $y$.

Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?

Eight people are posing together in a straight line for a photo. Alice and Bob must stand next to each other, and Claire and Derek must stand next to each other. How many different ways can the eight people pose for their photo?

Two circles are given for which there is a family of quadrilaterals circumscribed around the first circle and inscribed in the second. Let's denote by $a, b, c$ and $d{}$ the consecutive lengths of the sides of one of these quadrilaterals. Prove that the sum \[\frac{a}{c}+\frac{c}{a}+\frac{b}{d}+\frac{d}{b}\]does not depend on the choice of the quadrilateral. [i]Proposed by I. Weinstein[/i]

Across all polynomials $P$ such that $P(n)$ is an integer for all integers $n$, determine, with proof, all possible values of $P(i)$, where $i^2=-1$.

Solve the system of equations: $\left\{ \begin{aligned} x^4+y^2-xy^3-\frac{9}{8}x = 0 \\ y^4+x^2-yx^3-\frac{9}{8}y=0 \end{aligned} \right.$

The equation $x^3y+xy^3+xy=0$ represents $\textbf{(A)}~\text{a circle}$ $\textbf{(B)}~\text{a circle and a pair of straight lines}$ $\textbf{(C)}~\text{a rectangular hyperbola}$ $\textbf{(D)}~\text{a pair of straight lines}$

For a convex polygon (i.e. all angles less than $180^\circ$) call a diagonal [i]bisector[/i] if its bisects both area and perimeter of the polygon. What is the maximum number of bisector diagonals for a convex pentagon? [i]Proposed by Morteza Saghafian[/i]

$13.$ At a party, each man danced with exactly four women and each woman danced with exactly three men. Nine men attended the party. How many women attended the party $?$