Evaluate $$\frac{(2 + 2)^2}{2^2} \cdot \frac{(3 + 3 + 3 + 3)^3}{(3 + 3 + 3)^3} \cdot \frac{(6 + 6 + 6 + 6 + 6 + 6)^6}{(6 + 6 + 6 + 6)^6}$$

For a positive integer $n$, let $\tau(n)$ and $\sigma(n)$ be the number of positive divisors of $n$ and the sum of positive divisors of $n$, respectively. let $a$ and $b$ be positive integers such that $\sigma(a^n)$ divides $\sigma(b^n)$ for all $n\in \mathbb{N}$. Prove that each prime factor of $\tau(a)$ divides $\tau(b)$. Proposed by MohammadAmin Sharifi

Adeline, Bonnie, and Cathy are walking along a long flat path, with their initial distances shown below. [asy] size(10cm); draw((0,0)--(12,0)--(28,0)); label("Adeline",(0,1)); label("Bonnie",(12,1)); label("Cathy",(28,1)); label("12 miles",(6,-1)); label("16 miles",(20,-1)); dot((0,0)); dot((12,0)); dot((28,0)); [/asy] Adeline and Bonnie walk towards each other at constant speeds of $1$ and $2$ miles per hour, respectively. Cathy walks in the same direction as Bonnie. If all three girls meet each other at the same time, what is Cathy's walking speed, in miles per hour? $\textbf{(A) } 4~\text{mph}\qquad\textbf{(B) } 4.5~\text{mph}\qquad\textbf{(C) } 5~\text{mph}\qquad\textbf{(D) } 5.5~\text{mph}\qquad\textbf{(E) } 6~\text{mph}$

The sequence $ (x_n)$ of real numbers is defined by $ x_1\equal{}\frac{29}{10}$ and $ x_{n\plus{}1}\equal{}\frac{x_n}{\sqrt{x_n^2\minus{}1}}\plus{}\sqrt{3}$ for all $ n\ge 1$. Find a real number $ a$ (if exists) such that $ x_{2k\minus{}1}>a>x_{2k}$.

Does there exist a sequence of positive integers $a_1,a_2,...$ such that every positive integer occurs exactly once and that the number $\tau (na_{n+1}^n+(n+1)a_n^{n+1})$ is divisible by $n$ for all positive integer. Here $\tau (n)$ denotes the number of positive divisor of $n$.

There are $9$ points arranged in a $3\times 3$ square grid. Let two points be adjacent if the distance between them is half the side length of the grid. (There should be $12$ pairs of adjacent points). Suppose that we wanted to connect $8$ pairs of adjacent points, such that all points are connected to each other. In how many ways is this possible? [i]Proposed by Kevin You[/i]

Given a prime number $n \ge 5$. Prove that for any natural number $a \le \frac{n}{2} $, we can search for natural number $b \le \frac{n}{2}$ so the number of non-negative integer solutions $(x, y)$ of the equation $ax+by=n$ to be odd*. Clarification: * For example when $n = 7, a = 3$, we can choose$ b = 1$ so that there number of solutions og $3x + y = 7$ to be $3$ (odd), namely: $(0, 7), (1, 4), (2, 1)$

A box contains $900$ cards, labeled from $100$ to $999$. Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?

Let $ABC$ be a right triangle with right angle at $B$. Let $ACDE$ be a square drawn exterior to triangle $ABC$. If $M$ is the center of this square, find the measure of $\angle MBC$.

A plane is cut into unit squares, which are then colored in $n$ colors. A polygon $P$ is created from $n$ unit squares that are connected by their sides. It is known that any cell polygon created by $P$ with translation, covers $n$ unit squares in different colors. Prove that the plane can be covered with copies of $P$ so that each cell is covered exactly once.

Suppose we have $w < x < y < z$, and each of the $6$ pairwise sums are distinct. The $4$ greatest sums are $4, 3, 2, 1$. What is the sum of all possible values of $w$?

Let be two complex numbers $ a,b. $ Show that the following affirmations are equivalent: $ \text{(i)} $ there are four numbers $ x_1,x_2,x_3,x_4\in\mathbb{C} $ such that $ \big| x_1 \big| =\big| x_3 \big|, \big| x_2 \big| =\big| x_4 \big|, $ and $$ x_{j_1}^2-ax_{j_1}+b=0=x_{j_2}^2-bx_{j_2}+a,\quad\forall j_1\in\{ 1,2\} ,\quad\forall j_2\in\{ 3,4\} . $$ $ \text{(ii)} a^3=b^3 $ or $ b=\overline{a} $ (the conjugate of a).

