Let $a$ be real number with $\sqrt{2}<a<2$, and let $ABCD$ be a convex cyclic quadrilateral whose circumcentre $O$ lies in its interior. The quadrilateral's circumcircle $\omega$ has radius $1$, and the longest and shortest sides of the quadrilateral have length $a$ and $\sqrt{4-a^2}$, respectively. Lines $L_A,L_B,L_C,L_D$ are tangent to $\omega$ at $A,B,C,D$, respectively. Let lines $L_A$ and $L_B$, $L_B$ and $L_C$,$L_C$ and $L_D$,$L_D$ and $L_A$ intersect at $A',B',C',D'$ respectively. Determine the minimum value of $\frac{S_{A'B'C'D'}}{S_{ABCD}}$.

For every positive integer $M \geq 2$, find the smallest real number $C_M$ such that for any integers $a_1, a_2,\ldots , a_{2023}$, there always exist some integer $1 \leq k < M$ such that  \[\left\{\frac{ka_1}{M}\right\}+\left\{\frac{ka_2}{M}\right\}+\cdots+\left\{\frac{ka_{2023}}{M}\right\}\leq C_M.\] Here, $\{x\}$ is the unique number in the interval $[0, 1)$ such that $x - \{x\}$ is an integer. [i] Proposed by usjl[/i]

Given an integer $n \ge 3$, prove that the diameter of a convex $n$-gon (interior and boundary) containing a disc of radius $r$ is (strictly) greater than $r(1 + 1/ \cos( \pi /n))$. The Editors

$b$ and $c$ are positive. Prove the inequality \[ \left(b-c\right)^{2011}\left(b+c\right)^{2011}\left(c-b\right)^{2011} \geq \left(b^{2011}-c^{2011}\right)\left(b^{2011}+c^{2011}\right)\left(c^{2011}-b^{2011}\right). \] (Author: V. Senderov)

A square grid $2n \times 2n$ is constructed of matches (each match is a segment of length 1). By one move Peter can choose a vertex which (at this moment) is the endpoint of 3 or 4 matches and delete two matches whose union is a segment of length 2. Find the least possible number of matches that could remain after a number of Peter's moves.

For three positive real numbers $ a,b,c $ satisfying the condition $ \frac{1}{ab}+\frac{1}{bc}+\frac{1}{ca} =1, $ prove that $$ 3/2\le \frac{ab-1}{ab+1} +\frac{bc-1}{bc+1} +\frac{ca-1}{ca+1} <2. $$ [i]Mircea Becheanu[/i]

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

On side \( AC \) of triangle \( ABC \), a point \( P \) is chosen such that \( AP = \frac{1}{3} AC \), and on segment \( BP \), a point \( S \) is chosen such that \( CS \perp BP \). A point \( T \) is such that \( BCST \) is a parallelogram. Prove that \( AB = AT \). [i]Proposed by Bohdan Zheliabovskyi[/i]

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

Let $n = (p^2 +2)^2 -9(p^2 -7)$ where $p$ is a prime number. Determine the smallest value of the sum of the digits of $n$ and for what prime number $p$ is obtained.

Let $C_1, A_1, B_1$ be points on sides $AB, BC, CA$ of triangle $ABC$, such that $AA_1, BB_1, CC_1$ concur. The rays $B_1A_1$ and $B_1C_1$ meet the circumcircle of the triangle at points $A_2$ and $C_2$ respectively. Prove that $A, C$, the common point of $A_2C_2$ and $BB_1$ and the midpoint of $A_2C_2$ are concyclic.

Let $ABC$ be an isosceles triangle with apex $A$ and altitude $AD$. On $AB$, choose a point $F$ distinct from $B$ such that $CF$ is tangent to the incircle of $ABD$. Suppose that $\vartriangle BCF$ is isosceles. Show that those conditions uniquely determine: a) which vertex of $BCF$ is its apex, b) the size of $\angle BAC$

Let $a,b,c$ be real numbers such that $a+b+c=1$ and $abc>0$ . Prove that\[bc+ca+ab<\frac{\sqrt{abc}}{2}+\frac{1}{4}.\]

Find all pairs $(m,n)$ of positive integers such that $m+n$ and $mn+1$ are both powers of $2$.

For which non-zero real numbers $ x$ is $ \frac{|x\minus{}|x|\\minus{}|}{x}$ a positive integers? $ \textbf{(A)}\ \text{for negative } x \text{ only} \qquad$ $ \textbf{(B)}\ \text{for positive } x \text{ only} \qquad$ $ \textbf{(C)}\ \text{only for } x \text{ an even integer} \qquad$ $ \textbf{(D)}\ \text{for all non\minus{}zero real numbers } x$ $ \textbf{(E)}\ \text{for no non\minus{}zero real numbers } x$

Let $ABC$ be a triangle and $D$ is a point in $BC$. The line $DA$ cuts the circumcircle of $ABC$ in the point $E$. Let $M$ and $N$ be the midpoints of $AB$ and $CD$, respectively. Let $F=MN\cap AD$ and $G\neq F$ is the point of intersection of the circumcircles of $\triangle DNF$ and $\triangle ECF$. Prove that $B,F$ and $G$ are collinears.

