The line $l$ passing through the orthocenter $H$ of a triangle $ABC$ $(BC>AB)$ and parallel to $AC$ meets $AB$ and $BC$ at points $D$ and $E$ respectively. The line passing through the circumcenter of the triangle and parallel to the median $BM$ meets $l$ at point $F$. Prove that the length of segment $HF$ is three times greater than the difference of $FE$ and $DH$ Proposed by: A.Mardanov, K.Mardanova

Suppose $f(x)=x^2+a$. Define $f^1(x)=f(x)$, $f^n(x)=f(f^{n-1}(x))$, $n=2, 3, \cdots$, and let $M=\{a\in\mathbb{R}| |f^n(0)|\le 2, \text{for any } n\in\mathbb{N}\} $. Prove that $M=[-2, \frac{1}{4}]$.

Given $f(z) = z^2-19z$, there are complex numbers $z$ with the property that $z$, $f(z)$, and $f(f(z))$ are the vertices of a right triangle in the complex plane with a right angle at $f(z)$. There are positive integers $m$ and $n$ such that one such value of $z$ is $m+\sqrt{n}+11i$. Find $m+n$.

If $ f(x) \equal{} 5x^2 \minus{} 2x \minus{} 1$, then $ f(x \plus{} h) \minus{} f(x)$ equals: $ \textbf{(A)}\ 5h^2 \minus{} 2h \qquad \textbf{(B)}\ 10xh \minus{} 4x \plus{} 2 \qquad \textbf{(C)}\ 10xh \minus{} 2x \minus{} 2 \\ \textbf{(D)}\ h(10x \plus{} 5h \minus{} 2) \qquad \textbf{(E)}\ 3h$

Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.

Box $A$ contains black balls and box $B$ contains white balls. Take a certain number of balls from $A$ and place them in $B$. Then take the same number of balls from $B$ and place them in $A$. Is the number of white balls in $A$ then greater, equal to, or less than the number of black balls in $B$?

[u]Round 1 [/u] [b]p1.[/b] In the convex quadrilateral $ABCD$ with diagonals $AC$ and $BD$, you know that angle $BAC$ is congruent to angle $CBD$, and that angle $ACD$ is congruent to angle $ADB$. Show that angle $ABC$ is congruent to angle $ADC$. [img]https://cdn.artofproblemsolving.com/attachments/5/d/41cd120813d5541dc73c5d4a6c86cc82747fcc.png[/img] [b]p2.[/b] In how many different ways can you place $12$ chips in the squares of a $4 \times 4$ chessboard so that (a) there is at most one chip in each square, and (b) every row and every column contains exactly three chips. [b]p3.[/b] Students from Hufflepuff and Ravenclaw were split into pairs consisting of one student from each house. The pairs of students were sent to Honeydukes to get candy for Father's Day. For each pair of students, either the Hufflepuff student brought back twice as many pieces of candy as the Ravenclaw student or the Ravenclaw student brought back twice as many pieces of candy as the Hufflepuff student. When they returned, Professor Trelawney determined that the students had brought back a total of $1000$ pieces of candy. Could she have possibly been right? Why or why not? Assume that candy only comes in whole pieces (cannot be divided into parts). [b]p4.[/b] While you are on a hike across Deception Pass, you encounter an evil troll, who will not let you across the bridge until you solve the following puzzle. There are six stones, two colored red, two colored yellow, and two colored green. Aside from their colors, all six stones look and feel exactly the same. Unfortunately, in each colored pair, one stone is slightly heavier than the other. Each of the lighter stones has the same weight, and each of the heavier stones has the same weight. Using a balance scale to make TWO measurements, decide which stone of each color is the lighter one. [b]p5.[/b] Alex, Bob and Chad are playing a table tennis tournament. During each game, two boys are playing each other and one is resting. In the next game the boy who lost a game goes to rest, and the boy who was resting plays the winner. By the end of tournament, Alex played a total of $10$ games, Bob played $15$ games, and Chad played $17$ games. Who lost the second game? [u]Round 2 [/u] [b]p6.[/b] Consider a set of finitely many points on the plane such that if we choose any three points $A,B,C$ from the set, then the area of the triangle $ABC$ is less than $1$. Show that all of these points can be covered by a triangle whose area is less than $4$. [b]p7.[/b] A palindrome is a number that is the same when read forward and backward. For example, $1771$ and $23903030932$ are palindromes. Can the number obtained by writing the numbers from $1$ to $n$ in order be a palindrome for some $n > 1$ ? (For example, if $n = 11$, the number obtained is $1234567891011$, which is not a palindrome.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An arrow is assigned to each edge of a polyhedron such that for each vertex, there is an arrow pointing towards that vertex and an arrow pointing away from that vertex. Prove that there exist at least two faces such that the arrows on their boundaries form a cycle.

