How many ways are there to line up $19$ girls (all of different heights) in a row so that no girl has a shorter girl both in front of and behind her?

For how many integer values of $m$, (i) $1\le m \le 5000$ (ii) $[\sqrt{m}] =[\sqrt{m+125}]$ Note: $[x]$ is the greatest integer function

Each of the natural numbers from $1$ to $n$ is colored either red or blue, with each color being used at least once. It turns out that: – every red number is a sum of two distinct blue numbers; and – every blue number is a difference between two red numbers. Determine the smallest possible value of $n$ for which such a coloring exists.

$(a)$ Prove that in a triangle the sum of the distances from the centroid to the sides is not less than three times the inradius, and find the cases of equality. $(b)$ Determine the points in a triangle that minimize the sum of the distances to the sides.

Bamal, Halvan, and Zuca are playing [i]The Game[/i]. To start, they‘re placed at random distinct vertices on regular hexagon $ABCDEF$. Two or more players collide when they‘re on the same vertex. When this happens, all the colliding players lose and the game ends. Every second, Bamal and Halvan teleport to a random vertex adjacent to their current position (each with probability $\dfrac{1}{2}$), and Zuca teleports to a random vertex adjacent to his current position, or to the vertex directly opposite him (each with probability $\dfrac{1}{3}$). What is the probability that when [i]The Game[/i] ends Zuca hasn‘t lost? [i]Proposed by Edwin Zhao[/i] [hide=Solution][i]Solution.[/i] $\boxed{\dfrac{29}{90}}$ Color the vertices alternating black and white. By a parity argument if someone is on a different color than the other two they will always win. Zuca will be on opposite parity from the others with probability $\dfrac{3}{10}$. They will all be on the same parity with probability $\dfrac{1}{10}$. At this point there are $2 \cdot 2 \cdot 3$ possible moves. $3$ of these will lead to the same arrangement, so we disregard those. The other $9$ moves are all equally likely to end the game. Examining these, we see that Zuca will win in exactly $2$ cases (when Bamal and Halvan collide and Zuca goes to a neighboring vertex). Combining all of this, the answer is $$\dfrac{3}{10}+\dfrac{2}{9} \cdot \dfrac{1}{10}=\boxed{\dfrac{29}{90}}$$ [/hide]

$A = \begin{pmatrix} 2019 & 2020 & 2021 \\ 2020 & 2021 & 2022 \\ 2021 & 2022 & 2023 \end{pmatrix}$. Find $\text{rank}(A)$.

In the city of Urbextorto, the sales tax is $25\%$. A certain clothing store in the city is currently giving an $n\%$ discount on all items, and $n$ is special in that, after both the sales tax and discount are applied, a $\$20$ shirt ends up costing $\$20$. Find the value of $n$. $\textbf{(A) }5\qquad\textbf{(B) }10\qquad\textbf{(C) }20\qquad\textbf{(D) }25\qquad\textbf{(E) }50$

Let $\{a_{n}\}$ be a sequence which satisfy $a_{1}=5$ and $a_{n=}\sqrt[n]{a_{n-1}^{n-1}+2^{n-1}+2.3^{n-1}} \qquad \forall n\geq2$ [b](a)[/b] Find the general fomular for $a_{n}$ [b](b)[/b] Prove that $\{a_{n}\}$ is decreasing sequences

Given an integer $ n\ge 2$, find the maximal constant $ \lambda (n)$ having the following property: if a sequence of real numbers $ a_{0},a_{1},a_{2},\cdots,a_{n}$ satisfies $ 0 \equal{} a_{0}\le a_{1}\le a_{2}\le \cdots\le a_{n},$ and $ a_{i}\ge\frac {1}{2}(a_{i \plus{} 1} \plus{} a_{i \minus{} 1}),i \equal{} 1,2,\cdots,n \minus{} 1,$ then $ (\sum_{i \equal{} 1}^n{ia_{i}})^2\ge \lambda (n)\sum_{i \equal{} 1}^n{a_{i}^2}.$

Define the function $f(x, y, z)$ by\[f(x, y, z) = x^{y^z} - x^{z^y} + y^{z^x} - y^{x^z} + z^{x^y}.\]Evaluate $f(1, 2, 3) + f(1, 3, 2) + f(2, 1, 3) + f(2, 3, 1) + f(3, 1, 2) + f(3, 2, 1)$. [i]Proposed by Robin Park[/i]

Triangle $ABC$ has an obtuse angle at $\angle A$. Points $D$ and $E$ are placed on $\overline{BC}$ in the order $B$, $D$, $E$, $C$ such that $\angle BAD=\angle BCA$ and $\angle CAE=\angle CBA$. If $AB=10$, $AC=11$, and $DE=4$, determine $BC$.

Let $A_{1}A_{2} \cdots A_{14}$ be a regular $14-$gon. Prove that $A_{1}A_{3}\cap A_{5}A_{11}\cap A_{6}A_{9}\ne \emptyset$.

Given a triangle $ABC$ satisfying $AC+BC=3\cdot AB$. The incircle of triangle $ABC$ has center $I$ and touches the sides $BC$ and $CA$ at the points $D$ and $E$, respectively. Let $K$ and $L$ be the reflections of the points $D$ and $E$ with respect to $I$. Prove that the points $A$, $B$, $K$, $L$ lie on one circle. [i]Proposed by Dimitris Kontogiannis, Greece[/i]

A polynomial $c_dx^d+c_{d-1}x^{d-1}+\dots+c_1x+c_0$ with degree $d$ is [i]reflexive[/i] if there is an integer $n\ge d$ such that $c_i=c_{n-i}$ for every $0\le i\le n$, where $c_i=0$ for $i>d$. Let $\ell\ge 2$ be an integer and $p(x)$ be a polynomial with integer coefficients. Prove that there exist reflexive polynomials $q(x)$, $r(x)$ with integer coefficients such that \[(1+x+x^2+\dots+x^{\ell-1})p(x)=q(x)+x^\ell r(x)\]

The numbers $1$, $2$, $3$, $4$, $5$, $6$ are placed onto the following six spots such that the average of the leftmost two spots, middle two spots, and rightmost two spots are all equal. What is the difference between the largest and smallest possibilities of the number on the shaded spot shown below? [asy] size(110); draw(Circle((0,0),0.7)); draw(Circle((2,0),0.7));label("$1$",(2,0)); filldraw(Circle((4,0),0.7),gray); draw(Circle((6,0),0.7)); draw(Circle((8,0),0.7)); draw(Circle((10,0),0.7));label("$2$",(10,0)); [/asy] $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

During a game of chess, at a certain point, in each row and column of the board there is an odd number of pieces. Prove that the number of pieces that are on black squares is even. (Note: a chessboard has $8$ rows and $8$ columns)