Let $n\geq 3$ be a fixed positive integer. Determine the minimum possible value of \[\sum_{1\leq i<j<k\leq n} \max(x_ix_j + x_k, x_jx_k + x_i, x_kx_i + x_j)^2\]over all non-negative reals $x_1,x_2,\dots,x_n$ satisfying $x_1+x_2+\dots+x_n=n$.

Students $ A $ and $ B $ play according to the following rules: student $ A $ selects a vector $ \overrightarrow{a_1} $ of length 1 in the plane, then student $ B $ gives the number $ s_1 $, equal to $ 1 $ or $ - $1; then the student $ A $ chooses a vector $ \overrightarrow{a_1} $ of length $ 1 $, and in turn the student $ B $ gives a number $ s_2 $ equal to $ 1 $ or $ -1 $ etc. $ B $ wins if for a certain $ n $ vector $ \sum_{j=1}^n \varepsilon_j \overrightarrow{a_j} $ has a length greater than the number $ R $ determined before the start of the game. Prove that student $B$ can achieve a win in no more than $R^2 + 1$ steps regardless of partner $A$'s actions.

The positive integers from 1 to \(n\) are arranged in a sequence, initially in ascending order. In one move, we can swap the positions of two of the numbers, provided they share a common divisor greater than 1. Let \(s_n\) be the number of sequences that can be obtained with a finite number of moves. Prove that \(s_n = a_n!\), where the sequence of positive integers \((a_n)_{n\geq 1}\) is such that for any \(\delta > 0\), there exists an integer \(N\), for which for all \(n\geq N\), the following is true: \[ n - \left(\frac{1}{2}+\delta\right)\frac{n}{\log n} < a_n < n - \left(\frac{1}{2}-\delta\right)\frac{n}{\log n}. \]

Let $a$ and $b$ be given positive real numbers, with $a<b.$ If two points are selected at random from a straight line segment of length $b,$ what is the probability that the distance between them is at least $a?$

Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

A trapezoid has bases with lengths equal to $5$ and $15$ and legs with lengths equal to $13$ and $13.$ Determine the area of the trapezoid.

Let $N$ be a positive multiple of $5$. One red ball and $N$ green balls are arranged in a line in random order. Let $P(N)$ be the probability that at least $\tfrac{3}{5}$ of the green balls are on the same side of the red ball. Observe that $P(5)=1$ and that $P(N)$ approaches $\tfrac{4}{5}$ as $N$ grows large. What is the sum of the digits of the least value of $N$ such that $P(N) < \tfrac{321}{400}$? $\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) }16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$

Let $F(0)=0$, $F(1)=\frac32$, and $F(n)=\frac{5}{2}F(n-1)-F(n-2)$ for $n\ge2$. Determine whether or not $\displaystyle{\sum_{n=0}^{\infty}\, \frac{1}{F(2^n)}}$ is a rational number. (Proposed by Gerhard Woeginger, Eindhoven University of Technology)

We denote the set of nonzero integers and the set of non-negative integers with $\mathbb Z^*$ and $\mathbb N_0$, respectively. Find all functions $f:\mathbb Z^* \to \mathbb N_0$ such that: $a)$ $f(a+b)\geq min(f(a), f(b))$ for all $a,b$ in $\mathbb Z^*$ for which $a+b$ is in $\mathbb Z^*$. $b)$ $f(ab)=f(a)+f(b)$ for all $a,b$ in $\mathbb Z^*$.

In Determinant Tic-Tac-Toe, Player $1$ enters a $1$ in an empty $3 \times 3$ matrix. Player $0$ counters with a $0$ in a vacant position and play continues in turn intil the $ 3 \times 3 $ matrix is completed with five $1$’s and four $0$’s. Player $0$ wins if the determinant is $0$ and player $1$ wins otherwise. Assuming both players pursue optimal strategies, who will win and how?

Let $a, b, c,$ and $d$ be positive integers such that $\gcd(a, b)=24$, $\gcd(b, c)=36$, $\gcd(c, d)=54$, and $70<\gcd(d, a)<100$. Which of the following must be a divisor of $a$? $\textbf{(A)} \text{ 5} \qquad \textbf{(B)} \text{ 7} \qquad \textbf{(C)} \text{ 11} \qquad \textbf{(D)} \text{ 13} \qquad \textbf{(E)} \text{ 17}$

(1) For integer $n=0,\ 1,\ 2,\ \cdots$ and positive number $a_{n},$ let $f_{n}(x)=a_{n}(x-n)(n+1-x).$ Find $a_{n}$ such that the curve $y=f_{n}(x)$ touches to the curve $y=e^{-x}.$ (2) For $f_{n}(x)$ defined in (1), denote the area of the figure bounded by $y=f_{0}(x), y=e^{-x}$ and the $y$-axis by $S_{0},$ for $n\geq 1,$ the area of the figure bounded by $y=f_{n-1}(x),\ y=f_{n}(x)$ and $y=e^{-x}$ by $S_{n}.$ Find $\lim_{n\to\infty}(S_{0}+S_{1}+\cdots+S_{n}).$

Turki has divided a square into finitely many white and green rectangles, each with sides parallel to the sides of the square. Within each white rectangle, he writes down its width divided by its height. Within each green rectangle, he writes down its height divided by its width. Finally, he calculates $S$, the sum of these numbers. If the total area of white rectangles equals the total area of green rectangles, determine the minimum possible value of $S$.

Let $ I$ be incenter of triangle $ ABC$, $ M$ be midpoint of side $ BC$, and $ T$ be the intersection point of $ IM$ with incircle, in such a way that $ I$ is between $ M$ and $ T$. Prove that $ \angle BIM\minus{}\angle CIM\equal{}\frac{3}2(\angle B\minus{}\angle C)$, if and only if $ AT\perp BC$.

Right $ \triangle ABC$ has $ AB \equal{} 3$, $ BC \equal{} 4$, and $ AC \equal{} 5$. Square $ XYZW$ is inscribed in $ \triangle ABC$ with $ X$ and $ Y$ on $ \overline{AC}$, $ W$ on $ \overline{AB}$, and $ Z$ on $ \overline{BC}$. What is the side length of the square? [asy]size(200);defaultpen(fontsize(10pt)+linewidth(.8pt)); real s = (60/37); pair A = (0,0); pair C = (5,0); pair B = dir(60)*3; pair W = waypoint(B--A,(1/3)); pair X = foot(W,A,C); pair Y = (X.x + s, X.y); pair Z = (W.x + s, W.y); label("$A$",A,SW); label("$B$",B,NW); label("$C$",C,SE); label("$W$",W,NW); label("$X$",X,S); label("$Y$",Y,S); label("$Z$",Z,NE); draw(A--B--C--cycle); draw(X--W--Z--Y);[/asy] $ \textbf{(A)}\ \frac {3}{2}\qquad \textbf{(B)}\ \frac {60}{37}\qquad \textbf{(C)}\ \frac {12}{7}\qquad \textbf{(D)}\ \frac {23}{13}\qquad \textbf{(E)}\ 2$