A point $D$ is chosen on the side $AC$ of a triangle $ABC$ with $\angle C < \angle A < 90^\circ$ in such a way that $BD=BA$. The incircle of $ABC$ is tangent to $AB$ and $AC$ at points $K$ and $L$, respectively. Let $J$ be the incenter of triangle $BCD$. Prove that the line $KL$ intersects the line segment $AJ$ at its midpoint.

Let $A,B$ be two points in the plane with integer coordinates $A=(x_1,y_1)$ and $B=(x_2,y_2)$. (Thus $x_i,y_i\in\mathbb Z$, for $i=1,2$.) A path $\pi:A\to B$ is a sequence of [b]down[/b] and [b]right[/b] steps, where each step has an integer length, and the initial step starts from $A$, the last step ending at $B$. In the figure below, we indicated a path from $A_1=(4,9)$ to $B1=(10,3)$. The distance $d(A,B)$ between $A$ and $B$ is the number of such paths. For example, the distance between $A=(0,2)$ and $B=(2,0)$ equals $6$. Consider now two pairs of points in the plane $A_i=(x_i,y_i)$ and $B_i=(u_i,z_i)$ for $i=1,2$, with integer coordinates, and in the configuration shown in the picture (but with arbitrary coordinates): $x_2<x_1$ and $y_1>y_2$, which means that $A_1$ is North-East of $A_2$; $u_2<u_1$ and $z_1>z_2$, which means that $B_1$ is North-East of $B_2$. Each of the points $A_i$ is North-West of the points $B_j$, for $1\le i$, $j\le2$. In terms of inequalities, this means that $x_i<\min\{u_1,u_2\}$ and $y_i>\max\{z_1,z_2\}$ for $i=1,2$. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYi9hL2I4ODlmNDAyYmU5OWUyMzVmZmEzMTY1MGY3YjI3YjFlMmMxMTI2LnBuZw==&rn=VlRSTUMgMjAxNC5wbmc=[/img] (a) Find the distance between two points $A$ and $B$ as before, as a function of the coordinates of $A$ and $B$. Assume that $A$ is North-West of $B$. (b) Consider the $2\times2$ matrix $M=\begin{pmatrix}d(A_1,B_1)&d(A_1,B_2)\\d(A_2,B_1)&d(A_2,B_2)\end{pmatrix}$. Prove that for any configuration of points $A_1,A_2,B_1,B_2$ as described before, $\det M>0$.

Centers of adjacent faces of a unit cube are joined to form a regular octahedron. What is the volume of this octahedron? $ \textbf{(A) } \frac 18 \qquad \textbf{(B) } \frac 16 \qquad \textbf{(C) } \frac 14 \qquad \textbf{(D) } \frac 13 \qquad \textbf{(E) } \frac 12$

Consider the system of equations $$a + 2b + 3c + \ldots + 26z = 2020$$ $$b + 2c + 3d + \ldots + 26a = 2019$$ $$\vdots$$ $$y + 2z + 3a + \ldots + 26x = 1996$$ $$z + 2a + 3b + \ldots + 26y = 1995$$ where each equation is a rearrangement of the first equation with the variables cycling and the coefficients staying in place. Find the value of $$z + 2y + 3x + \dots + 26a.$$ [i]Proposed by Joshua Hsieh[/i]

Each of the $48$ faces of eight $1\times 1\times 1$ cubes is randomly painted either blue or green. The probability that these eight cubes can then be assembled into a $2\times 2\times 2$ cube in a way so that its surface is solid green can be written $\frac{p^m}{q^n}$ , where $p$ and $q$ are prime numbers and $m$ and $n$ are positive integers. Find $p + q + m + n$.

(a) Is it true that, for arbitrary integer $n{}$ greater than $1$ and distinct positive integers $i{}$ and $j$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'}$ and $j^{'}$ whose product $i^{'}j^{'}$ is divisible by the product $ij$? (b) Is it true that, for arbitrary integer $n{}$ greater than $2$ and distinct positive integers $i, j, k$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'},j^{'},k^{'}$ whose product $i^{'}j^{'}k^{'}$ is divisible by the product $ijk$?

Consider an isosceles triangle $KL_1L_2$ with $|KL_1|=|KL_2|$ and let $KA, L_1B_1,L_2B_2$ be its angle bisectors. Prove that $\cos \angle B_1AB_2 < \frac35$

Cevians $AP$ and $AQ$ of a triangle $ABC$ are symmetric with respect to its bisector. Let $X$, $Y$ be the projections of $B$ to $AP$ and $AQ$ respectively, and $N$, $M$ be the projections of $C$ to $AP$ and $AQ$ respectively. Prove that $XM$ and $NY$ meet on $BC$.

There are $n$ points on a circle, such that each line segment connecting two points is either red or blue. $P_iP_j$ is red if and only if $P_{i+1} P_{j+1}$ is blue, for all distinct $i, j$ in $\left\{1, 2, ..., n\right\}$. (a) For which values of $n$ is this possible? (b) Show that one can get from any point on the circle to any other point, by doing a maximum of 3 steps, where one step is moving from a point to another point through a red segment connecting these points.

Let $S$ be a set. We say $S$ is $D^\ast$[i]-finite[/i] if there exists a function $f : S \to S$ such that for every nonempty proper subset $Y \subsetneq S$, there exists a $y \in Y$ such that $f(y) \notin Y$. The function $f$ is called a [i]witness[/i] of $S$. How many witnesses does $\{0,1,\cdots,5\}$ have? [i]Proposed by Evan Chen[/i]