Let us consider a triangle $\Delta{PQR}$ in the co-ordinate plane. Show for every function $f: \mathbb{R}^2\to \mathbb{R}\;,f(X)=ax+by+c$ where $X\equiv (x,y) \text{ and } a,b,c\in\mathbb{R}$ and every point $A$ on $\Delta PQR$ or inside the triangle we have the inequality: \begin{align*} & f(A)\le \text{max}\{f(P),f(Q),f(R)\} \end{align*}

$ABCD$ is a scalene tetrahedron and let $G$ be its baricentre. A plane $\alpha$ passes through $G$ such that it intersects neither the interior of $\Delta BCD$ nor its perimeter. Prove that $$\textnormal{dist}(A,\alpha)=\textnormal{dist}(B,\alpha)+\textnormal{dist}(C,\alpha)+\textnormal{dist}(D,\alpha).$$ [i] (Adapted from folklore)[/i]

Through the point $F(0,\frac{1}{4})$ of the coordinate plane two perpendicular lines pass, that intersect parabola $y=x^2$ at points $A,B,C,D$ ($A_x<B_x<C_x<D_x$) The difference of projections of segments $AD$ and $BC$ onto the $Ox$ line is $m$ Find the area of $ABCD$

A frog makes $ 3$ jumps, each exactly $ 1$ meter long. The directions of the jumps are chosen independently and at random. What is the probability the frog's final position is no more than $ 1$ meter from its starting position? $ \textbf{(A)}\ \frac {1}{6} \qquad \textbf{(B)}\ \frac {1}{5} \qquad \textbf{(C)}\ \frac {1}{4} \qquad \textbf{(D)}\ \frac {1}{3} \qquad \textbf{(E)}\ \frac {1}{2}$

Consider a right-angled triangle $ABC$ with the hypothenuse $AB=1$. The bisector of $\angle{ACB}$ cuts the medians $BE$ and $AF$ at $P$ and $M$, respectively. If ${AF}\cap{BE}=\{P\}$, determine the maximum value of the area of $\triangle{MNP}$.

Freddy the frog is jumping around the coordinate plane searching for a river, which lies on the horizontal line $y = 24$. A fence is located at the horizontal line $y = 0$. On each jump Freddy randomly chooses a direction parallel to one of the coordinate axes and moves one unit in that direction. When he is at a point where $y=0$, with equal likelihoods he chooses one of three directions where he either jumps parallel to the fence or jumps away from the fence, but he never chooses the direction that would have him cross over the fence to where $y < 0$. Freddy starts his search at the point $(0, 21)$ and will stop once he reaches a point on the river. Find the expected number of jumps it will take Freddy to reach the river.

On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue. At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet. After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls. Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?

Consider the L-shaped region formed by three unit squares joined at their sides, as shown below. Two points $A$ and $B$ are chosen independently and uniformly at random from inside this region. The probability that the midpoint of $\overline{AB}$ also lies inside this L-shaped region can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(2.5cm); draw((0,0)--(0,2)--(1,2)--(1,1)--(2,1)--(2,0)--cycle); draw((0,1)--(1,1)--(1,0), dotted); [/asy]

Let $S$ be the set of interior points of a sphere and $C$ be the set of interior points of a circle. Find, with proof, whether there exists a function $f:S\rightarrow C$ such that $d(A,B)\le d(f(A),f(B))$ for any two points $A,B\in S$ where $d(X,Y)$ denotes the distance between the points $X$ and $Y$. [i]Marius Cavachi[/i]

A $1\times 2$ rectangle is inscribed in a semicircle with longer side on the diameter. What is the area of the semicircle? $\textbf{(A)}\ \frac\pi2 \qquad \textbf{(B)}\ \frac{2\pi}3 \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}3 \qquad \textbf{(E)}\ \frac{5\pi}3$

Let $k$ be a positive integer. Two players $A$ and $B$ play a game on an infinite grid of regular hexagons. Initially all the grid cells are empty. Then the players alternately take turns with $A$ moving first. In his move, $A$ may choose two adjacent hexagons in the grid which are empty and place a counter in both of them. In his move, $B$ may choose any counter on the board and remove it. If at any time there are $k$ consecutive grid cells in a line all of which contain a counter, $A$ wins. Find the minimum value of $k$ for which $A$ cannot win in a finite number of moves, or prove that no such minimum value exists.

Find all integers $n\geq 3$ for which the following statement is true: If $\mathcal{P}$ is a convex $n$-gon such that $n-1$ of its sides have equal length and $n-1$ of its angles have equal measure, then $\mathcal{P}$ is a regular polygon. (A [i]regular [/i]polygon is a polygon with all sides of equal length, and all angles of equal measure.) [i]Proposed by Ivan Borsenco and Zuming Feng[/i]

In the right parallelopiped $ABCDA^{\prime}B^{\prime}C^{\prime}D^{\prime}$, with $AB=12\sqrt{3}$ cm and $AA^{\prime}=18$ cm, we consider the points $P\in AA^{\prime}$ and $N\in A^{\prime}B^{\prime}$ such that $A^{\prime}N=3B^{\prime}N$. Determine the length of the line segment $AP$ such that for any position of the point $M\in BC$, the triangle $MNP$ is right angled at $N$.

A circus act consists of $2024$ bamboo sticks of pairwise different heights placed in some order, with a monkey standing atop one of them. The circus master can then give commands to the monkey as follows: [color=#FFFFFF]___[/color]$\bullet$ Left! : When given this command, the monkey locates the closest bamboo stick to the left taller than the one it is currently atop, and jumps to it. If there is no such stick, the monkey stays put. [color=#FFFFFF]___[/color]$\bullet$ Right! : When given this command, the monkey locates the closest bamboo stick to the right taller than the one it is currently atop, and jumps to it. If there is no such stick, the monkey stays put. The circus master claims that given any two bamboo sticks, if the monkey is originally atop the shorter stick, then after giving at most $c$ commands he can reposition the monkey atop the taller stick. What is the smallest possible value of $c$? [i]Proposed by Archit Manas[/i]

Let $\omega$ be incircle of $ABC$. $P$ and $Q$ are on $AB$ and $AC$, such that $PQ$ is parallel to $BC$ and is tangent to $\omega$. $AB,AC$ touch $\omega$ at $F,E$. Prove that if $M$ is midpoint of $PQ$, and $T$ is intersection point of $EF$ and $BC$, then $TM$ is tangent to $\omega$. [i]By Ali Khezeli[/i]