IMO Math

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC = \angle CAD = \angle DAE\qquad \text{and}\qquad \angle ABC = \angle ACD = \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$.

Hi everyone,  I hope you had a great summer!  I was not posting for about a month or so because not many people were viewing the blog in the summer.  I'm going to start to post frequently again, and for now I have a problem request I got a couple days ago.  There is a polynomial $P(x)$ with integer coefficients such that\[P(x)=\frac{(x^{2310}-1)^6}{(x^{105}-1)(x^{70}-1)(x^{42}-1)(x^{30}-1)}\]holds for every $0<x<1.$ Find the coefficient of $x^{2022}$ in $P(x)$.

 Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies\[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\]for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

 The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and\[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\]for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Hello,  I have enabled ads on this blog as a fund for my future education. Please cooperate with this and if they annoy you, click the down arrow button next to the ad to hide it. Thank you!

 Let $ a$, $ b$, $ c$ be positive real numbers such that $ abc = 1$. Prove that \[ \frac {1}{a^{3}\left(b + c\right)} + \frac {1}{b^{3}\left(c + a\right)} + \frac {1}{c^{3}\left(a + b\right)}\geq \frac {3}{2}. \]

 Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$ Solution 1 (overkill):  Since $5>1+3$, from Perron's Criterion this polynomial is irreducible over the integers as desired. Solution 2 (normal solution): Assume FTSOC that there do exist $g(x), h(x)$ such that $f(x)=g(x)\cdot h(x)$. Observe that there are no integer roots of $f(x)$ from the Rational Root Theorem. Thus, $g(x), h(x)$ cannot be linear, and their degree is greater than or equal to $2$. We have $g(0)h(0)=3$. WLOG $g(0)=1$. Let $r_1, r_2, \dots r_j \in\mathbb{C}$ be the roots of $g(x)$. We have $r_1r_2\dots r_n=\pm 1$. Multiplying the equalities $r_i^{n-1}(r_i+5)=-3$ for all $1\leq i\leq j$, we obtain\[\vert g(-5)\vert = \vert (r_1+5)(r_2+5)\dots (r_m+5)\vert = 3^m.\]But $g(-5)f(-5)=3$, contradiction.

 Prove for all positive reals $a,b,c$, $$\sum_{cyc} \frac{a}{\sqrt{3ab+bc}} \ge \frac 32.$$ I'll wait for comments and will post the solution in 2 days! EDIT - Well now that it's been 3 days (oops i forgot to post), I'll show my solution now.  By Holder,$$\left( \sum_{cyc} \frac{a}{\sqrt{3ab+bc}} \right)^2 \left( \sum_{cyc} a(3ab+bc) \right) \ge (a+b+c)^3$$ So it suffices to show$$(a+b+c)^3 \ge \frac 94 \sum_{cyc} a(3ab+bc)$$ Expanding and cancelling terms, we wish to show$$f(a,b,c)=4\sum_{cyc} a^3 + 12\sum_{cyc} b^2a-15\sum_{cyc} a^2b-3abc\ge 0$$ Claim: $f(a,b,c) \le f(a+d, b+d, c+d)$ if $d>0$ Proof:$$f(a+d,b+d,c+d)-f(a,b,c) =d (4\sum_{cyc} 3a^2 + 12\sum_{cyc} (b^2+2ba) - 15\sum_{cyc} (a^2+2ba) - 3(ab+bc+ca)) $$ $$+d^2 (4\sum_{cyc} 3a + 12 \sum_{cyc} (2b+a) - 15\sum_{cyc} (2a+b) - 3(a+b+c)$$ The $d^2, d^3$ stuff cancel. So $f(a+d,b+d,c+d) - f(a,b,c) = \frac{9d}{2} \sum_{cyc} (a-b)^2 > 0$. Let $a=\min\{a,b,c\}$, then $f(a,a+b,a+c) \ge f(0,b,c)$. Let $x=\frac bc$, then

Last one. I promise.   Prove that for all positive real numbers $a,b,c$,\[ \frac{a}{\sqrt{a^2 + 8bc}} + \frac{b}{\sqrt{b^2 + 8ca}} + \frac{c}{\sqrt{c^2 + 8ab}} \geq 1.  \]

Since the last one was super easy, I have to do another one... right?  We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ .

 Let $ABC$ be a triangle. Circle $\Gamma$ passes through $A$, meets segments $AB$ and $AC$ again at points $D$ and $E$ respectively, and intersects segment $BC$ at $F$ and $G$ such that $F$ lies between $B$ and $G$. The tangent to circle $BDF$ at $F$ and the tangent to circle $CEG$ at $G$ meet at point $T$. Suppose that points $A$ and $T$ are distinct. Prove that line $AT$ is parallel to $BC$.

Let $ABC$ be an acute triangle with orthocenter $H$, and let $W$ be a point on the side $BC$, lying strictly between $B$ and $C$. The points $M$ and $N$ are the feet of the altitudes from $B$ and $C$, respectively. Denote by $\omega_1$ is the circumcircle of $BWN$, and let $X$ be the point on $\omega_1$ such that $WX$ is a diameter of $\omega_1$. Analogously, denote by $\omega_2$ the circumcircle of triangle $CWM$, and let $Y$ be the point such that $WY$ is a diameter of $\omega_2$. Prove that $X,Y$ and $H$ are collinear.

 Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$are integers.

Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. Let the line passing through $I$ and perpendicular to $CI$ intersect the segment $BC$ and the arc $BC$ (not containing $A$) of $\Omega$ at points $U$ and $V$ , respectively. Let the line passing through $U$ and parallel to $AI$ intersect $AV$ at $X$, and let the line passing through $V$ and parallel to $AI$ intersect $AB$ at $Y$ . Let $W$ and $Z$ be the midpoints of $AX$ and $BC$, respectively. Prove that if the points $I, X,$ and $Y$ are collinear, then the points $I, W ,$ and $Z$ are also collinear.

A site is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones.