[color=darkred]A row of a matrix belonging to $\mathcal{M}_n(\mathbb{C})$ is said to be [i]permutable[/i] if no matter how we would permute the entries of that row, the value of the determinant doesn't change. Prove that if a matrix has two [i]permutable[/i] rows, then its determinant is equal to $0$ .[/color]

For how many nonempty subsets $S \subseteq \{1, 2, \ldots , 10\}$ is the sum of all elements in $S$ even? [i]Proposed by Andrew Wen[/i]

Let $n$ be a positive integer. We are given a $2n \times 2n$ table. Each cell is coloured with one of $2n^2$ colours such that each colour is used exactly twice. Jana stands in one of the cells. There is a chocolate bar lying in one of the other cells. Jana wishes to reach the cell with the chocolate bar. At each step, she can only move in one of the following two ways. Either she walks to an adjacent cell or she teleports to the other cell with the same colour as her current cell. (Jana can move to an adjacent cell of the same colour by either walking or teleporting.) Determine whether Jana can fulfill her wish, regardless of the initial configuration, if she has to alternate between the two ways of moving and has to start with a teleportation.

Let $\mathbb{R}^+ = (0, \infty)$ be the set of all positive real numbers. Find all functions $f : \mathbb{R}^+ \to \mathbb{R}^+$ and polynomials $P(x)$ with non-negative real coefficients such that $P(0) = 0$ which satisfy the equality $f(f(x) + P(y)) = f(x - y) + 2y$ for all real numbers $x > y > 0$. [i]Proposed by Sardor Gafforov, Uzbekistan[/i]

In an acute triangle $ABC$ with $\overline{AB} > \overline{AC}$, let $D, E, F$ be the feet of the altitudes from $A, B, C$, respectively. Let $P$ be an intersection of lines $EF$ and $BC$, and let $Q$ be a point on the segment $BD$ such that $\angle QFD = \angle EPC$. Let $O, H$ denote the circumcenter and the orthocenter of triangle $ABC$, respectively. Suppose that $OH$ is perpendicular to $AQ$. Prove that $P, O, H$ are collinear.

Are there positive integers $m>4$ and $n$, such that a) ${m \choose 3}=n^2;$ b) ${m \choose 4}=n^2+9?$

Let $a$ and $b$ be two real numbers, with $0<a,b<1$. Prove that \[\sqrt{ab^2+a^2b}+\sqrt{(1-a)(1-b)^2+(1-a)^2(1-b)}<\sqrt{2}\]

Show that if the points of an isosceles right triangle of side length $1$ are each colored with one of four colors, then there must be two points of the same color which are at least a distance $2-\sqrt 2$ apart.

In the figure above, the large triangle and all four shaded triangles are equilateral. If the areas of triangles $A, B,$ and $C$ are $1, 2,$ and $3,$ respectively, compute the smallest possible integer ratio between the area of the entire triangle to the area of triangle $D.$ [Insert Diagram] [i]Proposed by Alex Li[/i]

An $8 \times 8$ chessboard is covered completely and without overlaps by $32$ dominoes of size $1 \times 2$. Show that there are two dominoes forming a $2 \times 2$ square.

Let $x_1, x_2, …, x_n$ and $y_1, y_2, …,y_n$ be positive reals such that $$x_1 + x_2 +.. + x_n \ge y_i \ge x^2_i$$ for all $i = 1, 2, …, n$. Prove that $$\frac{x_1}{x_1y_1 + x_2}+ + \frac{x_2}{x_2y_2 + x_3} + ...+ \frac{x_n}{x_ny_n + x_1}> \frac{1}{2n}.$$

Let $n$ be positive integer, set $M = \{ 1, 2, \ldots, 2n \}$. Find the minimum positive integer $k$ such that for any subset $A$ (with $k$ elements) of set $M$, there exist four pairwise distinct elements in $A$ whose sum is $4n + 1$.

A square $ABCD$ is divided into $n^2$ equal small (fundamental) squares by drawing lines parallel to its sides.The vertices of the fundamental squares are called vertices of the grid.A rhombus is called [i]nice[/i] when: $\bullet$ It is not a square $\bullet$ Its vertices are points of the grid $\bullet$ Its diagonals are parallel to the sides of the square $ABCD$ Find (as a function of $n$) the number of the [i]nice[/i] rhombuses ($n$ is a positive integer greater than $2$).

