In space, we are given the points $A,B,C$ and a sphere with center $O$ and radius $1$. Find the point $X$ from the sphere for which the sum $f(X)=|XA|^2+|XB|^2+|XC|^2$ attains its maximal and minimal value. Prove that if the segments $OA,OB,OC$ are pairwise perpendicular and $d$ is the distance from the center $O$ to the centroid of the triangle $ABC$ then: (a) the maximum of $f(X)$ is equal to $9d^2+3+6d$; (b) the minimum of $f(X)$ is equal to $9d^2+3-6d$. [i]K. Dochev and I. Dimovski[/i]

Find the least integer $k$ such that for any $2011 \times 2011$ table filled with integers Kain chooses, Abel be able to change at most $k$ cells to achieve a new table in which $4022$ sums of rows and columns are pairwise different.

Let $A$, $B$, $C$, $D$ be four points such that no three are collinear and $D$ is not the orthocenter of $ABC$. Let $P$, $Q$, $R$ be the orthocenters of $\triangle BCD$, $\triangle CAD$, $\triangle ABD$, respectively. Suppose that the lines $AP$, $BQ$, $CR$ are pairwise distinct and are concurrent. Show that the four points $A$, $B$, $C$, $D$ lie on a circle. [i]Andrew Gu[/i]

Ben flips a coin 10 times and then records the absolute difference between the total number of heads and tails he's flipped. He then flips the coin one more time and records the absolute difference between the total number of heads and tails he's flipped. If the probability that the second number he records is greater than the first can be expressed as $\frac{a}{b}$ for positive integers $a,b$ with $\gcd (a,b) = 1$, then find $a + b$. [i]Proposed by Vismay Sharan[/i]

Hugo places a chess piece on the top left square of a $20 \times 20$ chessboard and makes $10$ moves with it. On each of these $10$ moves, he moves the piece either one square horizontally (left or right) or one square vertically (up or down). After the last move, he draws an $X$ on the square that the piece occupies. When Hugo plays the game over and over again, what is the largest possible number of squares that could eventually be marked with an $X$? Prove that your answer is correct.

(A.Zaslavsky, 8) A triangle can be dissected into three equal triangles. Prove that some its angle is equal to $ 60^{\circ}$.

In $\vartriangle ABC$, the points $D, E$ and $F$ lie on $AB, BC$ and $CA$ respectively. The line segments $AE, BF$ and $CD$ meet at the point $G$. Suppose that the area of each of $\vartriangle BGD, \vartriangle ECG$ and $\vartriangle GFA$ is $1$ cm$^2$. Prove that the area of each of $\vartriangle BEG, \vartriangle GCF$ and $\vartriangle ADG$ is also $1$ cm$^2$. [img]https://cdn.artofproblemsolving.com/attachments/e/7/ec090135bd2e47a9681d767bb984797d87218c.png[/img]

Prove that we can put in any arbitrary triangle with sidelengths $a,b,c$ such that $0\le a,b,c \le \sqrt2$ into a unit cube.

Let be an increasing, infinite sequence of natural numbers $ \left( a_n \right)_{n\ge 1} . $ [b]a)[/b] Prove that if $ a_n=n, $ for any natural numbers $ n, $ then $$ -2+2\sqrt{1+n} <\frac{1}{\sqrt{a_1}} +\frac{1}{\sqrt{a_2}} +\cdots +\frac{1}{\sqrt{a_n}} <2\sqrt n , $$ for any natural numbers $ n. $ [b]b)[/b] Disprove the converse of [b]a).[/b] [i]Vasile Radu[/i]

Every side of a right triangle is an integer when measured in cm, and the difference between the hypotenuse and one of the legs is $75$ cm. What is the smallest possible value of its perimeter?

The circumference inscribed on the triangle $ABC$ is tangent to the sides $BC$, $CA$ and $AB$ on the points $D$, $E$ and $F$, respectively. $AD$ intersect the circumference on the point $Q$. Show that the line $EQ$ meet the segment $AF$ at its midpoint if and only if $AC=BC$.

Find the smallest positive integer $k$ such that there exist positive integers $M,O>1$ satisfying \[ (O\cdot M\cdot O)^k=(O\cdot M)\cdot \underbrace{(N\cdot O\cdot M)\cdot (N\cdot O\cdot M)\cdot \ldots \cdot (N\cdot O\cdot M)}_{2016\ (N\cdot O\cdot M)\text{s}}, \] where $N=O^M$. [i]Proposed by James Lin and Yannick Yao[/i]

Solve in the real numbers $x, y, z$ a system of the equations: \[ \begin{cases} x^2 - (y+z+yz)x + (y+z)yz = 0 \\ y^2 - (z + x + zx)y + (z+x)zx = 0 \\ z^2 - (x+y+xy)z + (x+y)xy = 0. \\ \end{cases} \]

Four numbers are written on the board: $1, 3, 6, 10.$ Each time two arbitrary numbers, $a$ and $b$ are deleted, and numbers $a + b$ and $ab$ are written in their place. Is it possible to get numbers $2015, 2016, 2017, 2018$ on the board after several such operations?

Let $f:\mathbb N\rightarrow\mathbb N$ be a non-decreasing function and let $n$ be an arbitrary natural number. Suppose that there are prime numbers $p_1,p_2,\dots,p_n$ and natural numbers $s_1,s_2,\dots,s_n$ such that for each $1\leq i\leq n$ the set $\{f(p_ir+s_i)|r=1,2,\dots\}$ is an infinite arithmetic progression. Prove that there is a natural number $a$ such that \[f(a+1), f(a+2), \dots, f(a+n)\] form an arithmetic progression.