Let $a$, $b$, $c$ be the three sides of a triangle, and let $\alpha$, $\beta$, $\gamma$, be the angles opposite them. If $a^2+b^2=1989c^2$, find \[ \frac{\cot \gamma}{\cot \alpha+\cot \beta}. \]

Let $f(x)=x^3+ax^2+bx+c$ and $g(x)=x^3+bx^2+cx+a$, where $a,b,c$ are integers with $c\not=0$. Suppose that the following conditions hold: [list=a][*]$f(1)=0$, [*]the roots of $g(x)=0$ are the squares of the roots of $f(x)=0$.[/list] Find the value of $a^{2013}+b^{2013}+c^{2013}$.

A Sudoku matrix is defined as a $ 9\times9$ array with entries from $ \{1, 2, \ldots , 9\}$ and with the constraint that each row, each column, and each of the nine $ 3 \times 3$ boxes that tile the array contains each digit from $ 1$ to $ 9$ exactly once. A Sudoku matrix is chosen at random (so that every Sudoku matrix has equal probability of being chosen). We know two of the squares in this matrix, as shown. What is the probability that the square marked by ? contains the digit $ 3$? $ \setlength{\unitlength}{6mm} \begin{picture}(9,9)(0,0) \multiput(0,0)(1,0){10}{\line(0,1){9}} \multiput(0,0)(0,1){10}{\line(1,0){9}} \linethickness{1.2pt} \multiput(0,0)(3,0){4}{\line(0,1){9}} \multiput(0,0)(0,3){4}{\line(1,0){9}} \put(0,8){\makebox(1,1){1}} \put(1,7){\makebox(1,1){2}} \put(3,6){\makebox(1,1){?}} \end{picture}$

Let $ n \geq 2$ be a positive integer and $ \lambda$ a positive real number. Initially there are $ n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $ A$ and $ B$, with $ A$ to the left of $ B$, and letting the flea from $ A$ jump over the flea from $ B$ to the point $ C$ so that $ \frac {BC}{AB} \equal{} \lambda$. Determine all values of $ \lambda$ such that, for any point $ M$ on the line and for any initial position of the $ n$ fleas, there exists a sequence of moves that will take them all to the position right of $ M$.

For every positive integer $ n$ let \[ a_n\equal{}\sum_{k\equal{}n}^{2n}\frac{(2k\plus{}1)^n}{k}\] Show that there exists no $ n$, for which $ a_n$ is a non-negative integer.

Show that there is a subset of $A$ from $\{1,2, 3,... , 2014\}$ such that : (i) $|A| = 12$ (ii) for each coloring number in $A$ with red or white , we can always find some numbers colored in $A$ whose sum is $2015$.

A train travels a certain distance at a constant speed. Whose speed is increased by $10$ kilometers per hour, the trip can be made $40$ minutes faster. If, on the other hand, the speed is reduced by $10$ kilometers per hour, the trip takes $1$ hour further. How long is the distance traveled?

In one of the adjoining figures a square of side $2$ is dissected into four pieces so that $E$ and $F$ are the midpoints of opposite sides and $AG$ is perpendicular to $BF$. These four pieces can then be reassembled into a rectangle as shown in the second figure. The ratio of height to base, $XY$ / $YZ$, in this rectangle is [asy] size(180); defaultpen(linewidth(0.7)+fontsize(10)); pair A=(0,1), B=(0,-1), C=(2,-1), D=(2,1), E=(1,-1), F=(1,1), G=(.8,.6); pair X=(4,sqrt(5)), Y=(4,-sqrt(5)), Z=(4+2/sqrt(5),-sqrt(5)), W=(4+2/sqrt(5),sqrt(5)), T=(4,0), U=(4+2/sqrt(5),-4/sqrt(5)), V=(4+2/sqrt(5),1/sqrt(5)); draw(A--B--C--D--A^^B--F^^E--D^^A--G^^rightanglemark(A,G,F)); draw(X--Y--Z--W--X^^T--V--X^^Y--U); label("A", A, NW); label("B", B, SW); label("C", C, SE); label("D", D, NE); label("E", E, S); label("F", F, N); label("G", G, E); label("X", X, NW); label("Y", Y, SW); label("Z", Z, SE); label("W", W, NE); [/asy] $ \textbf{(A)}\ 4\qquad\textbf{(B)}\ 1+2\sqrt{3}\qquad\textbf{(C)}\ 2\sqrt{5}\qquad\textbf{(D)}\ \frac{8+4\sqrt{3}}{3}\qquad\textbf{(E)}\ 5 $

Let $n \geq 2$ be a positive integer. There are $2n$ cities $M_1, M_2, \ldots, M_{2n}$ in the country of Mathlandia. Currently there roads only between $M_1$ and $M_2, M_3, \ldots, M_n$ and the king wants to build more roads so that it is possible to reach any city from every other city. The cost to build a road between $M_i$ and $M_j$ is $k_{i, j}>0$. Let $$K=\sum_{j=n+1}^{2n} k_{1,j}+\sum_{2 \leq i<j \leq 2n} k_{i, j}.$$Prove that the king can fulfill his plan at cost no more than $\frac{2K}{3n-1}$.