Let $ABCDE$ be a convex pentagon such that: $\angle ABC=90,\angle BCD=135,\angle DEA=60$ and $AB=BC=CD=DE$. Find angle $\angle DAE$.

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

In a class with $23$ students, each pair of students have watched a movie together. Let the set of movies watched by a student be his [i]movie collection[/i]. If every student has watched every movie at most once, at least how many different movie collections can these students have?

Consider a variable point $P$ inside a given triangle $ABC$. Let $D$, $E$, $F$ be the feet of the perpendiculars from the point $P$ to the lines $BC$, $CA$, $AB$, respectively. Find all points $P$ which minimize the sum \[ {BC\over PD}+{CA\over PE}+{AB\over PF}. \]

Let $x$, $y$, $z$ be positive real numbers and $x+y+z=1$. Prove that $\sqrt{xy+z}+\sqrt{yz+x}+\sqrt{zx+y} \ge 1+\sqrt{xy}+\sqrt{yz}+\sqrt{zx}$.

Every of $n$ guests invited to a dinner has got an invitation denoted by a number from $1$ to $n$. The guests will be sitting around a round table with $n$ seats. The waiter has decided to derve them according to the following rule. At first, he selects one guest and serves him/her at any place. Thereafter, he selects the guests one by one: having chosen a guest, he goes around the table for the number of seats equal to the preceeding guest's invitation number (starting from the seat of the preceeding guest), and serves the guest there. Find all $n$ for which he can select the guests in such an order to serve all the guests.

Let $n$ be a positive integer. Consider $2n$ distinct lines on the plane, no two of which are parallel. Of the $2n$ lines, $n$ are colored blue, the other $n$ are colored red. Let $\mathcal{B}$ be the set of all points on the plane that lie on at least one blue line, and $\mathcal{R}$ the set of all points on the plane that lie on at least one red line. Prove that there exists a circle that intersects $\mathcal{B}$ in exactly $2n - 1$ points, and also intersects $\mathcal{R}$ in exactly $2n - 1$ points. [i]Proposed by Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

A finite arithmetic progression of positive integers $a_1,a_2,\ldots,a_n$ satisfies the condition that for all $1\leq i<j\leq n$, the number of positive divisors of $\gcd\left(a_i,a_j\right)$ is equal to $j-i$. Find the maximum possible value of $n$. $\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }6$

Let us call a pentagon curved, if all its sides are arcs of some circles. Are there exist a curved pentagon $P$ and a point $A$ on its boundary so that any straight line passing through $A$ divides perimeter of $P$ into two parts of the same length? [i](7 points)[/i]

Determine all real values of $A$ for which there exist distinct complex numbers $x_1$, $x_2$ such that the following three equations hold: \begin{align*}x_1(x_1+1)&=A\\x_2(x_2+1)&=A\\x_1^4+3x_1^3+5x_1&=x_2^4+3x_2^3+5x_2.\end{align*}

Let ( M , g ) be a Riemannian manifold. Extend the metric tensor g to the set of tangents TM with the following specification: if $a,b\in T_v TM \, (v\in T_p M)$, then $$\tilde g_v (a, b): = g_p (\dot {\alpha} (0), \dot {\beta} (0) ) + g_p (D _ {\alpha} X(0) , D_{\beta} Y(0) )$$ where $\alpha, \beta$ are curves in M such that $\alpha(0) = \beta(0) = p$. X and Y are vector fields along $\alpha,\beta$ respectively, with the condition $\dot X (0) = a,\dot Y(0) = b$. $D _{\alpha}$ and $D _{\beta}$ are the operators of the covariant derivative along the corresponding curves according to the Levi-Civita connection. Is the eigenfunction from the Riemannian manifold (M,g) to the Riemannian manifold $(TM, \tilde g)$ harmonic?

Find the sum of the prime factors of $777.$

For a given pair of values $x$ and $y$ satisfying $x = \sin \alpha , y = \sin \beta$ , there can be four different values of $z = \sin( \alpha +\beta )$. (a) Set up a relation between $x, y$ and $z$ not involving trigonometric functions or radicals. (b) Find those pairs of values $(x, y)$ for which $z = \sin (\alpha +\beta)$ takes on fewer than four distinct values.

Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.

