Let $\Gamma$ be the circumcircle of triangle $ABC$. The line parallel to $AC$ passing through $B$ meets $\Gamma$ at $D$ ($D\neq B$), and the line parallel to $AB$ passing through $C$ intersects $\Gamma$ to $E$ ($E\neq C$). Lines $AB$ and $CD$ meet at $P$, and lines $AC$ and $BE$ meet at $Q$. Let $M$ be the midpoint of $DE$. Line $AM$ meets $\Gamma$ at $Y$ ($Y\neq A$) and line $PQ$ at $J$. Line $PQ$ intersects the circumcircle of triangle $BCJ$ at $Z$ ($Z\neq J$). If lines $BQ$ and $CP$ meet each other at $X$, show that $X$ lies on the line $YZ$.

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for every prime number $p$ and natural number $x$, $$\{ x,f(x),\cdots f^{p-1}(x) \} $$ is a complete residue system modulo $p$. With $f^{k+1}(x)=f(f^k(x))$ for every natural number $k$ and $f^1(x)=f(x)$. [i]Proposed by IndoMathXdZ[/i]

In the figure below $\angle$LAM = $\angle$LBM = $\angle$LCM = $\angle$LDM, and $\angle$AEB = $\angle$BFC = $\angle$CGD = 34 degrees. Given that $\angle$KLM = $\angle$KML, find the degree measure of $\angle$AEF. This is #8 on the 2015 Purple comet High School. For diagram go to http://www.purplecomet.org/welcome/practice

Let $n>k \geq 1$ be integers and let $p$ be a prime dividing $\tbinom{n}{k}$. Prove that the $k$-element subsets of $\{1,\ldots,n\}$ can be split into $p$ classes of equal size, such that any two subsets with the same sum of elements belong to the same class. [i]Ankan Bhattacharya[/i]

We divide up the plane into disjoint regions using a circle, a rectangle and a triangle. What is the greatest number of regions that we can get?

Let the incircle $k$ of the triangle $ABC$ touch its side $BC$ at $D$. Let the line $AD$ intersect $k$ at $L \neq D$ and denote the excentre of $ABC$ opposite to $A$ by $K$. Let $M$ and $N$ be the midpoints of $BC$ and $KM$ respectively. Prove that the points $B, C, N,$ and $L$ are concyclic.

Let $V$ be a set of $2019$ points in space where any of the four points are not on the same plane, and $E$ be the set of edges connected between them. Find the smallest positive integer $n$ satisfying the following condition: if $E$ has at least $n$ elements, then there exists $908$ two-element subsets of $E$ such that [list][*]The two edges in each subset share a common vertice, [*]Any of the two subsets do not intersect.[/list]

Let $M$ be the set of positive odd integers. For every positive integer $n$, denote $A(n)$ the number of the subsets of $M$ whose sum of elements equals $n$. For instance, $A(9) = 2$, because there are exactly two subsets of $M$ with the sum of their elements equal to $9$: $\{9\}$ and $\{1, 3, 5\}$. a) Prove that $A(n) \le A(n + 1)$ for every integer $n \ge 2$. b) Find all the integers $n \ge 2$ such that $A(n) = A(n + 1)$

A circumscribed quadrilateral $ABCD$ is given. It is known that $\angle{ACB} = \angle{ACD}$. On the angle bisector of $\angle{C}$, a point $E$ is marked such that $AE \bot BD$. Point $F$ is the foot of the perpendicular line from point $E$ to the side $BC$. Prove that $AB = BF$.

A multiple choice examination consists of $20$ questions. The scoring is $+5$ for each correct answer, $-2$ for each incorrect answer, and $0$ for each unanswered question. John's score on the examination is $48$. What is the maximum number of questions he could have answered correctly? $\text{(A)}\ 9 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 16$

For which integers $ n>1$ do there exist natural numbers $ b_1,b_2,\ldots,b_n$ not all equal such that the number $ (b_1\plus{}k)(b_2\plus{}k)\cdots(b_n\plus{}k)$ is a power of an integer for each natural number $ k$? (The exponents may depend on $ k$, but must be greater than $ 1$)

In the isosceles triangle $ABC$ ($AC = BC$) point $O$ is the circumcenter, $I$ the incenter, and $D$ lies on $BC$ so that lines $OD$ and $BI$ are perpendicular. Prove that $ID$ and $AC$ are parallel. [i]M. Sonkin[/i]

Two circles $S_1$ and $S_2$ touch externally at $F$. their external common tangent touches $S_1$ at $A$ and $S_2$ at $B$. A line, parallel to $AB$ and tangent to $S_2$ at $C$, intersects $S_1$ at $D$ and $E$. Prove that points $A,F,C$ are collinear. (A. Kalinin)

A paper equilateral triangle $ABC$ has side length $12$. The paper triangle is folded so that vertex $A$ touches a point on side $\overline{BC}$ a distance $9$ from point $B$. The length of the line segment along which the triangle is folded can be written as $\frac{m\sqrt{p}}{n}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$. [asy] import cse5; size(12cm); pen tpen = defaultpen + 1.337; real a = 39/5.0; real b = 39/7.0; pair B = MP("B", (0,0), dir(200)); pair A = MP("A", (9,0), dir(-80)); pair C = MP("C", (12,0), dir(-20)); pair K = (6,10.392); pair M = (a*B+(12-a)*K) / 12; pair N = (b*C+(12-b)*K) / 12; draw(B--M--N--C--cycle, tpen); draw(M--A--N--cycle); fill(M--A--N--cycle, mediumgrey); pair shift = (-20.13, 0); pair B1 = MP("B", B+shift, dir(200)); pair A1 = MP("A", K+shift, dir(90)); pair C1 = MP("C", C+shift, dir(-20)); draw(A1--B1--C1--cycle, tpen);[/asy]

Let $n$ be a fixed positive integer. We have a $n\times n$ chessboard. We call a pair of cells [b]good[/b] if they share a common vertex (May be common edge or common vertex). How many [b]good[/b] pairs are there on this chessboard?

Determine the smallest integer $n \ge 3$ with the property that you can choose two of the numbers $1,2,\dots, n$ in such a way that their product is equal to the sum of the other $n - 2$ languages. What are the two numbers?