Prove that every section of the cube $Q = {[-1,1]}^n \subset R^n$ linear k-dimensional subspace $L\subseteq R^n$ has a diameter of at least $2\sqrt k$.

Let $S$ be the set of lattice points in the coordinate plane, both of whose coordinates are integers between $1$ and $30,$ inclusive. Exactly $300$ points in $S$ lie on or below a line with equation $y=mx.$ The possible values of $m$ lie in an interval of length $\frac ab,$ where $a$ and $b$ are relatively prime positive integers. What is $a+b?$ $\textbf{(A) }31 \qquad \textbf{(B) }47 \qquad \textbf{(C) }62\qquad \textbf{(D) }72 \qquad \textbf{(E) }85$

Suppose that $x_1, x_2, x_3, . . . x_n$ are real numbers between $0$ and $ 1$ with sum $s$. Prove that $$\prod_{i=1}^{n} \frac{x_i}{s + 1 - x_i} + \prod_{i=1}^{n} (1 - x_i) \le 1.$$

Let $m$ be a positive integer for which there exists a positive integer $n$ such that the multiplication $mn$ is a perfect square and $m- n$ is prime. Find all $m$ for $1000\leq m \leq 2021.$

Let $f: N \to N$ satisfy $n=\sum_{d|n} f(d), \forall n \in N$. Then sum of all possible values of $f(100)$ is?

Prove that there exists an infinite set of points \[ \dots, \; P_{-3}, \; P_{-2},\; P_{-1},\; P_0,\; P_1,\; P_2,\; P_3,\; \dots \] in the plane with the following property: For any three distinct integers $a,b,$ and $c$, points $P_a$, $P_b$, and $P_c$ are collinear if and only if $a+b+c=2014$.

Let $ABC$ be an acute-angled triangle such that $\angle{ACB} = 45^{\circ}$. Let $G$ be the point of intersection of the three medians and let $O$ be the circumcentre. Suppose $OG=1$ and $OG \parallel BC$. Determine the length of the segment $BC$.

$a)$ Let $p$ and $q$ be distinct prime numbers such that $p+q^2$ divides $p^2+q$. Prove that $p+q^2$ divides $pq-1$. $b)$ Find all prime numbers $p$ such that $p+121$ divides $p^2+11$.

In the triangle $ABC$ it is known that$\angle A = 75^o, \angle C = 45^o$. On the ray $BC$ beyond the point $C$ the point $T$ is taken so that $BC = CT$. Let $M$ be the midpoint of the segment $AT$. Find the measure of the $\angle BMC$. (Anton Trygub)

In a tennis tournament there are participants from $n$ different countries. Each team consists of a coach and a player whom should settle in a hotel. The rooms considered for the settlement of coaches are different from players' ones. Each player wants to be in a room whose roommates are [b][u]all[/u][/b] from countries which have a defense agreement with the player's country. Conversely, each coach wants to be in a room whose roommates are [b][u]all[/u][/b] from countries which don't have a defense agreement with the coach's country. Find the minimum number of the rooms such that we can [u][b]always[/b][/u] grant everyone's desire. [i]proposed by Seyed Reza Hosseini and Mohammad Amin Ghiasi[/i]

Three disks touch pairwise from outside in the points $X,Y,Z$. Then the radiuses of the disks were expanded by $2/\sqrt3$ times, and the centres were reserved. Prove that the triangle $XYZ$ is completely covered by the expanded disks.

In the right triangle $ABC$, $AC=12$, $BC=5$, and angle $C$ is a right angle. A semicircle is inscribed in the triangle as shown. What is the radius of the semicircle? [asy] draw((0,0)--(12,0)--(12,5)--(0,0)); draw(arc((8.67,0),(12,0),(5.33,0))); label("$A$", (0,0), W); label("$C$", (12,0), E); label("$B$", (12,5), NE); label("$12$", (6, 0), S); label("$5$", (12, 2.5), E);[/asy] $\textbf{(A) }\frac{7}{6}\qquad\textbf{(B) }\frac{13}{5}\qquad\textbf{(C) }\frac{59}{18}\qquad\textbf{(D) }\frac{10}{3}\qquad\textbf{(E) }\frac{60}{13}$

For a positive integer $n$ let $P(n)$ denote the set of primes $p$ for which there exist positive integers $a, b$ such that $n=a^p+b^p$ . Is it true that for any finite set $H$ consisting of primes, there is an n such that $P(n) = H$?