In a convex $n$-gon all angles are equal from a certain point, located inside the $n$-gon, all its sides are seen under equal angles. Can we conclude that this $n$-gon is regular?

For every positive integer $n$, $\sigma(n)$ is equal to the sum of all the positive divisors of $n$ (for example, $\sigma(6)=1+2+3+6=12$) . Find the solution of the equation $$\sigma(p^2)=\sigma(q^b)$$ where $p$ and $q$ are primes where $p&gt;q$ and $b$ are positive integers. [i](gools)[/i]

Let $ABC$ and $DEF$ be two triangles such that $A+ D = 120^{\circ}$ and $B+E = 120^{\circ}$. Suppose they have the same circumradius. Prove that they have the same 'Fermat length'.

[i]a)[/i] Call a four-digit number $(xyzt)_B$ in the number system with base $B$ stable if $(xyzt)_B = (dcba)_B - (abcd)_B$, where $a \leq b \leq c \leq d$ are the digits of $(xyzt)_B$ in ascending order. Determine all stable numbers in the number system with base $B.$ [i]b)[/i] With assumptions as in [i]a[/i], determine the number of bases $B \leq 1985$ such that there exists a stable number with base $B.$

Suppose $a,b,c\in \mathbb R^+$. Prove that :\[\left(\frac ab+\frac bc+\frac ca\right)^2\geq (a+b+c)\left(\frac1a+\frac1b+\frac1c\right)\]

Evaluate $\int_1^{e^2} \frac{(2x^2+2x+1)e^{x}}{\sqrt{x}}\ dx.$

Let $S$ be the set of all convex cyclic heptagons in the plane. Define a function $f:S \rightarrow \mathbb{R}^+$, such that for any convex cyclic heptagon $ABCDEFG,$ $$f(ABCDEFG)=\frac{AC \cdot BD \cdot CE \cdot DF \cdot EG \cdot FA \cdot GB} {AB \cdot BC \cdot CD \cdot DE \cdot EF \cdot FG \cdot GA}. $$ a) Show that for any $M \in S$, $f(M) \geq f(\prod)$, where $\prod$ is a regular heptagon. b) If $f(M)=f(\prod)$, is it true that $M$ is a regular heptagon?

Let $n$ be a positive integer. Consider an infinite checkered board. A set $S$ of cells is [i]connected[/i] if one may get from any cell in $S$ to any other cell in $S$ by only traversing edge-adjacent cells in $S$. Find the largest integer $k_n$ with the following property: in any connected set with $n$ cells, one can find $k_n$ disjoint pairs of adjacent cells (that is, $k_n$ disjoint dominoes). [i]Proposed by David Anghel and Vlad Spătaru[/i]

Let $n \geq 4$ be a natural number. The polynomials $x^{n+1} + x$, $x^n$, and $x^{n-3}$ are written on the board. In one move, you can choose two polynomials $f(x)$ and $g(x)$ (not necessarily distinct) and add the polynomials $f(x)g(x)$, $f(x) + g(x)$, and $f(x) - g(x)$ to the board. Find all $n$ such that after a finite number of operations, the polynomial $x$ can be written on the board.

Consider a tetrahedron$ A_1A_2A_3A_4$. A point $N$ is said to be a Servais point if its projections on the six edges of the tetrahedron lie in a plane $\alpha(N)$ (called Servais plane). Prove that if all the six points $Nij$ symmetric to a point $M$ with respect to the midpoints $Bij$ of the edges $A_iA_j$ are Servais points, then $M$ is contained in all Servais planes $\alpha(Nij )$

Given real numbers $x$, $y$, $z$ such that $xyz=-1$, show that $x^4+y^4+z^4+3(x+y+z) \ge \sum_{sym} \frac{x^2}{y}$.

Let $n$ be a positive integer. Denote $M = \{(x, y)|x, y \text{ are integers }, 1 \leq x, y \leq n\}$. Define function $f$ on $M$ with the following properties: [b]a.)[/b] $f(x, y)$ takes non-negative integer value; [b] b.)[/b] $\sum^n_{y=1} f(x, y) = n - 1$ for $1 \eq x \leq n$; [b]c.)[/b] If $f(x_1, y_1)f(x2, y2) > 0$, then $(x_1 - x_2)(y_1 - y_2) \geq 0.$ Find $N(n)$, the number of functions $f$ that satisfy all the conditions. Give the explicit value of $N(4)$.