The diagonals $AC$ and $BD$ of a convex quadrilateral $ABCD$ intersect in point $M$. The angle bisector of $\angle ACD$ intersects the ray $\overrightarrow{BA}$ in point $K$. If $MA.MC+MA.CD=MB.MD$, prove that $\angle BKC=\angle CDB$.

The Fibonacci numbers are a sequence of numbers defined recursively as follows: $F_1=1$, $F_2=1$, and $F_n=F_{n-1}+F_{n-2}$. Using this definition, compute the sum $$\sum_{k=1}^{10}\frac{F_k}{F_{k+1}F_{k+2}}.$$

Let $ABCD$ be a trapezoid with $AB\parallel CD$. The bisectors of $\angle CDA$ and $\angle DAB$ meet at $E$, the bisectors of $\angle ABC$ and $\angle BCD$ meet at $F$, the bisectors of $\angle BCD$ and $\angle CDA$ meet at $G$, and the bisectors of $\angle DAB$ and $\angle ABC$ meet at $H$. Quadrilaterals $EABF$ and $EDCF$ have areas $24$ and $36$, respectively, and triangle $ABH$ has area $25$. Find the area of triangle $CDG$.

Diameter $ACE$ is divided at $C$ in the ratio $2:3$. The two semicircles, $ABC$ and $CDE$, divide the circular region into an upper (shaded) region and a lower region. The ratio of the area of the upper region to that of the lower region is [asy]pair A,B,C,D,EE; A = (0,0); B = (2,2); C = (4,0); D = (7,-3); EE = (10,0); fill(arc((2,0),A,C,CW)--arc((7,0),C,EE,CCW)--arc((5,0),EE,A,CCW)--cycle,gray); draw(arc((2,0),A,C,CW)--arc((7,0),C,EE,CCW)); draw(circle((5,0),5)); dot(A); dot(B); dot(C); dot(D); dot(EE); label("$A$",A,W); label("$B$",B,N); label("$C$",C,E); label("$D$",D,N); label("$E$",EE,W); [/asy] $\textbf{(A)}\ 2:3 \qquad \textbf{(B)}\ 1:1 \qquad \textbf{(C)}\ 3:2 \qquad \textbf{(D)}\ 9:4 \qquad \textbf{(E)}\ 5:2$

The star shown is symmetric with respect to each of the six diagonals shown. All segments connecting the points $A_1, A_2, . . . , A_6$ with the centre of the star have the length $1$, and all the angles at $B_1, B_2, . . . , B_6$ indicated in the figure are right angles. Calculate the area of the star. [img]https://1.bp.blogspot.com/-Rso2aWGUq_k/XzcAm4BkAvI/AAAAAAAAMW0/277afcqTfCgZOHshf_6ce2XpinWWR4SZACLcBGAsYHQ/s0/2006%2BMohr%2Bp1.png[/img]

Billiam is distributing his ample supply of balls among an ample supply of boxes. He distributes the balls as follows: he places a ball in the first empty box, and then for the greatest positive integer n such that all $n$ boxes from box $1$ to box $n$ have at least one ball, he takes all of the balls in those $n$ boxes and puts them into box $n +1$. He then repeats this process indefinitely. Find the number of repetitions of this process it takes for one box to have at least $2022$ balls.

Find all the integers $x, y$ and $z$ greater than or equal to $0$ such that $2^x + 9 \cdot 7^y = z^3$

Naomi has a class of $100$ students who will compete with each other in five teams. Once the teams are made, each student will shake hands with every other student, except the students in his or her own team. Naomi chooses to partition the students into teams so as to maximize the number of handshakes. How many handshakes will there be?

Let $n, m, k$ be natural numbers, with $m > n$. Which of the numbers is greater: $$\sqrt{n+\sqrt{m+\sqrt{n+...}}}\,\,\, or \,\,\,\, \sqrt{m+\sqrt{n+\sqrt{m+...}}}\,\, ?$$ Note: Each of the expressions contains $k$ square root signs; $n, m$ alternate within each expression. (N. Kurlandchik)

Let $O$ be a point of three-dimensional space and let $l_1, l_2, l_3$ be mutually perpendicular straight lines passing through $O$. Let $S$ denote the sphere with center $O$ and radius $R$, and for every point $M$ of $S$, let $S_M$ denote the sphere with center $M$ and radius $R$. We denote by $P_1, P_2, P_3$ the intersection of $S_M$ with the straight lines $l_1, l_2, l_3$, respectively, where we put $P_i \neq O$ if $l_i$ meets $S_M$ at two distinct points and $P_i = O$ otherwise ($i = 1, 2, 3$). What is the set of centers of gravity of the (possibly degenerate) triangles $P_1P_2P_3$ as $M$ runs through the points of $S$?

a) Given a chain of $60$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $59$ g, $60$ g? A broken link also weighs $1$ g. b) Given a chain of $150$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $149$ g, $150$ g? A broken link also weighs $1$ g.