Consider the sequence $x_n = 2^n-n$, $n = 0,1 ,2 ,...$. Find all integers $m \ge 0$ such that $s_m = x_0 + x_1 + x_2 + ... + x_m$ is a power of $2$.

Let $B=\{2^1,2^2,2^3,\dots,2^{21}\}.$ Find the remainder when \[ \sum_{m, n \in B: \ m<n}\gcd(m,n) \] is divided by $1000,$ where the sum is taken over all pairs of elements $(m,n)$ of $B$ such that $m<n.$

In a game of Among Us, there are $10$ players and $12$ colors. Each player has a "default" color that they will automatically get if nobody else has that color. Otherwise, they get a random color that is not selected. If $10$ random players with random default colors join a game one by one, the expected number of players to get their default color can be expressed as $\frac{m}{n}$. Compute $m+n$. Note that the default colors are not necessarily distinct. [i]Proposed by Jeff Lin[/i]

Let there be given a pyramid $SABCD$ whose base $ABCD$ is a parallelogram. Let $N$ be the midpoint of $BC$. A plane $\lambda$ intersects the lines $SC,SA,AB$ at points $P,Q,R$ respectively such that $\overline{CP}/\overline{CS}=\overline{SQ}/\overline{SA}=\overline{AR}/\overline{AB}$. A point $M$ on the line $SD$ is such that the line $MN$ is parallel to $\lambda$. Show that the locus of points $M$, when $\lambda$ takes all possible positions, is a segment of the length $\frac{\sqrt5}2SD$.

Let $a_0$ be a fixed positive integer. We define an infinite sequence of positive integers $\{a_n\}_{n\ge 1}$ in an inductive way as follows: if we are given the terms $a_0,a_1,...a_{n-1}$ , then $a_n$ is the smallest positive integer such that $\sqrt[n]{a_0\cdot a_1\cdot ...\cdot a_n}$ is a positive integer. Show that the sequence $\{a_n\}_{n\ge 1}$ is eventually constant. [b]Note:[/b] The sequence $\{a_n\}_{n\ge 1}$ is eventually constant if there exists a positive integer $k$ such that $a_n=c$, for every $n\ge k$.

Let $P$ be a polygon formed by the edges of an infinite chessboard, which does not intersect itself. Let the numbers $a_1,a_2,a_3$ represent the number of unit squares that have exactly $1,2\text{ or } 3$ edges on the boundary of $P$ respectively. Find the largest real number $k$ such that the inequality $a_1+a_2>ka_3$ holds for each polygon constructed with these conditions.

Let $\zeta= e^{2\pi i/99}$ and $\omega e^{2\pi i/101}$. The polynomial $$x^{9999} + a_{9998}x^{9998} + ...+ a_1x + a_0$$ has roots $\zeta^m + \omega^n$ for all pairs of integers $(m, n)$ with $0 \le m < 99$ and $0 \le n < 101$. Compute $a_{9799} + a_{9800} + ...+ a_{9998}$.

Find an upper bound for the ratio $$\frac{x_1x_2+2x_2x_3+x_3x_4}{x_1^2+x_2^2+x_3^2+x_4^2}$$ over all quadruples of real numbers $(x_1,x_2,x_3,x_4)\neq (0,0,0,0)$. [i]Note.[/i] The smaller the bound, the better the solution.

Let $Oxyz$ be a trihedron whose edges $x,y, z$ are mutually perpendicular. Let $C$ be the point on the ray $z$ with $OC = c$. Points $P$ and $Q$ vary on the rays $x$ and $y$ respectively in such a way that $OP+OQ = k$ is constant. For every $P$ and $Q$, the circumcenter of the sphere through $O,C,P,Q$ is denoted by $W$. Find the locus of the projection of $W$ on the plane O$xy$. Also find the locus of points $W$.

Show that $n^{\pi(2n)-\pi(n)}<4^{n}$ for all positive integer $n$.

Points $D$ and $E$ are taken on $[BC]$ and $[AC]$ of acute angled triangle $ABC$ such that $BD$ and $CE$ are angle bisectors. Projections of $D$ onto $BC$ and $BA$ are $P$ and $Q$, projections of $E$ onto $CA$ and $CB$ are $R$ and $S$. Let $AP \cap CQ=X$, $AS \cap BR=Y$ and $BX \cap CY=Z$. Show that $AZ \perp BC$.

Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$