[u]Round 1[/u] [b]p1.[/b] Nineteen witches, all of different heights, stand in a circle around a campfire. Each witch says whether she is taller than both of her neighbors, shorter than both, or in-between. Exactly three said “I am taller.” How many said “I am in-between”? [b]p2.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p3.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/a/3/78814b37318adb116466ede7066b0d99d6c64d.png[/img] [b]p4.[/b] A zebra is a new chess piece that jumps in the shape of an “L” to a location three squares away in one direction and two squares away in a perpendicular direction. The picture shows all the moves a zebra can make from its given position. Is it possible for a zebra to make a sequence of $64$ moves on an $8\times 8$ chessboard so that it visits each square exactly once and returns to its starting position? [img]https://cdn.artofproblemsolving.com/attachments/2/d/01a8af0214a2400b279816fc5f6c039320e816.png[/img] [b]p5.[/b] Ann places the integers $1, 2,..., 100$ in a $10 \times 10$ grid, however she wants. In each round, Bob picks a row or column, and Ann sorts it from lowest to highest (left-to-right for rows; top-to-bottom for columns). However, Bob never sees the grid and gets no information from Ann. After eleven rounds, Bob must name a single cell that is guaranteed to contain a number that is at least $30$ and no more than $71$. Can he find a strategy to do this, no matter how Ann originally arranged the numbers? [u]Round 2[/u] [b]p6.[/b] Evelyn and Odette are playing a game with a deck of $101$ cards numbered $1$ through $101$. At the start of the game the deck is split, with Evelyn taking all the even cards and Odette taking all the odd cards. Each shuffles her cards. On every move, each player takes the top card from her deck and places it on a table. The player whose number is higher takes both cards from the table and adds them to the bottom of her deck, first the opponent’s card, then her own. The first player to run out of cards loses. Card $101$ was played against card $2$ on the $10$th move. Prove that this game will never end. [img]https://cdn.artofproblemsolving.com/attachments/8/1/aa16fe1fb4a30d5b9e89ac53bdae0d1bdf20b0.png[/img] [b]p7.[/b] The Vogon spaceship Tempest is descending on planet Earth. It will land on five adjacent buildings within a $10 \times 10$ grid, crushing any teacups on roofs of buildings within a $5 \times 1$ length of blocks (vertically or horizontally). As Commander of the Space Force, you can place any number of teacups on rooftops in advance. When the ship lands, you will hear how many teacups the spaceship breaks, but not where they were. (In the figure, you would hear $4$ cups break.) What is the smallest number of teacups you need to place to ensure you can identify at least one building the spaceship landed on? [img]https://cdn.artofproblemsolving.com/attachments/8/7/2a48592b371bba282303e60b4ff38f42de3551.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P$ be any point inside the parallelogram $ABCD$ and let $R$ be the radius of the circle through $A$, $B$, and $C$. Show that the distance from $P$ to the nearest vertex is not greater than $R$.

Evaluate $$\lim_{x\to0}\frac{\sin2x}{e^{3x}-e^{-3x}}$$

Given a triangle $ ABC$ with $ \angle A \equal{} 120^{\circ}$. The points $ K$ and $ L$ lie on the sides $ AB$ and $ AC$, respectively. Let $ BKP$ and $ CLQ$ be equilateral triangles constructed outside the triangle $ ABC$. Prove that $ PQ \ge\frac{\sqrt 3}{2}\left(AB \plus{} AC\right)$.

A given line passes through the center $O$ of a circle. The line intersects the circle at points $A$ and $B$. Point $P$ lies in the exterior of the circle and does not lie on the line $AB$. Using only an unmarked straightedge, construct a line through $P$, perpendicular to the line $AB$. Give complete instructions for the construction and prove that it works.

Prove that the volume of a tetrahedron inscribed in a right circular cylinder of volume $1$ does not exceed $\frac{2}{3 \pi}.$

