A sequence of integers $(a_0,...,a_k)$ is said to be [i]medaled[/i] if, for each $i = 0,...,k$, there are exactly $a_i$ elements of the sequence equal to $i$. For example, $(1,2,1,0)$ is a [i]medaled [/i] seqence. Indicates all [i]medaled [/i] sequences $(a_0,...,a_{2015})$.

Let positive real numbers $ a,b$ satisfy $ b \minus{} a > 2.$ Prove that for any two distinct integers $ m,n$ belonging to $ [a,b),$ there always exists non-empty set $ S$ consisting of certain integers belonging to $ [ab,(a \plus{} 1)(b \plus{} 1))$ such that $ \frac {\displaystyle\prod_{x\in S}}{mn}$ is square of a rational number.

Let $ABC$ be a triangle such that $|AC|>|AB|$. Let $X$ be on line $AB$ (closer to $A$) such that $|BX|=|AC|$ and let $Y$ be on the segment $AC$ such that $|CY|=|AB|$. Intersection of lines $XY$ and bisector of $BC$ is point $P$. Prove that $\angle BPC+\angle BAC = 180^\circ$.

Find all positive integers $n$ for which there do not exist $n$ consecutive composite positive integers less than $n!$.

We will say that an octagon is integral if its is equiangular, its vertices are lattice points (i.e., points with integer coordinates), and its area is an integer. For example, the figure on the right shows an integral octagon of area $21$. Determine, with proof, the smallest positive integer $K$ so that for every positive integer $k\geq K$, there is an integral octagon of area $k$. [asy] size(200); defaultpen(linewidth(0.8)); draw((-1/2,0)--(17/2,0)^^(0,-1/2)--(0,15/2)); for(int i=1;i<=6;++i){ draw((0,i)--(17/2,i),linetype("4 4")); } for(int i=1;i<=8;++i){ draw((i,0)--(i,15/2),linetype("4 4")); } draw((2,1)--(1,2)--(1,3)--(4,6)--(5,6)--(7,4)--(7,3)--(5,1)--cycle,linewidth(1)); label("$1$",(1,0),S); label("$2$",(2,0),S); label("$x$",(17/2,0),SE); label("$1$",(0,1),W); label("$2$",(0,2),W); label("$y$",(0,15/2),NW); [/asy]

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Don Miguel places a token in one of the $(n+1)^2$ vertices determined by an $n \times n$ board. A [i]move[/i] consists of moving the token from the vertex on which it is placed to an adjacent vertex which is at most $\sqrt2$ away, as long as it stays on the board. A [i]path[/i] is a sequence of moves such that the token was in each one of the $(n+1)^2$ vertices exactly once. What is the maximum number of diagonal moves (those of length $\sqrt2$) that a path can have in total?

A circle inscribed in a square, Has two chords as shown in a pair. It has radius $2$, And $P$ bisects $TU$. The chords' intersection is where? Answer the question by giving the distance of the point of intersection from the center of the circle. [asy] size(100); defaultpen(linewidth(0.8)); draw(unitcircle); draw((-1,-1)--(1,-1)--(1,1)--(-1,1)--cycle); label("$A$",(-1,1),SE); label("$B$",(1,1),SE); label("$C$",(1,-1),SE); label("$D$",(-1,-1),SE); pair M=(1,0),N=(0,-1),T=(-1,0),U=(0,1),P=dir(135); draw(P--M^^(-1,-1)--(1,1)); label("$M$",M,SE); label("$N$",N,SE); label("$T$",T,SE); label("$U$",U,SE); label("$P$",P,dir(270)); dot(origin^^(-1,1)^^(-1,-1)^^(1,-1)^^(1,1)^^M^^N^^T^^U^^P); [/asy]

For a positive integer $n$, let $A(n)$ be the equal to the remainder when $n$ is divided by $11$ and let $T(n)=A(1)+A(2)+A(3)+ \dots + A(n)$. Find the value of $$A(T(2021))$$

Suppose we have an (infinite) cone $ \mathcal C$ with apex $ A$ and a plane $ \pi$. The intersection of $ \pi$ and $ \mathcal C$ is an ellipse $ \mathcal E$ with major axis $ BC$, such that $ B$ is closer to $ A$ than $ C$, and $ BC \equal{} 4$, $ AC \equal{} 5$, $ AB \equal{} 3$. Suppose we inscribe a sphere in each part of $ \mathcal C$ cut up by $ \mathcal E$ with both spheres tangent to $ \mathcal E$. What is the ratio of the radii of the spheres (smaller to larger)?

The total number of languages used in KAUST is $n$. For each positive integer $k \le n$, let $A_k$ be the set of all those people in KAUST who can speak at least $k$ languages; and let $B_k$ be the set of all people $P$ in KAUST with the property that, for any $k$ pairwise different languages (used in KAUST), $P$ can speak at least one of these $k$ languages. Prove that (a) If $2k \ge n + 1$ then $A_k \subseteq B_k$ (b) If $2k \le n + 1$ then $A_k \supseteq B_k.$ Nguyễn Duy Thái Sơn

