Let $O$ be the circumcentre of the acute triangle $ABC$ and let lines $AO$ and $BC$ intersect at point $K$. On sides $AB$ and $AC$, points $L$ and $M$ are chosen such that $|KL|= |KB|$ and $|KM| = |KC|$. Prove that segments $LM$ and $BC$ are parallel.

The following diagram shows a square where each side has four dots that divide the side into three equal segments. The shaded region has area 105. Find the area of the original square. [center][img]https://snag.gy/r60Y7k.jpg[/img][/center]

An equilateral triangle $ABC$ is divided by nine lines parallel to $BC$ into ten bands that are equally wide. We colour the bands alternately red and blue, with the smallest band coloured red. The difference between the total area in red and the total area in blue is $20$ $\text{cm}^2$. What is the area of triangle $ABC$?

Consider $\triangle XPQ$ and $\triangle YPQ$ such that $X$ and $Y$ are on the opposite sides of $PQ$ and the circumradius of $\triangle XPQ$ and the circumradius of $\triangle YPQ$ are the same. $I$ and $J$ are the incenters of $\triangle XPQ$ and $\triangle YPQ$ respectively. Let $M$ be the midpoint of $PQ$. Suppose $I, M, J$ are collinear. Prove that $XPYQ$ is a parallelogram.

In the game of Colonel Blotto, you have 100 troops to distribute among 10 castles. Submit a 10-tuple $(x_1, x_2, \dots x_{10})$ of nonnegative integers such that $x_1 + x_2 + \dots + x_{10} = 100$, where each $x_i$ represent the number of troops you want to send to castle $i$. Your troop distribution will be matched up against each opponent's and you will win 10 points for each castle that you send more troops to (if you send the same number, you get 5 points, and if you send fewer, you get none). Your aim is to score the most points possible averaged over all opponents. For example, if team $A$ submits $(90,10,0,\dots,0)$, team B submits $(11,11,11,11,11,11,11,11,11,1)$, and team C submits $(10,10,10,\dots 10)$, then team A will win 10 points against team B and 15 points against team C, while team B wins 90 points against team C. Team A averages 12.5 points, team B averages 90 points, and team C averages 47.5 points. [i]2016 CCA Math Bonanza Lightning #5.4[/i]

Let $ABC$ be a triangle and its incircle meets $BC, AC, AB$ at $D, E$ and $F$ respectively. Let point $ P $ on the incircle and inside $ \triangle AEF $. Let $ X=PB \cap DF , Y=PC \cap DE, Q=EX \cap FY $. Prove that the points $ A$ and $Q$ lies on $DP$ simultaneously or located opposite sides from $DP$.

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

Let $ f:[0,2]\longrightarrow \mathbb{R} $ a differentiable function having a continuous derivative and satisfying $ f(0)=f(2)=1 $ and $ |f’|\le 1. $ Show that $$ \left| \int_0^2 f(t) dt\right| >1. $$

[b]1)[/b] Show that there exist quadratic polynoms $ P\in\mathbb{R}[X] $ whose composition with themselves have $ 1,2 $ and $ 3 $ as their fixed points. [b]2)[/b] Prove that the polynoms referred to at [b]1)[/b] are not integer. [i]Gheorghe Iurea[/i]

[b]p1.[/b] Show that $9x + 5y$ is a multiple of$ 17$ whenever $2x + 3y$ is a multiple of $17$. [b]p2.[/b] Express the five distinct fifth roots of $1$ in terms of radicals. [b]p3.[/b] Prove that the three perpendiculars dropped to the three sides of an equilateral triangle from any point inside the triangle have a constant sum. [b]p4.[/b] Find the volume of a sphere which circumscribes a regular tetrahedron of edge $a$. [b]p5.[/b] For any integer $n$ greater than $1$, show that $n^2-2n + 1$ is a factor at $n^{n-1}-1$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b, c,d$ be four integers. Prove that the product of the six differences $$b - a,c - a,d - a,d - c,d - b, c - b$$ is divisible by $12$.

A real number with absolute value less than $1$ is written in each cell of an $n\times n$ array, so that the sum of the numbers in each $2\times 2$ square is zero. Show that for odd $n$ the sum of all the numbers is less than $n$.

Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find all possible values of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]

Let $ABCD$ be a convex cyclic quadrilateral with the diagonal intersection $S$. Let further be $P$ the circumcenter of the triangle $ABS$ and $Q$ the circumcenter of the triangle $BCS$. The parallel to $AD$ through $P$ and the parallel to $CD$ through $Q$ intersect at point $R$. Prove that $R$ is on $BD$. (Karl Czakler)

Solve the following equation in real numbers: $\frac{(x^2-1)(|x|+1)}{x+sgnx}=[x+1].$

Compute the remainder of $3^{2021}$ mod $15$