[b]5.[/b] In triangle $ABC$, let $r_A$ be the line that passes through the midpoint of $BC$ and is perpendicular to the internal bisector of $\angle{BAC}$. Define $r_B$ and $r_C$ similarly. Let $H$ and $I$ be the orthocenter and incenter of $ABC$, respectively. Suppose that the three lines $r_A$, $r_B$, $r_C$ define a triangle. Prove that the circumcenter of this triangle is the midpoint of $HI$.

Let $\alpha_{1}, \alpha_{2}, \cdots , \alpha_{n}$ be numbers in the interval $[0, 2\pi]$ such that the number $\displaystyle\sum_{i=1}^n (1 + \cos \alpha_{i})$ is an odd integer. Prove that \[\displaystyle\sum_{i=1}^n \sin \alpha_i \ge 1\]

Let $n$ be an odd integer greater than $1.$ Let $A$ be an $n\times n$ symmetric matrix such that each row and column consists of some permutation of the integers $1,2, \ldots, n.$ Show that each of the integers $1,2, \ldots, n$ must appear in the main diagonal of $A$.

Let $ ABC$ be an equilateral triangle inscribed in circle $ O$. $ M$ is a point on arc $ BC$. Lines $ \overline{AM}$, $ \overline{BM}$, and $ \overline{CM}$ are drawn. Then $ AM$ is: [asy]defaultpen(linewidth(.8pt)); unitsize(2cm); pair O = origin; pair B = (1,0); pair C = dir(120); pair A = dir(240); pair M = dir(90 - 18); draw(Circle(O,1)); draw(A--C--M--B--cycle); draw(B--C); draw(A--M); dot(O); label("$A$",A,SW); label("$B$",B,E); label("$M$",M,NE); label("$C$",C,NW); label("$O$",O,SE);[/asy]$ \textbf{(A)}\ \text{equal to }{BM + CM}\qquad \textbf{(B)}\ \text{less than }{BM + CM}\qquad \textbf{(C)}\ \text{greater than }{BM + CM}\qquad$ $ \textbf{(D)}\ \text{equal, less than, or greater than }{BM + CM}\text{, depending upon the position of }{ {M}\qquad}$ $ \textbf{(E)}\ \text{none of these}$

Given a parabola $C: y^2=4px\ (p>0)$ with focus $F(p,\ 0)$. Let two lines $l_1,\ l_2$ passing through $F$ intersect orthogonaly each other, $C$ intersects with $l_1$ at two points $P_1,\ P_2$ and $C$ intersects with $l_2$ at two points $Q_1,\ Q_2$. Answer the following questions. (1) Set the equation of $l_1$ as $x=ay+p$ and let the coordinates of $P_1,\ P_2$ as $(x_1,\ y_1),\ (x_2,\ y_2)$, respectively. Express $y_1+y_2,\ y_1y_2$ in terms of $a,\ p$. (2) Show that $\frac{1}{P_1P_2}+\frac{1}{Q_1Q_2}$ is constant regardless of way of taking $l_1,\ l_2$.

In a circle with radius 1 a regular n-gon $A_1 A_2...A_n$ is inscribed. Calculate the product: $A_1 A_2.A_1 A_3 \dots A_1 A_{n-1} .A_1 A_n$.

Find all real numbers of the form $\sqrt[p]{2021+\sqrt[q]{a}}$ that can be expressed as a linear combination of roots of unity with rational coefficients, where $p$ and $q$ are (possible the same) prime numbers, and $a>1$ is an integer, which is not a $q$-th power.

A permutation of a set is a bijection from the set to itself. For example, if $\sigma$ is the permutation $1 7\mapsto 3$, $2 \mapsto 1$, and $3 \mapsto 2$, and we apply it to the ordered triplet $(1, 2, 3)$, we get the reordered triplet $(3, 1, 2)$. Let $\sigma$ be a permutation of the set $\{1, ... , n\}$. Let $$\theta_k(m) = \begin{cases} m + 1 & \text{for} \,\, m < k\\ 1 & \text{for} \,\, m = k\\ m & \text{for} \,\, m > k\end{cases}$$ Call a finite sequence $\{a_i\}^{j}_{i=1}$ a disentanglement of $\sigma$ if $\theta_{a_j} \circ ...\circ \theta_{a_j} \circ \sigma$ is the identity permutation. For example, when $\sigma = (3, 2, 1)$, then $\{2, 3\}$ is a disentaglement of $\sigma$. Let $f(\sigma)$ denote the minimum number $k$ such that there is a disentanglement of $\sigma$ of length $k$. Let $g(n)$ be the expected value for $f(\sigma)$ if $\sigma$ is a random permutation of $\{1, ... , n\}$. What is $g(6)$?

Let $\epsilon$  be a positive real number. A positive integer will be called $\epsilon$-squarish if it is the product of two integers $a$ and $b$ such that $1 < a < b < (1 +\epsilon )a$. Prove that there are infinitely many occurrences of six consecutive $\epsilon$ -squarish integers.

On the table was a pile of $135$ chocolate chips. Phil ate $\tfrac49$ of the chips, Eric ate $\tfrac4{15}$ of the chips, and Beverly ate the rest of the chips. How many chips did Beverly eat?

Let $ABCD$ be a quadrilateral with $\angle ADC = 70^{\circ}$, $\angle ACD = 70^{\circ}$, $\angle ACB = 10^{\circ}$ and $\angle BAD = 110^{\circ}$. The measure of $\angle CAB$ (in degrees) is:

In a trapezoid $ABCD$ whose parallel sides $AB$ and $CD$ are in ratio $\frac{AB}{CD}=\frac32$, the points $ N$ and $M$ are marked on the sides $BC$ and $AB$ respectively, in such a way that $BN = 3NC$ and $AM = 2MB$ and segments $AN$ and $DM$ are drawn that intersect at point $P$, find the ratio between the areas of triangle $APM$ and trapezoid $ABCD$. [img]https://cdn.artofproblemsolving.com/attachments/7/8/21d59ca995d638dfcb76f9508e439fd93a5468.png[/img]

For integers $a, b$, call the lattice point with coordinates $(a,b)$ [b]basic[/b] if $gcd(a,b)=1$. A graph takes the basic points as vertices and the edges are drawn in such way: There is an edge between $(a_1,b_1)$ and $(a_2,b_2)$ if and only if $2a_1=2a_2\in \{b_1-b_2, b_2-b_1\}$ or $2b_1=2b_2\in\{a_1-a_2, a_2-a_1\}$. Some of the edges will be erased, such that the remaining graph is a forest. At least how many edges must be erased to obtain this forest? At least how many trees exist in such a forest?

Solve the equation in integer numbers $$y^3-x^3=91$$

In a bag there are $1007$ black and $1007$ white balls, which are randomly numbered $1$ to $2014$. In every step we draw one ball and put it on the table; also if we want to, we may choose two different colored balls from the table and put them in a different bag. If we do that we earn points equal to the absolute value of their differences. How many points can we guarantee to earn after $2014$ steps?