Segments $AC$ and $BD$ intersect at point $P$ such that $PA = PD$ and $PB = PC$. Let $E$ be the foot of the perpendicular from $P$ to the line $CD$. Prove that the line $PE$ and the perpendicular bisectors of the segments $PA$ and $PB$ are concurrent.

$S=\{(x,y)|x^2-y^2 \text{is odd},x,y\in\mathbb{R}\},T=\{(x,y)|\sin(2\pi x^2)-\sin(2\pi y^2)=\cos(2\pi x^2)-\cos(2\pi y^2),x,y\in\mathbb{R}\}$, then $\text{(A)}S\subset T\qquad\text{(B)}T\subset S\qquad\text{(C)}S=T\qquad\text{(D)}S\cap T=\varnothing$

Let $ABC$ be an acute-angled triangle with incircle $\omega$ and incenter $I$. Let $\omega$ touch $AB, BC$ and $CA $ at points $D, E, F$ respectively. The circles $\omega_1$ and $\omega_2$ centered at $J_1$ and $J_2$ respectively are inscribed into A$DIF$ and $BDIE$. Let $J_1J_2$ intersect $AB$ at point $M$. Prove that $CD$ is perpendicular to $IM$.

A cube has side length $5$. Let $S$ be its surface area and $V$ its volume. Find $\frac{S^3}{V^2}$ .

In Wonderland, the towns are connected by roads, and whenever there is a direct road between two towns there is also a route between these two towns that does not use that road. (There is at most one direct road between any two towns.) The Queen of Hearts ordered the Spades to provide a list of all ”even” subsystems of the system of roads, that is, systems formed by subsets of the set of roads, where each town is connected to an even number of roads (possibly none). For each such subsystem they should list its roads. If there are totally $n$ roads in Wonderland and $x$ subsystems on the Spades’ list, what is the number of roads on their list when each road is counted as many times as it is listed?

For any positive integer $n$, let $a_n$ be the number of pairs $(x,y)$ of integers satisfying $|x^2-y^2| = n$. (a) Find $a_{1432}$ and $a_{1433}$. (b) Find $a_n$ .

If $A=(a_1,\cdots,a_n)$ , $B=(b_1,\cdots,b_n)$ be $2$ $n-$tuple that $a_i,b_i=0 \ or \ 1$ for $i=1,2,\cdots,n$, we define $f(A,B)$ the number of $1\leq i\leq n$ that $a_i\ne b_i$. For instance, if $A=(0,1,1)$ , $B=(1,1,0)$, then $f(A,B)=2$. Now, let $A=(a_1,\cdots,a_n)$ , $B=(b_1,\cdots,b_n)$ , $C=(c_1,\cdots,c_n)$ be 3 $n-$tuple, such that for $i=1,2,\cdots,n$, $a_i,b_i,c_i=0 \ or \ 1$ and $f(A,B)=f(A,C)=f(B,C)=d$. $a)$ Prove that $d$ is even. $b)$ Prove that there exists a $n-$tuple $D=(d_1,\cdots,d_n)$ that $d_i=0 \ or \ 1$ for $i=1,2,\cdots,n$, such that $f(A,D)=f(B,D)=f(C,D)=\frac{d}{2}$.

Let $ABC$ be a non-degenerate triangle with incenter $I$ and circumcircle $\Gamma$. Denote by $M_a$ the midpoint of the arc $\widehat{BC}$ of $\Gamma$ not containing $A$, and define $M_b$, $M_c$ similarly. Suppose $\triangle ABC$ has inradius $4$ and circumradius $9$. Compute the maximum possible value of \[IM_a^2+IM_b^2+IM_c^2.\][i]Proposed by David Altizio[/i]

Let $ ABCD$ be a cyclic quadrilater. Denote $ P\equal{}AD\cap BC$ and $ Q\equal{}AB \cap CD$. Let $ E$ be the fourth vertex of the parallelogram $ ABCE$ and $ F\equal{}CE\cap PQ$. Prove that $ D,E,F$ and $ Q$ lie on the same circle.

Let $\{a_n\}$ be the sequence such that $a_0=2019$ and $$a_n=-\frac{2020}{n}\sum_{k=0}^{n-1}a_k.$$ Compute the last three digits of $\sum_{n=1}^{2020}2020^na_nn$.

$O$ is the circumcenter of $ABC$, and $H$ is the orthocenter of $ABC$. If $D$ is a midpoint of $AC$ and $E$ is the intersection of $BO$ and $ABC$'s circumcircle not $B$, show that three points $H, D, E$ are collinear.

For each real number $ x$< let $ \lfloor x \rfloor$ be the integer satisfying $ \lfloor x \rfloor \le x < \lfloor x \rfloor \plus{}1$ and let $ \{x\}\equal{}x\minus{}\lfloor x \rfloor$. Let $ c$ be a real number such that \[ \{n\sqrt{3}\}>\dfrac{c}{n\sqrt{3}}\] for all positive integers $ n$. Prove that $ c \le 1$.

Consider real numbers $A$, $B$, \dots, $Z$ such that \[ EVIL = \frac{5}{31}, \; LOVE = \frac{6}{29}, \text{ and } IMO = \frac{7}{3}. \] If $OMO = \tfrac mn$ for relatively prime positive integers $m$ and $n$, find the value of $m+n$. [i]Proposed by Evan Chen[/i]

Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.

In trapezoid $ABCD$ with $AB || CD$, $\omega_1$ and $\omega_2$ are two circles with diameters $AD$ and $BC$, respectively. Let $X$ and $Y$ be two arbitrary points on $\omega_1$ and $\omega_2$, respectively. Show that the length of segment $XY$ is not more than half the perimeter of $ABCD$. [i]Proposed by Mahdi Etesami Fard[/i]

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

Let $P$ be a point inside a quadrilateral $ABCD$ such that $\angle APB+\angle CPD=180^{\circ}$. Points $P_{a}$, $P_{b}$, $P_{c},$ $P_{d}$ are isogonally conjugated to $P$ with respect to the triangles $BCD$, $CDA$, $DAB$, $ABC$ respectively. Prove that the diagonals of the quadrilaterals $ABCD$ and $P_{a}P_{b}P_{c}P_{d}$ concur. Proposed by: G.Galyapin

Each face of a cube has been divided into four equal quarters and each quarter is painted with one of three available colours. Quarters with common sides are painted with different colours . Prove that each of the available colours was used in painting $8$ quarters.

Prove that in a plane, arbitrary $ n$ points can be overlapped by discs that the sum of all the diameters is less than $ n$, and the distances between arbitrary two are greater than $ 1$. (where the distances between two discs that have no common points are defined as that the distances between its centers subtract the sum of its radii; the distances between two discs that have common points are zero)

Let $a_1, a_2, a_3, \dots, a_{20}$ be a permutation of the numbers $1, 2, \dots, 20$. How many different values can the expression $a_1-a_2+a_3-\dots - a_{20}$ have?

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

Prove that no convex $13$-gon can be cut into parallelograms.

Solve in the real numbers the equation $ 3^{x+1}=(x-1)(x-3). $

Let $ABCD$ be a trapezoid of bases $AD$ and $BC$ , with $AD> BC$, whose diagonals are cut at point $E$. Let $P$ and $Q$ be the feet of the perpendicular drawn from $E$ on the sides $AD$ and $BC$, respectively, with $P$ and $Q$ in segments $AD$ and $BC,$ respectively. Let $I$ be the center of the triangle $AED$ and let $K$ be the point of intersection of the lines $AI$ and $CD$. If $AP + AE = BQ + BE$, show that $AI = IK$.