In the given sequence $1,4,8,10,16,19,21,25,30,43$, sum of a few adjacent numbers in the sequence is a multiple of $11$. The number of such number sets is________.

Let $M \in GL_{2n}(K)$, represented in block form as \[ M = \left[ \begin{array}{cc} A & B \\ C & D \end{array} \right] , M^{-1} = \left[ \begin{array}{cc} E & F \\ G & H \end{array} \right] \] Show that $\det M.\det H=\det A$.

There are $3$ sticks of each color between blue, red and green, such that we can make a triangle $T$ with sides sticks with all different colors. Dana makes $2$ two arrangements, she starts with $T$ and uses the other six sticks to extend the sides of $T$, as shown in the figure. This leads to two hexagons with vertex the ends of these six sticks. Prove that the area of the both hexagons it´s the same. [asy]size(300); pair A, B, C, D, M, N, P, Q, R, S, T, U, V, W, X, Y, Z, K; A = (0, 0); B = (1, 0); C=(-0.5,2); D=(-1.1063,4.4254); M=(-1.7369,3.6492); N=(3.5,0); P=(-2.0616,0); Q=(0.2425,-0.9701); R=(1.6,-0.8); S=(7.5164,0.8552); T=(8.5064,0.8552); U=(7.0214,2.8352); V=(8.1167,-1.546); W=(9.731,-0.7776); X=(10.5474,0.8552); Y=(6.7813,3.7956); Z=(6.4274,3.6272); K=(5.0414,0.8552); draw(A--B, blue); label("$b$", (A + B) / 2, dir(270), fontsize(10)); label("$g$", (B+C) / 2, dir(10), fontsize(10)); label("$r$", (A+C) / 2, dir(230), fontsize(10)); draw(B--C,green); draw(D--C,green); label("$g$", (C + D) / 2, dir(10), fontsize(10)); draw(C--A,red); label("$r$", (C + M) / 2, dir(200), fontsize(10)); draw(B--N,green); label("$g$", (B + N) / 2, dir(70), fontsize(10)); draw(A--P,red); label("$r$", (A+P) / 2, dir(70), fontsize(10)); draw(A--Q,blue); label("$b$", (A+Q) / 2, dir(540), fontsize(10)); draw(B--R,blue); draw(C--M,red); label("$b$", (B+R) / 2, dir(600), fontsize(10)); draw(Q--R--N--D--M--P--Q, dashed); draw(Y--Z--K--V--W--X--Y, dashed); draw(S--T,blue); draw(U--T,green); draw(U--S,red); draw(T--W,red); draw(T--X,red); draw(S--K,green); draw(S--V,green); draw(Y--U,blue); draw(U--Z,blue); label("$b$", (Y+U) / 2, dir(0), fontsize(10)); label("$b$", (U+Z) / 2, dir(200), fontsize(10)); label("$b$", (S+T) / 2, dir(100), fontsize(10)); label("$r$", (S+U) / 2, dir(200), fontsize(10)); label("$r$", (T+W) / 2, dir(70), fontsize(10)); label("$r$", (T+X) / 2, dir(70), fontsize(10)); label("$g$", (U+T) / 2, dir(70), fontsize(10)); label("$g$", (S+K) / 2, dir(70), fontsize(10)); label("$g$", (V+S) / 2, dir(30), fontsize(10)); [/asy]

The centre of the circumcircle of quadrilateral $ABCD$ is $O$ and $O$ is not on any of the sides of $ABCD$. $P=AC \cap BD$. The circumecentres of $\triangle{OAB}$, $\triangle{OBC}$, $\triangle{OCD}$ and $\triangle{ODA}$ are $O_1$, $O_2$, $O_3$ and $O_4$ respectively. Prove that $O_1O_3$, $O_2O_4$ and $OP$ are concurrent.

Let $ n>1$ be an odd integer and define: \[ N\equal{}\{\minus{}n,\minus{}(n\minus{}1),\dots,\minus{}1,0,1,\dots,(n\minus{}1),n\}.\] A subset $ P$ of $ N$ is called [i]basis[/i] if we can express every element of $ N$ as the sum of $ n$ different elements of $ P$. Find the smallest positive integer $ k$ such that every $ k\minus{}$elements subset of $ N$ is basis.

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

Angle bisector from vertex $A$ of acute triangle $ABC$ intersects side $BC$ in point $D$, and circumcircle of $ABC$ in point $E$ (different from $A$). Let $F$ and $G$ be foots of perpendiculars from point $D$ to sides $AB$ and $AC$. Prove that area of quadrilateral $AEFG$ is equal to the area of triangle $ABC$

If $ a,n $ are two natural numbers corelated by the equation $ \left\{ \sqrt{n+\sqrt n}\right\} =\left\{ \sqrt a\right\} , $ then $ 1+4a $ is a perfect square. Justify this statement. Here, $ \{\} $ is the usual fractionary part.

Let $(x+x^{-1}+1)^{40} = \sum_{i=-40}^{40} a_ix^i.$ Find the remainder when $\sum_{p \text{ prime}} a_p$ is divided by $41.$

Let $S$ be a set of rational numbers with the following properties: (a) $\frac12$ is an element in $S$, (b) if $x$ is in $S$, then both $\frac{1}{x+1}$ and $\frac{x}{x+1}$ are in $S$. Prove that $S$ contains all rational numbers in the interval $(0, 1)$.