At a dance party a group of boys and girls exchange dances as follows: one boy dances with $ 5$ girls, a second boy dances with $ 6$ girls, and so on, the last boy dancing with all the girls. If $ b$ represents the number of boys and $ g$ the number of girls, then: $ \textbf{(A)}\ b \equal{} g\qquad \textbf{(B)}\ b \equal{} \frac{g}{5}\qquad \textbf{(C)}\ b \equal{} g \minus{} 4\qquad \textbf{(D)}\ b \equal{} g \minus{} 5\qquad \\ \textbf{(E)}\ \text{It is impossible to determine a relation between }{b}\text{ and }{g}\text{ without knowing }{b \plus{} g.}$

Find all integers $n \ge 4$ with the following property: Each field of the $n \times n$ table can be painted white or black in such a way that each square of this table had the same color as exactly the two adjacent squares. (Squares are adjacent if they have exactly one side in common.) How many different colorings of the $6 \times 6$ table fields meet the above conditions?

Let $s (n)$ denote the sum of digits of a positive integer $n$. Using six different digits, we formed three 2-digits $p, q, r$ such that $$p \cdot q \cdot s(r) = p\cdot s(q) \cdot r = s (p) \cdot q \cdot r.$$ Find all such numbers $p, q, r$.

Two circles intersect at two points $A$ and $B$. A line $\ell$ which passes through the point $A$ meets the two circles again at the points $C$ and $D$, respectively. Let $M$ and $N$ be the midpoints of the arcs $BC$ and $BD$ (which do not contain the point $A$) on the respective circles. Let $K$ be the midpoint of the segment $CD$. Prove that $\measuredangle MKN = 90^{\circ}$.

Let $\Delta A_1B_1C$ be a triangle with $\angle A_1B_1C = 90^{\circ}$ and $\frac{CA_1}{CB_1} = \sqrt{5}+2$. For any $i \ge 2$, define $A_i$ to be the point on the line $A_1C$ such that $A_iB_{i-1} \perp A_1C$ and define $B_i$ to be the point on the line $B_1C$ such that $A_iB_i \perp B_1C$. Let $\Gamma_1$ be the incircle of $\Delta A_1B_1C$ and for $i \ge 2$, $\Gamma_i$ be the circle tangent to $\Gamma_{i-1}, A_1C, B_1C$ which is smaller than $\Gamma_{i-1}$. How many integers $k$ are there such that the line $A_1B_{2016}$ intersects $\Gamma_{k}$?

Calculate $f(\sqrt[3]{2}-1) $, where $$f(x) = x^{1999} + 3x^{1998} + 4x^{1997} + 2x^{1996} + 4x^{1995} + 2x^{1994} + ...$$ $$... + 4x^3 + 2x^2 + 3x+ 1.$$

Find all functions $ f: \mathbb{R} \to \mathbb{R}$, such that \[ f(xf(y)) \plus{} f(f(x) \plus{} f(y)) \equal{} yf(x) \plus{} f(x \plus{} f(y))\] holds for all $ x$, $ y \in \mathbb{R}$, where $ \mathbb{R}$ denotes the set of real numbers.

Prove that there are do not exist natural numbers $k, m$ such that numbers $k^2+2m$, $m^2+2k$ to be squares of integers.

Given the triangle $ABC$ with $T$ is its [i]Fermat–Torricelli[/i] point. Let $(N_a)$ be the circumcircle of $\triangle TBC$. Choose a point $X$ on $(N_a)$ such that $TX$ is perpendicular to $BC$. The segment $BC$ intersects $(TN_aX)$ at $D$. Similar definition of points $Y, Z, E, F$. The reflection lines of the [i]Euler[/i] line of $\triangle ABC$ wrt $BC, CA, AB$ intersect $XD, YE, ZF$ at $P, Q, R$, respectively. Prove that: $AP$ is perpendicular to $QR$ if and only if $AB = AC$ or $2BC^2 = AB^2 + AC^2$.

Prove that there aren't any positive integrer numbers $x,y,z$ such that $x^2+y^2=3z^2$.

Jeff writes down the two-digit base-$10$ prime $\overline{ab_{10}}$. He realizes that if he misinterprets the number as the base $11$ number $\overline{ab_{11}}$ or the base $12$ number $\overline{ab_{12}}$, it is still a prime. What is the least possible value of Jeff’s number (in base $10$)? [i]Proposed byMuztaba Syed[/i]

A positive integer is [i]totally square[/i] is the sum of its digits (written in base $10$) is a square number. For example, $13$ is totally square because $1 + 3 = 2^2$, but $16$ is not totally square. Show that there are infinitely many positive integers that are not the sum of two totally square integers.

A point $P$ lies in the same plane as a given square of side $1$. Let the vertices of the square, taken counterclockwise, be $A$, $B$, $C$ and $D$. Also, let the distances from $P$ to $A$, $B$ and $C$, respectively, be $u$, $v$ and $w$. What is the greatest distance that $P$ can be from $D$ if $u^2 + v^2 = w^2$? $ \textbf{(A)}\ 1 + \sqrt{2}\qquad\textbf{(B)}\ 2\sqrt{2}\qquad\textbf{(C)}\ 2 + \sqrt{2}\qquad\textbf{(D)}\ 3\sqrt{2}\qquad\textbf{(E)}\ 3 + \sqrt{2}$

Let $A,B,C\in \mathcal{M}_3(\mathbb{R})$ such that $\det A=\det B=\det C$ and $\det(A+iB)=\det(C+iA)$. Prove that $\det (A+B)=\det (C+A)$.