In $\triangle ABC$ shown in the figure, $AB=7$, $BC=8$, $CA=9$, and $\overline{AH}$ is an altitude. Points $D$ and $E$ lie on sides $\overline{AC}$ and $\overline{AB}$, respectively, so that $\overline{BD}$ and $\overline{CE}$ are angle bisectors, intersecting $\overline{AH}$ at $Q$ and $P$, respectively. What is $PQ$? [asy]draw((0,0)--(7,0)); draw((0,0)--(33/7,7.66651)); draw((33/7,7.66651)--(7,0)); draw((11/5,7*7.66651/15)--(7,0)); draw((63/17,0)--(33/7,7.66651)); draw((0,0)--(45/7,7.66651/4)); dot((0,0)); label("A",(0,0),SW); dot((7,0)); label("B",(7,0),SE); dot((33/7,7.66651)); label("C",(33/7,7.66651),N); dot((11/5,7*7.66651/15)); label("D",(11/5+.2,7*7.66651/15-.25),S); dot((63/17,0)); label("E",(63/17,0),NE); dot((45/7,7.66651/4)); label("H",(44/7,7.66651/4),NW); dot((27/7,3*7.66651/20)); label("P",(27/7,3*7.66651/20),NW); dot((5,7*7.66651/36)); label("Q",(5,7*7.66651/36),N); label("9",(33/14,7.66651/2),NW); label("8",(41/7,7.66651/2),NE); label("7",(3.5,0),S);[/asy] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ \frac{5}{8}\sqrt{3} \qquad \textbf{(C)}\ \frac{4}{5}\sqrt{2} \qquad \textbf{(D)}\ \frac{8}{15}\sqrt{5} \qquad \textbf{(E)}\ \frac{6}{5}$

Given an acute triangle $ABC$ with altitudes $AA_1$, $BB_1$, and $CC_1$ ($A_1 \in BC$, $B_1 \in AC$, $C_1 \in AB$) and circumcircle $k$, the rays $B_1A_1$, $C_1B_1$, and $A_1C_1$ meet $k$ at points $A_2$, $B_2$, and $C_2$, respectively. Find the maximum possible value of \[ \sin \angle ABB_2 \cdot \sin \angle BCC_2 \cdot \sin \angle CAA_2 \] and all acute triangles $ABC$ for which it is achieved.

In a forest each of $n$ animals ($n\ge 3$) lives in its own cave, and there is exactly one separate path between any two of these caves. Before the election for King of the Forest some of the animals make an election campaign. Each campaign-making animal visits each of the other caves exactly once, uses only the paths for moving from cave to cave, never turns from one path to another between the caves and returns to its own cave in the end of its campaign. It is also known that no path between two caves is used by more than one campaign-making animal. a) Prove that for any prime $n$, the maximum possible number of campaign-making animals is $\frac{n-1}{2}$. b) Find the maximum number of campaign-making animals for $n=9$.

The sum of the digits in base ten of $ (10^{4n^2\plus{}8}\plus{}1)^2$, where $ n$ is a positive integer, is $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 4n \qquad \textbf{(C)}\ 2\plus{}2n \qquad \textbf{(D)}\ 4n^2 \qquad \textbf{(E)}\ n^2\plus{}n\plus{}2$

Consider the closed plane curves $C_i$ and $C_o,$ their respective lengths $|C_i|$ and $|C_o|,$ the closed surfaces $S_i$ and $S_o,$ and their respective areas $|S_i|$ and $|S_o|.$ Assume that $C_i$ lies inside $C_o$ and $S_i$ inside $S_o.$ (Subscript $i$ stands for "inner," $o$ for "outer.") Prove the correct assertions among the following four, and disprove the others. (i) If $C_i$ is convex, $|C_i| \le |C_o|.$ (ii) If $S_i$ is convex, $|S_i| \le |S_o|.$ (iii) If $C_o$ is the smallest convex curve containing $C_i,$ then $|C_o| \le |C_i|.$ (iv) If $S_o$ is the smallest convex surface containing $S_i,$ then $|S_o| \le |S_i|.$ You may assume that $C_i$ and $C_o$ are polygons and $S_i$ and $S_o$ polyhedra.

Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime. Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.

An integer sequence satisfies $a_{n+1}={a_n}^3 +1999$. Show that it contains at most one square.

$4.$ How many line segments have both their endpoints located at the vertices of a given cube $?$

Consider a function \( n \mapsto f(n) \) that satisfies the following conditions: \( f(n) \) is an integer for each \( n \). \( f(0) = 1 \). \( f(n+1) > f(n) + f(n-1) + \cdots + f(0) \) for each \( n = 0, 1, 2, \dots \). Determine the smallest possible value of \( f(2023) \).