Determine the largest number of steps for $\gcd(k,76)$ to terminate over all choices of $0 < k < 76$, using the following algorithm for gcd. Give your answer in the form $(n,k)$ where $n$ is the maximal number of steps and $k$ is the $k$ which achieves this. If multiple $k$ work, submit the smallest one. \begin{tabular}{l} 1: \textbf{FUNCTION} $\text{gcd}(a,b)$: \\ 2: $\qquad$ \textbf{IF} $a = 0$ \textbf{RETURN} $b$ \\ 3: $\qquad$ \textbf{ELSE RETURN} $\text{gcd}(b \bmod a,a)$ \end{tabular}

Let $\Gamma$ be the circumscribed circle of a triangle $ABC$ and let $D$ be a point at line segment $BC$. The circle passing through $B$ and $D$ tangent to $\Gamma$ and the circle passing through $C $and $D$ tangent to $\Gamma$ intersect at a point $E \ne D$. The line $DE$ intersects $\Gamma$ at two points $X$ and $Y$ . Prove that $|EX| = |EY|$.

Three circles are pairwise tangent, with none of them lying inside another. The centres of the circles are the corners of a triangle with circumference $1$. What is the smallest possible value for the sum of the areas of the circles?

Find all integers$ n$ such that $n^2 + 24n + 35$ is a square.

Calculate the volume of the tetrahedron $ ABCD $ given the edges $ AB = b $, $ AC = c $, $ AD = d $ and the angles $ \measuredangle CAD = \beta $, $ \measuredangle DAB = \gamma $ and $ \measuredangle BAC = \delta$.

Incircle of triangle $ABC$ is tangent to sides $BC,CA,AB$ at $D,E,F$,respectively.Points $P,Q$ are inside angle $BAC$ such that $FP=FB,FP||AC$ and $EQ=EC,EQ||AB$.Prove that $P,Q,D$ are collinear.

In the beginnig, all nine squares of $3\times 3$ chessboard contain $0$. At each step, we choose two squares sharing a common edge, then we add $1$ to them or $-1$ to them. Show that it is not possible to make all squares $2$, after a finite number of steps.

Sebastian has a certain number of rectangles with areas that sum up to 3 and with side lengths all less than or equal to $1$. Demonstrate that with each of these rectangles it is possible to cover a square with side $1$ in such a way that the sides of the rectangles are parallel to the sides of the square. [b]Note:[/b] The rectangles can overlap and they can protrude over the sides of the square.

Can the distances from a certain point on the plane to the vertices of a certain square be equal to $1, 4, 7$, and $8$ ?

Find the smallest number among the following numbers: $ \textbf{(A) }\sqrt{55}-\sqrt{52}\qquad\textbf{(B) }\sqrt{56}-\sqrt{53}\qquad\textbf{(C) }\sqrt{77}-\sqrt{74}\qquad\textbf{(D) }\sqrt{88}-\sqrt{85}\qquad\textbf{(E) }\sqrt{70}-\sqrt{67} $

Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$. Rays $\displaystyle \overrightarrow{OB}$ and $\displaystyle \overrightarrow{DC}$ intersect at $E$, and rays $\displaystyle \overrightarrow{OC}$ and $\displaystyle \overrightarrow{AB}$ intersect at $F$. Suppose that $AE = EC = CF = 4$, and the circumcircle of $ODE$ bisects $\overline{BF}$. Find the area of triangle $ADF$. [i]Proposed by Howard Halim[/i]

Let $A_{1}A_{2}\ldots A_{9}$ be a regular $9-$gon. Let $\{A_{1},A_{2},\ldots,A_{9}\}=S_{1}\cup S_{2}\cup S_{3}$ such that $|S_{1}|=|S_{2}|=|S_{3}|=3$. Prove that there exists $A,B\in S_{1}$, $C,D\in S_{2}$, $E,F\in S_{3}$ such that $AB=CD=EF$ and $A \neq B$, $C\neq D$, $E\neq F$.

Prove that in every convex quadrilateral of area $1$, the sum of the lengths of the sides and diagonals is not smaller than $2(2+\sqrt2)$.

Let $n$ be a positive integer such that there exists a positive integer that is less than $\sqrt{n}$ and does not divide $n$. Let $(a_1, . . . , a_n)$ be an arbitrary permutation of $1, . . . , n$. Let $a_{i1} < . . . < a_{ik}$ be its maximal increasing subsequence and let $a_{j1} > . . . > a_{jl}$ be its maximal decreasing subsequence. Prove that tuples $(a_{i1}, . . . , a_{ik})$ and $(a_{j1}, . . . , a_{jl} )$ altogether contain at least one number that does not divide $n$.