Let be a function $ \xi:\mathbb{R}\to\mathbb{R} $ of class $ C^{\infty } $ such that $ \left| \frac{d^n\xi }{dx^n} \left( x_0 \right) \right|\le 1=\frac{d\xi}{dx}(0) , $ for any real numbers $ x_0, $ and all natural numbers $ n, $ and let be the function $ h:\mathbb{C}\longrightarrow\mathbb{C} , h(z)=1+\sum_{n\in\mathbb{N}} \left(\frac{z^n}{n!}\cdot\frac{d^n\xi }{dx^n} \left( 0 \right)\right) . $ [b]a)[/b] Show that $ h $ is well-defined and analytic. [b]b)[/b] Prove that $ h\bigg|_{\mathbb{R}} =\xi\bigg|_{\mathbb{R}} . $ [b]c)[/b] Demonstrate that $$ \frac{d}{dt}\left( \frac{\xi }{\cos} \right)\left( t_0 \right) =4\sum_{p\in\mathbb{Z}}\frac{(-1)^p\xi\left( \frac{(1+2p)\pi}{2} \right)}{\left( (1+2p)\pi -2t_0\right)^2} , $$ for any $ t_0\in\left( -\frac{\pi }{2} ,\frac{\pi }{2} \right) $ and that $$ \sum_{p\in\mathbb{Z}} \frac{(-1)^p\left(\xi\left( \frac{(1+2p)\pi}{2} \right)\right)^2}{1+2p} =\frac{\pi }{2} . $$ [b]d)[/b] Deduce that $ \xi\left( \frac{(1+2p)\pi}{2} \right)=(-1)^p, $ for any integer $ p, $ and that $$ \frac{d}{dt}\left( \frac{\xi }{\cos} \right)\left( t_0 \right) =\frac{d}{dt}\left( \frac{\sin }{\cos} \right)\left( t_0 \right) , $$ for any $ t_0\in\left( -\frac{\pi }{2} ,\frac{\pi }{2} \right) . $ [b]e)[/b] Conclude that $ \xi\bigg|_\mathbb{R} =\sin\bigg|_\mathbb{R} . $

$(a)$ Is it possible to partition the segment $[0,1]$ into two sets $A$ and $B$ and to define a continuous function $f$ such that for every $x\in A \ f(x)$ is in $B$, and for every $x\in B \ f(x)$ is in $A$? $(b)$ The same question with $[0,1]$ replaced by $[0,1).$

Determine if there exists a set $S$ of $5783$ different real numbers with the following property: For every $a,b\in S$ (not necessarily distinct) there are $c\neq d$ in $S$ so that $a\cdot b=c+d$.

The midpoints of the sides $BC, CA$, and $AB$ of triangle $ABC$ are $D, E$, and $F$, respectively. The reflections of centroid $M$ of $ABC$ around points $D, E$, and $F$ are $X, Y$, and $Z$, respectively. Segments $XZ$ and $YZ$ intersect the side $AB$ in points $K$ and $L$, respectively. Prove that $AL = BK$.

In triangle $ABC$ let $A'$, $B'$, $C'$ respectively be the midpoints of the sides $BC$, $CA$, $AB$. Furthermore let $L$, $M$, $N$ be the projections of the orthocenter on the three sides $BC$, $CA$, $AB$, and let $k$ denote the nine-point circle. The lines $AA'$, $BB'$, $CC'$ intersect $k$ in the points $D$, $E$, $F$. The tangent lines on $k$ in $D$, $E$, $F$ intersect the lines $MN$, $LN$ and $LM$ in the points $P$, $Q$, $R$. Prove that $P$, $Q$ and $R$ are collinear.

Let $ABC$ be an equilateral triangle and $\mathcal{E}$ the set of all points contained in the three segments $AB$, $BC$, and $CA$ (including $A$, $B$, and $C$). Determine whether, for every partition of $\mathcal{E}$ into two disjoint subsets, at least one of the two subsets contains the vertices of a right-angled triangle.

Find all triples $(p,n,k)$ of positive integers, where $p$ is a Fermat's Prime, satisfying \[p^n + n = (n+1)^k\]. [i]Observation: a Fermat's Prime is a prime number of the form $2^{\alpha} + 1$, for $\alpha$ positive integer.[/i]

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

A rectangle with area $n$ with $n$ positive integer, can be divided in $n$ squares(this squares are equal) and the rectangle also can be divided in $n + 98$ squares (the squares are equal). Find the sides of this rectangle

For a positive integer $n$, define a function $ f_n (x) $ at an interval $ [ 0, n+1 ] $ as \[ f_n (x) = ( \sum_{i=1} ^ {n} | x-i | )^2 - \sum_{i=1} ^{n} (x-i)^2 . \] Let $ a_n $ be the minimum value of $f_n (x) $. Find the value of \[ \sum_{n=1}^{11} (-1)^{n+1} a_n . \]

The positive real numbers $a,b,c,d$ satisfy the equality $$a+bc+cd+db+\frac{1}{ab^2c^2d^2}=18.$$ Find the maximum possible value of $a$.