In rhombus $NIMO$, $MN = 150\sqrt{3}$ and $\measuredangle MON = 60^{\circ}$. Denote by $S$ the locus of points $P$ in the interior of $NIMO$ such that $\angle MPO \cong \angle NPO$. Find the greatest integer not exceeding the perimeter of $S$. [i]Proposed by Evan Chen[/i]

Show that the equation $y^{2}=x^{3}+2a^{3}-3b^2$ has no solution in integers if $ab \neq 0$, $a \not\equiv 1 \; \pmod{3}$, $3$ does not divide $b$, $a$ is odd if $b$ is even, and $p=t^2 +27u^2$ has a solution in integers $t,u$ if $p \vert a$ and $p \equiv 1 \; \pmod{3}$.

Nick has a $3\times3$ grid and wants to color each square in the grid one of three colors such that no two squares that are adjacent horizontally or vertically are the same color. Compute the number of distinct grids that Nick can create.

Find the graph of the function $y=x-|x+x^2|$

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

Let $ABCDEF$ be a regular hexagon. Let $P$ be the intersection point of $\overline{AC}$ and $\overline{BD}$. Suppose that the area of triangle $EFP$ is 25. What is the area of the hexagon?

In a right triangle $ABC$ with a right angle $C$, let $AK$ and $BN$ be the angle bisectors. Let $D,E$ be the projections of $C$ on $AK, BN$ respectively. Prove that the length of the segment $DE$ is equal to the radius of the inscribed circle.

What is the least positive integer $m$ such that $m \cdot 2! \cdot 3! \cdot 4! \cdot 5! \cdots 16!$ is a perfect square? $\textbf{(A) }30\qquad\textbf{(B) }30030\qquad\textbf{(C) }70\qquad\textbf{(D) }1430\qquad\textbf{(E) }1001$

Around triangle $ABC$ with acute angle C is circumscribed a circle. On the arc $AB$, which does not contain point $C$, point $D$ is chosen. Point $D'$ is symmetric on point $D$ with respect to line $AB$. Straight lines $AD'$ and $BD'$ intersect segments $BC$ and $AC$ at points $E$ and $F$. Let point $C$ move along its arc $AB$. Prove that the center of the circumscribed circle of a triangle $CEF$ moves on a straight line.

Prove that if from any $2007$ consecutive terms of an infinite arithmetic progression of integers starting with $2$, one can choose a term relatively prime to all the $2006$ other terms, then there is also a term amongst any $2008$ consecutive terms relatively prime to the rest.

Let the sequences $(x_n)$ and $(y_n)$ be defined by $x_0 = 0$, $x_1 = 1$, $x_{n + 2} = 3x_{n + 1}-2x_n$ for $n = 0, 1, ...$ and $y_n = x^2_n+2^{n + 2}$ for $n = 0, 1, ...,$ respectively. Show that for all n> 0, and n is the square of a odd integer.

At an international conference there are four official languages. Any two participants can speak in one of these languages. Show that at least $60\%$ of the participants can speak the same language. [i]Mihai Baluna[/i]

The definite integrals between $0$ and $1$ of the squares of the continuous real functions $f(x)$ and $g(x)$ are both equal to $1$. Prove that there is a real number $c$ such that \[f(c)+g(c)\leq 2\]

For any natural number $n = \overline{a_i...a_2a_1}$, consider the number $$T(n) =10 \sum_{i \,\, even} a_i+\sum_{i \,\, odd} a_i.$$ Let's find the smallest positive integer $A$ such that is sum of the natural numbers $n_1,n_2,...,n_{148}$ as well as of $m_1,m_2,...,m_{149}$ and matches the pattern: $A=n_1+n_2+...+n_{148}=m_1+m_2+...+m_{149}$ $T(n_1)=T(n_2)=...=T(n_{148})$ $T(m_1)=T(m_2)=...=T(m_{148})$

The $ AB, BC $ and $ CD $ segments of the polygon $ ABCD $ have the same length and are tangent to a circle $ S $, centered on the point $ O $. Let $ P $ be the point of tangency of $ BC $ with $ S $, and let $ Q $ be the intersection point of lines $ AC $ and $ BD $. Show that the point $ Q $ is collinear with the points $ P $ and $ O $.

Let $\omega$ be a circle with centre $O$, and let $\ell$ be a line that does not intersect $\omega$. Let $P$ be an arbitrary point on $\ell$. Let $A,B$ denote the tangent points of the tangent lines from $P$. Prove that $AB$ passes through a point being independent of choosing $P$.