Bisector $AL$ is drawn in an acute triangle $ABC$. On the line $LA$ beyond the point $A$, the point K is chosen with $AK = AL$. Circumcirles of triangles $BLK$ and $CLK$ intersect segments $AC$ and $AB$ at points $P$ and $Q$ respectively. Prove that lines $PQ$ and $BC$ are parallel.

Let $n$ be a positive integer and $a_1\le a_2\le\ldots\le a_{n+1}$ and $b_1\le b_2\le\ldots\le b_n$ be real numbers such that for all $k\le n$, \[\binom nk\sum_{\substack{1\le i_1<i_2<\ldots<i_k\le n+1,\\i_1,i_2,\ldots,i_k\in\mathbb N}}a_{i_1}a_{i_2}\ldots a_{i_k} = \binom{n+1}k\sum_{\substack{1\le j_1<j_2<\ldots<j_k\le n,\\j_1,j_2,\ldots,j_k\in\mathbb N}}b_{j_1}b_{j_2}\ldots b_{j_k}.\] Show that \[a_1\le b_1\le a_2\le b_2\le \ldots \le a_n\le b_n\le a_{n+1}.\] [i](Proposed by Ivan Chan Guan Yu)[/i]

Show that for all $n \in \mathbb{N}$, \[n = \sum^{}_{d \vert n}\phi(d).\]

Suppose $A_1,A_2,\cdots ,A_n \subseteq \left \{ 1,2,\cdots ,2018 \right \}$ and $\left | A_i \right |=2, i=1,2,\cdots ,n$, satisfying that $$A_i + A_j, \; 1 \le i \le j \le n ,$$ are distinct from each other. $A + B = \left \{ a+b|a\in A,\,b\in B \right \}$. Determine the maximal value of $n$.

Let $a_1, a_2, \dots, a_n$ be a sequence of real numbers, and let $m$ be a fixed positive integer less than $n$. We say an index $k$ with $1\le k\le n$ is good if there exists some $\ell$ with $1\le \ell \le m$ such that $a_k+a_{k+1}+...+a_{k+\ell-1}\ge0$, where the indices are taken modulo $n$. Let $T$ be the set of all good indices. Prove that $\sum\limits_{k \in T}a_k \ge 0$. [i]Proposed by Mark Sellke[/i]

There're two positive inegers $a_1<a_2$. For every positive integer $n \geq 3$ let $a_n$ be the smallest integer that bigger than $a_{n-1}$ and such that there's unique pair $1\leq i< j\leq n-1$ such that this number equals to $a_i+a_j$. Given that there're finitely many even numbers in this sequence. Prove that sequence $\{a_{n+1}-a_n \}$ is periodic starting from some element.

Let $A$ and $B$ be finite sets of real numbers and let $x$ be an element of $A+B$. Prove that \[|A\cap (x-B)|\leq \frac{|A-B|^2}{|A+B|}\] where $A+B=\{a+b: a\in A, b\in B\}$, $x-B=\{x-b: b\in B\}$ and $A-B=\{a-b: a\in A, b\in B\}$.

Solve in the real numbers the equation $ (n+1)^x+(n+3)^x+\left( n^2+2n\right)^x=n^x+(n+2)^x+\left( n^2+4n+3\right)^x, $ wher $ n\ge 2 $ is a fixed natural number.

In triangle $ABC$, the angle bisectors are $BE$ and $CF$ (where $E, F$ are on the sides of the triangle), and their intersection point is $I$. Point $N$ lies on the circumcircle of $AEF$, and the angle $\angle IAN$ is right. The circumcircle of $AEF$ meets the line $NI$ a second time at the point $L$. Show that the circumcenter of $AIL$ lies on line $BC$.

Can a square be divided into $10$ pairwise non-congruent triangles with the same area?

Consider $n$ persons, each of them speaking at most $3$ languages. From any $3$ persons there are at least two which speak a common language. i) For $n \le 8$, exhibit an example in which no language is spoken by more than two persons. ii) For $n \ge 9$, prove that there exists a language which is spoken by at least three persons

In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?

Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.