Let $ABC$ be a non-isosceles triangle. Two isosceles triangles $AB'C$ with base $AC$ and $CA'B$ with base $BC$ are constructed outside of triangle $ABC$. Both triangles have the same base angle $\varphi$. Let $C_1$ be a point of intersection of the perpendicular from $C$ to $A'B'$ and the perpendicular bisector of the segment $AB$. Determine the value of $\angle AC_1B.$

Define the sequence $ (a_p)_{p\ge0}$ as follows: $ a_p\equal{}\displaystyle\frac{\binom p0}{2\cdot 4}\minus{}\frac{\binom p1}{3\cdot5}\plus{}\frac{\binom p2}{4\cdot6}\minus{}\ldots\plus{}(\minus{}1)^p\cdot\frac{\binom pp}{(p\plus{}2)(p\plus{}4)}$. Find $ \lim_{n\to\infty}(a_0\plus{}a_1\plus{}\ldots\plus{}a_n)$.

Let $n$ be an integer and $a, b$ real numbers such that $n > 1$ and $a > b > 0$. Prove that $$(a^n - b^n) \left ( \frac{1}{b^{n- 1}} - \frac{1}{a^{n -1}}\right) > 4n(n -1)(\sqrt{a} - \sqrt{b})^2$$

Geodude wants to assign one of the integers $1,2,3,\ldots,11$ to each lattice point $(x,y,z)$ in a 3D Cartesian coordinate system. In how many ways can Geodude do this if for every lattice parallelogram $ABCD$, the positive difference between the sum of the numbers assigned to $A$ and $C$ and the sum of the numbers assigned to $B$ and $D$ must be a multiple of $11$? (A [i]lattice point[/i] is a point with all integer coordinates. A [i]lattice parallelogram[/i] is a parallelogram with all four vertices lying on lattice points. Here, we say four not necessarily distinct points $A,B,C,D$ form a [i]parallelogram[/i] $ABCD$ if and only if the midpoint of segment $AC$ coincides with the midpoint of segment $BD$.) [hide="Clarifications"] [list] [*] The ``positive difference'' between two real numbers $x$ and $y$ is the quantity $|x-y|$. Note that this may be zero. [*] The last sentence was added to remove confusion about ``degenerate parallelograms.''[/list][/hide] [i]Victor Wang[/i]

Show that for any integter $a$, the number $\frac{a^5}5+\frac{a^3}3+\frac{7a}{15}$ is an integer.

Let $AD$ be the bisector of an acute-angled triangle $ABC$. The circle circumscribed around the triangle $ABD$ intersects the straight line perpendicular to $AD$ that passes through point $B$, at point $E$. Point $O$ is the center of the circumscribed circle of triangle $ABC$. Prove that the points $A, O, E$ lie on the same line.

In triangle $ABC$, where $AB<AC$, let $X$, $Y$, $Z$ denote the points where the incircle is tangent to $BC$, $CA$, $AB$, respectively. On the circumcircle of $ABC$, let $U$ denote the midpoint of the arc $BC$ that contains the point $A$. The line $UX$ meets the circumcircle again at the point $K$. Let $T$ denote the point of intersection of $AK$ and $YZ$. Prove that $XT$ is perpendicular to $YZ$.

Let $ ABC$ be a triangle in which $ AB\equal{}AC$. Let $ D$ be the midpoint of $ BC$ and $ P$ be a point on $ AD$. Suppose $ E$ is the foot of perpendicular from $ P$ on $ AC$. Define \[ \frac{AP}{PD}\equal{}\frac{BP}{PE}\equal{}\lambda , \ \ \ \frac{BD}{AD}\equal{}m , \ \ \ z\equal{}m^2(1\plus{}\lambda)\] Prove that \[ z^2 \minus{} (\lambda^3 \minus{} \lambda^2 \minus{} 2)z \plus{} 1 \equal{} 0\] Hence show that $ \lambda \ge 2$ and $ \lambda \equal{} 2$ if and only if $ ABC$ is equilateral.

Determine all integers $n \geq 2$ for which the number $11111$ in base $n$ is a perfect square.

Baron Munchausen claims that he has drawn a polygon and chosen a point inside the polygon in such a way that any line passing through the chosen point divides the polygon into three polygons. Could the Baron’s claim be correct?

Let $\sigma(n)$ be the number of positive divisors of $n$, and let $\operatorname{rad} n$ be the product of the distinct prime divisors of $n$. By convention, $\operatorname{rad} 1 = 1$. Find the greatest integer not exceeding \[ 100\left(\sum_{n=1}^{\infty}\frac{\sigma(n)\sigma(n \operatorname{rad} n)}{n^2\sigma(\operatorname{rad} n)}\right)^{\frac{1}{3}}. \][i]Proposed by Michael Kural[/i]

Noah has to fit 8 species of animals into 4 cages of the Arc. He planes to put two species of animal in each cage. It turns out that, for each species of animal, there are at most 3 other species with which it cannot share a cage. Prove that there is a way to assign the animals to the cages so that each species shares a cage with a compatible species.

