Let $ABC$ be a triangle in which (${BL}$is the angle bisector of ${\angle{ABC}}$ $\left( L\in AC \right)$, ${AH}$ is an altitude of$\vartriangle ABC$ $\left( H\in BC \right)$ and ${M}$is the midpoint of the side ${AB}$. It is known that the midpoints of the segments ${BL}$ and ${MH}$ coincides. Determine the internal angles of triangle $\vartriangle ABC$.

Show that for any positive real numbers $a$ and $b$ the following inequality hold, $$\frac{a(a+1)}{b+1}+\frac{b(b+1)}{a+1}\geq a+b.$$

The sum of the largest number and the smallest number of a triple of positive integers $(x,y,z)$ is called to be the power of the triple. What is the sum of powers of all triples $(x,y,z)$ where $x,y,z \leq 9$? $ \textbf{(A)}\ 9000 \qquad\textbf{(B)}\ 8460 \qquad\textbf{(C)}\ 7290 \qquad\textbf{(D)}\ 6150 \qquad\textbf{(E)}\ 6000 $

Let $ABC$ be an acute triangle and $AD$ a height. The angle bissector of $\angle DAC$ intersects $DC$ at $E$. Let $F$ be a point on $AE$ such that $BF$ is perpendicular to $AE$. If $\angle BAE=45º$, find $\angle BFC$.

Malcolm writes a positive integer on a piece of paper. Malcolm doubles this integer and subtracts 1, writing this second result on the same piece of paper. Malcolm then doubles the second integer and adds 1, writing this third integer on the paper. If all of the numbers Malcolm writes down are prime, determine all possible values for the first integer.

$F_n$ is the Fibonacci sequence $F_0 = F_1 = 1$, $F_{n+2} = F_{n+1} + F_n$. Find all pairs $m > k \geq 0$ such that the sequence $x_0, x_1, x_2, ...$ defined by $x_0 = \frac{F_k}{F_m}$ and $x_{n+1} = \frac{2x_n - 1}{1 - x_n}$ for $x_n \not = 1$, or $1$ if $x_n = 1$, contains the number $1$

Find all continuous functions $f: R \to R$ such that for all reals $x$ and $y$, $f(x+f(y)) = y+f(x+1)$.

[u]Round 1[/u] [b]p1.[/b] At a fortune-telling exam, $13$ witches are sitting in a circle. To pass the exam, a witch must correctly predict, for everybody except herself and her two neighbors, whether they will pass or fail. Each witch predicts that each of the $10$ witches she is asked about will fail. How many witches could pass? [b]p2.[/b] Out of $152$ coins, $7$ are counterfeit. All counterfeit coins have the same weight, and all real coins have the same weight, but counterfeit coins are lighter than real coins. How can you find $19$ real coins if you are allowed to use a balance scale three times? [b]p3.[/b] The digits of a number $N$ increase from left to right. What could the sum of the digits of $9 \times N$ be? [b]p4.[/b] The sides and diagonals of a pentagon are colored either blue or red. You can choose three vertices and flip the colors of all three lines that join them. Can every possible coloring be turned all blue by a sequence of such moves? [img]https://cdn.artofproblemsolving.com/attachments/5/a/644aa7dd995681fc1c813b41269f904283997b.png[/img] [b]p5.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake and call that number $N$. Pick up the stack of the top $N$ pancakes and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [u]Round 2[/u] [b]p6.[/b] A circus owner will arrange $100$ fleas on a long string of beads, each flea on her own bead. Once arranged, the fleas start jumping using the following rules. Every second, each flea chooses the closest bead occupied by one or more of the other fleas, and then all fleas jump simultaneously to their chosen beads. If there are two places where a flea could jump, she jumps to the right. At the start, the circus owner arranged the fleas so that, after some time, they all gather on just two beads. What is the shortest amount of time it could take for this to happen? [b]p7.[/b] The faraway land of Noetheria has $2016$ cities. There is a nonstop flight between every pair of cities. The price of a nonstop ticket is the same in both directions, but flights between different pairs of cities have different prices. Prove that you can plan a route of $2015$ consecutive flights so that each flight is cheaper than the previous one. It is permissible to visit the same city several times along the way. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all functions $ f: \mathbb{N}_0 \rightarrow \mathbb{N}_0$ such that $ f(f(n))\plus{}f(n)\equal{}2n\plus{}6$ for all $ n \in \mathbb{N}_0$.

For the various values of the parameter $a \in R$, solve the equation $ ||x - 4| - 2x + 8| = ax + 4$

Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.

Let $ABCD$ be a square. The points $N$ and $P$ are chosen on the sides $AB$ and $AD$ respectively, such that $NP=NC$. The point $Q$ on the segment $AN$ is such that that $\angle QPN=\angle NCB$. Prove that $\angle BCQ=\frac{1}{2}\angle AQP$.

Prove that for every real number $M$ there exists an infinite arithmetical progression of positive integers such that [list] [*] the common difference is not divisible by $10$, [*] the sum of digits of each term exceeds $M$. [/list]

Given an integer $n\ge 2$, given $n+1$ distinct points $X_0,X_1,\ldots,X_n$ in the plane, and a positive real number $A$, show that the number of triangles $X_0X_iX_j$ of area $A$ does not exceed $4n\sqrt n$.

Rhombus $PQRS$ is inscribed in rectangle $ABCD$ so that vertices $P$, $Q$, $R$, and $S$ are interior points on sides $\overline{AB}$, $\overline{BC}$, $\overline{CD}$, and $\overline{DA}$, respectively. It is given that $PB=15$, $BQ=20$, $PR=30$, and $QS=40$. Let $m/n$, in lowest terms, denote the perimeter of $ABCD$. Find $m+n$.

Let $n \geq 3$ be an odd number and suppose that each square in a $n \times n$ chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares $a,b$ are considered connected if there exists a sequence of squares $c_1,\ldots,c_k$ with $c_1 = a, c_k = b$ such that $c_i, c_{i+1}$ are adjacent for $i=1,2,\ldots,k-1$. \\ \\ Find the maximal number $M$ such that there exists a coloring admitting $M$ pairwise disconnected squares.

Consider an odd prime $p$. A comutative ring $(A,+, \cdot)$ has the property that $ab=0$ implies $a^p=0$ or $b^p=0$. Moreover, $\underbrace{1+1+\cdots +1}_{p \textnormal{ times}} =0$. Take $x,y\in A$ such that there exist $m,n\geq 1$, $m\neq n$ with $x+y=x^my=x^ny$, and also $y$ is not invertible. \\ \\ $\textbf{(a)}$ Prove that $(a+b)^p=a^p+b^p$ and $(a+b)^{p^2}=a^{p^2}+b^{p^2}$ for all $a,b\in A$.\\ $\textbf{(b)}$ Prove that $x$ and $y$ are nilpotent.\\ $\textbf{(c)}$ If $y$ is invertible, does the conclusion that $x$ is nilpotent stand true? \\ \\ [i] (Bogdan Blaga)[/i]

On a $5\times 5$ grid $\mathcal A$ of integers, each with absolute value $<10^9$, define a [i]flip[/i] to be the operation of negating each element in a row / column with negative sum. For example, $(-1,-4,3,-4,1) \to (1,4,-3,4,-1)$. Determine whether there exists an $\mathcal A$ so that it's possible to perform $90$ flips on it. [i]Alex Chen[/i]

For every positive integer $n$, let $S_n$ be the sum of the first $n$ prime numbers: $S_1 = 2, S_2 = 2 + 3 = 5, S_3 = 2 + 3 + 5 = 10$, etc. Can both $S_n$ and $S_{n+1}$ be perfect squares?

How many integral solutions are there of the equation $x^5 -31x+2015=0$ ? [list=1] [*] 2 [*] 4 [*] 1 [*] None of these [/list]

Prove that the plane dividing in equal proportions the surface area and volume of the circumscribed polyhedron passes through the center of the sphere inscribed in this polyhedron.

Compute $$\int_0^\pi\frac{1-\sin x}{1+\sin x}dx.$$

Prove that \[ a^2b^2(a^2+b^2-2) \geq (a+b)(ab-1) \] for all positive real numbers $a$ and $b.$

Find $n>0$ such that $\sqrt[3]{\sqrt[3]{5\sqrt2+n}+\sqrt[3]{5\sqrt2-n}}=\sqrt2$.

Let $A_1,A_2,\ldots,A_n$ and $B_1,B_2,\ldots,B_n$ be two partitions of a set $M$ such that $|A_j\cup B_k|\ge n$ for any $j,k\in\{1,2,\ldots,n\}$. Prove that $|M|\ge n^2/2$.