Let $P$ and $Q$ be on segment $BC$ of an acute triangle $ABC$ such that $\angle PAB=\angle BCA$ and $\angle CAQ=\angle ABC$. Let $M$ and $N$ be the points on $AP$ and $AQ$, respectively, such that $P$ is the midpoint of $AM$ and $Q$ is the midpoint of $AN$. Prove that the intersection of $BM$ and $CN$ is on the circumference of triangle $ABC$. [i]Proposed by Giorgi Arabidze, Georgia.[/i]

$n>1$ is odd number. There are numbers $n,n+1,n+2,...,2n-1$ on the blackboard. Prove that we can erase one number, such that the sum of all numbers will be not divided any number on the blackboard.

$M$ and $N$ are the midpoints of sides $BC$ and $AD$, respectively, of a square $ABCD$. $K$ is an arbitrary point on the extension of the diagonal $AC$ beyond $A$. The segment $KM$ intersects the side $AB$ at some point $L$. Prove that $\angle KNA = \angle LNA$. [i](5 points)[/i]

Show that if three points are inside are closed square of unit side, then some pair of them are within $\sqrt{6}-\sqrt{2}$ units apart.

Positive rational number $a$ and $b$ satisfy the equality \[a^3 + 4a^2b = 4a^2 + b^4.\] Prove that the number $\sqrt{a}-1$ is a square of a rational number.

How many non-congruent scalene triangles with perimeter $21$ have integer side lengths that form an arithmetic sequence? (In an arithmetic sequence, successive terms differ by the same amount.) $\text{(A) }0\qquad\text{(B) }1\qquad\text{(C) }3\qquad\text{(D) }4\qquad\text{(E) }6$

Let $m$ be a positive integer, and consider a $m\times m$ checkerboard consisting of unit squares. At the centre of some of these unit squares there is an ant. At time $0$, each ant starts moving with speed $1$ parallel to some edge of the checkerboard. When two ants moving in the opposite directions meet, they both turn $90^{\circ}$ clockwise and continue moving with speed $1$. When more than $2$ ants meet, or when two ants moving in perpendicular directions meet, the ants continue moving in the same direction as before they met. When an ant reaches one of the edges of the checkerboard, it falls off and will not re-appear. Considering all possible starting positions, determine the latest possible moment at which the last ant falls off the checkerboard, or prove that such a moment does not necessarily exist. [i]Proposed by Toomas Krips, Estonia[/i]

Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $CA=15$. The incircle of $ABC$ meets $BC$ at $D$. Line $AD$ meets the circle through $B$, $D$, and the reflection of $C$ over $AD$ at a point $P\neq D$. Compute $AP$. [i]2020 CCA Math Bonanza Tiebreaker Round #4[/i]

Let $u$ be the positive root of the equation $x^2+x-4=0$. The polynomial $$P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_0$$ where $n$ is positive integer has non-negative integer coefficients and $P(u)=2017$. 1) Prove that $a_0+a_1+...+a_n\equiv 1\mod 2$. 2) Find the minimum possible value of $a_0+a_1+...+a_n$.

Determine all integers $ n > 3$ for which there exist $ n$ points $ A_{1},\cdots ,A_{n}$ in the plane, no three collinear, and real numbers $ r_{1},\cdots ,r_{n}$ such that for $ 1\leq i < j < k\leq n$, the area of $ \triangle A_{i}A_{j}A_{k}$ is $ r_{i} \plus{} r_{j} \plus{} r_{k}$.

Let [i]n[/i] $\ge$ 3 be an integer and let ([i]$p_1$[/i], [i]$p_2$[/i], [i]$p_3$[/i], $\dots$, [i]$p_n$[/i]) be a permutation of {1, 2, 3, $\dots$ [i]n[/i]}. For this permutation we say that [i]$p_t$[/i] is a [i]turning point[/i] if 2$\le$ [i]t[/i] $\le$ [i]n[/i]-1 and ([i]$p_t$[/i] - [i]$p_{t-1}$[/i])([i]$p_t$[/i] - [i]$p_{t+1}$[/i]) > 0 For example, for [i]n[/i] = 8, the permutation (2, 4, 6, 7, 5, 1, 3, 8) has two turning points: [i]$p_4$[/i] = 7 and [i]$p_6$[/i] = 1. For fixed [i]n[/i], let [i]q[/i]([i]n)[/i] denote the number of permutations of {1, 2, 3, $\dots$ [i]n[/i]} with exactly one turning point. Find all [i]n[/i] $\ge$ 3 for which [i]q[/i]([i]n)[/i] is a perfect square.