$ABCD$ is a convex quadrilateral. $X$ is a point on the side $AB. AC$ and $DX$ intersect at $Y$. Show that the circumcircles of $ABC, CDY$ and $BDX$ have a common point.

It is possible to arrange eight of the nine numbers $2, 3, 4, 7, 10, 11, 12, 13, 15$ in the vacant squares of the $3$ by $4$ array shown on the right so that the arithmetic average of the numbers in each row and in each column is the same integer. Exhibit such an arrangement, and specify which one of the nine numbers must be left out when completing the array. [asy] defaultpen(linewidth(0.7)); for(int x=0;x<=4;++x) draw((x+.5,.5)--(x+.5,3.5)); for(int x=0;x<=3;++x) draw((.5,x+.5)--(4.5,x+.5)); label("$1$",(1,3)); label("$9$",(2,2)); label("$14$",(3,1)); label("$5$",(4,2));[/asy]

Find the set of $x$-values satisfying the inequality $|\frac{5-x}{3}|<2$. [The symbol $|a|$ means $+a$ if $a$ is positive, $-a$ if $a$ is negative, 0 if $a$ is zero. The notation $1<a<2$ means that $a$ can have any value between $1$ and $2$, excluding $1$ and $2$. ] $ \textbf{(A)}\ 1 < x < 11\qquad\textbf{(B)}\ -1 < x < 11\qquad\textbf{(C)}\ x< 11\qquad$ $\textbf{(D)}\ x>11\qquad\textbf{(E)}\ |x| < 6 $

Find all non-negative integers $ m$ and $ n$ that satisfy the equation: \[ 107^{56}(m^2\minus{}1)\minus{}2m\plus{}5\equal{}3\binom{113^{114}}{n}\] (If $ n$ and $ r$ are non-negative integers satisfying $ r\le n$, then $ \binom{n}{r}\equal{}\frac{n}{r!(n\minus{}r)!}$ and $ \binom{n}{r}\equal{}0$ if $ r>n$.)

Let $T$ be a point outside circle $\omega$ centered at $O$. Tangents from $T$ to $\omega$ touch $\omega$ at $A;B$. Line $TO$ intersects bigger $AB$ arc at $C$.The line drawn from $T$ parallel to $AC$ intersects $CB$ at $E$. Ray $TE$ intersects small $BC$ arc at $F$. Prove that the circumcircle of $OEF$ is tangent to $\omega$.

In how many ways can each of the integers $1$ through $11$ be assigned one of the letters $L, M,$ and $T$ such that consecutive multiples of $n,$ for any positive integer $n,$ are not assigned the same letter?

In a massive school which has $m$ students, and each student took at least one subject. Let $p$ be an odd prime. Given that: (i) each student took at most $p+1$ subjects. \\ (ii) each subject is taken by at most $p$ students. \\ (iii) any pair of students has at least $1$ subject in common. \\ Find the maximum possible value of $m$.

Twenty seven unit cubes are painted orange on a set of four faces so that two non-painted faces share an edge. The $27$ cubes are randomly arranged to form a $3\times 3 \times 3$ cube. Given the probability of the entire surface area of the larger cube is orange is $\frac{p^a}{q^br^c},$ where $p$,$q$, and $r$ are distinct primes and $a$,$b$, and $c$ are positive integers, find $a+b+c+p+q+r$.

Let $\omega_1, \omega_2, \omega_3, \ldots, \omega_{2020!}$ be the distinct roots of $x^{2020!} - 1$. Suppose that $n$ is the largest integer such that $2^n$ divides the value $$\sum_{k=1}^{2020!} \frac{2^{2019!}-1}{\omega_{k}^{2020}+2}.$$ Then $n$ can be written as $a! + b$, where $a$ and $b$ are positive integers, and $a$ is as large as possible. Find the remainder when $a+b$ is divided by $1000$. [i]Proposed by vsamc[/i]

We say that two triangles are oriented similarly if they are similar and have the same orientation. Prove that if $ALT, ARM, ORT, $ and $ULM$ are four triangles which are oriented similarly, then $A$ is the midpoint of the line segment $OU.$

Let $N$ be an integer greater than $1$ and let $T_n$ be the number of non empty subsets $S$ of $\{1,2,.....,n\}$ with the property that the average of the elements of $S$ is an integer.Prove that $T_n - n$ is always even.

Three line segments, all of length $1$, form a connected figure in the plane. Any two different line segments can intersect only at their endpoints. Find the maximum area of the convex hull of the figure.

Let $a_1<a_2< \cdots$ be a strictly increasing sequence of positive integers. Suppose there exist $N$ such that for all $n>N$, $$a_{n+1}\mid a_1+a_2+\cdots+a_n$$ Prove that there exist $M$ such that $a_{m+1}=2a_m$ for all $m>M$. [i]Proposed by Ivan Chan Kai Chin[/i]