The tangent lines from a point $P$ meet a circle $k$ at $A$ and $B$. Let $X$ be an arbitrary point on the shorter arc $AB$, and $C$ and $D$ be the orthogonal projections of $P$ onto the lines $AX$ and $BX$, respectively. Prove that the line $CD$ passes through a fixed point $Y$ as $X$ moves along the arc $AB$.

Given two points $P,\ Q$ on the parabola $C: y=x^2-x-2$ in the $xy$ plane. Note that the $x$ coodinate of $P$ is less than that of $Q$. (a) If the origin $O$ is the midpoint of the lines　egment $PQ$, then find the equation of the line $PQ$. (b) If the origin $O$ divides internally the line segment $PQ$ by 2:1, then find the equation of $PQ$. (c) If the origin $O$ divides internally the line segment $PQ$ by 2:1, find the area of the figure bounded by the parabola $C$ and the line $PQ$.

Is there an infinite sequence of positive integers where no two terms are relatively prime, no term divides any other term, and there is no integer larger than $1$ that divides every term of the sequence?

Let \(m,n\) and \(a\) be positive integers. Lumis has \(m\) cards, each with the number \(n\) written on it, and an infinite number of cards with each of the symbols addition, subtraction, multiplication, division, opening, and closing brackets. Umbra has composed an arithmetic expression with them, whose value is a positive integer less than \(\displaystyle\frac{n}{2^m}\). Prove that if \(n\) is replaced everywhere by \(a\), then the resulting expression will have the same value as before or will be undefined due to division by zero.

For positive integers $m$ and $n$, let $d(m, n)$ be the number of distinct primes that divide both $m$ and $n$. For instance, $d(60, 126) = d(2^2 \cdot 3 \cdot 5, 2 \cdot 3^2 \cdot 7) = 2.$ Does there exist a sequence $(a_n)$ of positive integers such that: [list] [*] $a_1 \geq 2018^{2018};$ [*] $a_m \leq a_n$ whenever $m \leq n$; [*] $d(m, n) = d(a_m, a_n)$ for all positive integers $m\neq n$? [/list] [i](Dominic Yeo, United Kingdom)[/i]

Let $A_1B_1C_1D_1E_1$ be a regular pentagon.For $ 2 \le n \le 11$, let $A_nB_nC_nD_nE_n$ be the pentagon whose vertices are the midpoint of the sides $A_{n-1}B_{n-1}C_{n-1}D_{n-1}E_{n-1}$. All the $5$ vertices of each of the $11$ pentagons are arbitrarily coloured red or blue. Prove that four points among these $55$ points have the same colour and form the vertices of a cyclic quadrilateral.

Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

Let $\tau(n)$ be the number of positive divisors of a natural number $n$, and $\sigma(n)$ be their sum. Find the largest real number $\alpha$ such that \[\frac{\sigma(n)}{\tau(n)}\ge\alpha \sqrt{n}\] for all $n \ge 1$.

Given a set $S$ consisting of two undefined elements "pib" and "maa", and the four postulates: $P_1$: Every pib is a collection of maas, $P_2$: Any two distinct pibs have one and only one maa in common, $P_3$: Every maa belongs to two and only two pibs, $P_4$: There are exactly four pibs. Consider the three theorems: $T_1$: There are exactly six maas, $T_2$: There are exactly three maas in each pib, $T_3$: For each maa there is exactly one other maa not in the same pid with it. The theorems which are deducible from the postulates are: $\textbf{(A)}\ T_3 \; \text{only}\qquad \textbf{(B)}\ T_2 \; \text{and} \; T_3 \; \text{only} \qquad \textbf{(C)}\ T_1 \; \text{and} \; T_2 \; \text{only}\\ \textbf{(D)}\ T_1 \; \text{and} \; T_3 \; \text{only}\qquad \textbf{(E)}\ \text{all}$

Find the smallest positive integer $n$ such that there exists a prime $p$ where $p$ and $p + 10$ both divide $n$ and the sum of the digits of $n$ is $p$.

Let $f_1(x)$ be a polynomial of degree $2$ with the leading coefficient positive and $f_{n+1}(x) =f_1(f_n(x))$ for $n\ge 1.$ Prove that if the equation $f_2(x)=0$ has four different non-positive real roots, then for arbitrary $n$ then $f_n(x)$ has $2^n$ different real roots.

The $ABCD$ is a cyclic quadrilateral with no parallel sides inscribed in circle $(O, R)$. Let $E$ be the intersection of two diagonals and the angle bisector of $AEB$ cut the lines $AB, BC, CD, DA$ at $M, N, P, Q$ respectively . a) Prove that the circles $(AQM), (BMN), (CNP), (DPQ)$ are passing through a point. Call that point $K$. b) Denote $min \,\{AC, BD\} = m$. Prove that $OK \le \dfrac{2R^2}{\sqrt{4R^2-m^2}}$.

Let $\Gamma$ be the circumcircle of $\triangle ABC$. Let $D$ be a point on the side $BC$. The tangent to $\Gamma$ at $A$ intersects the parallel line to $BA$ through $D$ at point $E$. The segment $CE$ intersects $\Gamma$ again at $F$. Suppose $B$, $D$, $F$, $E$ are concyclic. Prove that $AC$, $BF$, $DE$ are concurrent.

Find the sum of the two smallest possible values of $x^\circ$ (in degrees) that satisfy the following equation if $x$ is greater than $2017^\circ$: $$\cos^59x+\cos^5x=32\cos^55x\cos^54x+5\cos^29x\cos^2x\left(\cos9x+\cos x\right).$$ [i]2017 CCA Math Bonanza Individual Round #10[/i]

Let $ABC$ be a non-degenerate triangle inscribed in a circle, such that $AB$ is the diameter of the circle. Let the angle bisectors of the angles at $A$ and $B$ meet at $P.$ Determine the maximum possible value of $\angle APB,$ in degrees.

Suppose $m$ and $n$ are positive integers for which $\bullet$ the sum of the first $m$ multiples of $n$ is $120$, and $\bullet$ the sum of the first $m^3$ multiples of$ n^3$ is $4032000$. Determine the sum of the first $m^2$ multiples of $n^2$

There are $n$ stone piles each consisting of $2018$ stones. The weight of each stone is equal to one of the numbers $1, 2, 3, ...25$ and the total weights of any two piles are different. It is given that if we choose any two piles and remove the heaviest and lightest stones from each of these piles then the pile which has the heavier one becomes the lighter one. Determine the maximal possible value of $n$.

On the plane there is an image of a circle with a marked center. Let an arbitrary angle be drawn on this plane. Using one ruler, construct the bisector of this angle.

Let $n$ be a positive integer and let $\triangle$ be the closed triangular domain with vertices at the lattice points $(0, 0), (n, 0)$ and $(0, n)$. Determine the maximal cardinality a set $S$ of lattice points in $\triangle$ may have, if the line through every pair of distinct points in $S$ is parallel to no side of $\triangle$.

Suppose there are $160$ pigeons and $n$ holes. The $1$st pigeon flies to the $1$st hole, the $2$nd pigeon flies to the $4$th hole, and so on, such that the $i$th pigeon flies to the $(i^2\text{ mod }n)$th hole, where $k\text{ mod }n$ is the remainder when $k$ is divided by $n$. What is minimum $n$ such that there is at most one pigeon per hole? [i]Proposed by Christina Yao[/i]

Given $f,g\in L^1[0,1]$ and $\int_0^1 f = \int_0^1 g=1$, prove that there exists an interval I st $\int_I f = \int_I g=\frac12$.

On the inside of a square with side length 60, construct four congruent isosceles triangles each with base 60 and height 50, and each having one side coinciding with a different side of the square. Find the area of the octagonal region common to the interiors of all four triangles.

A contractor estimated that one of his two bricklayers would take $9$ hours to build a certain wall and the other $10$ hours. However, he knew from experience that when they worked together, their combined output fell by $10$ bricks per hour. Being in a hurry, he put both men on the job and found that it took exactly 5 hours to build the wall. The number of bricks in the wall was $\textbf{(A) }500\qquad\textbf{(B) }550\qquad\textbf{(C) }900\qquad\textbf{(D) }950\qquad \textbf{(E) }960$

For $n \geq 3$ find the eigenvalues (with their multiplicities) of the $n \times n$ matrix $$\begin{bmatrix} 1 & 0 & 1 & 0 & 0 & 0 & \dots & \dots & 0 & 0\\ 0 & 2 & 0 & 1 & 0 & 0 & \dots & \dots & 0 & 0\\ 1 & 0 & 2 & 0 & 1 & 0 & \dots & \dots & 0 & 0\\ 0 & 1 & 0 & 2 & 0 & 1 & \dots & \dots & 0 & 0\\ 0 & 0 & 1 & 0 & 2 & 0 & \dots & \dots & 0 & 0\\ 0 & 0 & 0 & 1 & 0 & 2 & \dots & \dots & 0 & 0\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots & & \vdots & \vdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & & \ddots & \vdots & \vdots\\ 0 & 0 & 0 & 0 & 0 & 0 & \dots & \dots & 2 & 0\\ 0 & 0 & 0 & 0 & 0 & 0 & \dots & \dots & 0 & 1 \end{bmatrix}$$

Find all functions $f:\mathbb Z_{>0}\to \mathbb Z_{>0}$ such that $a+f(b)$ divides $a^2+bf(a)$ for all positive integers $a$ and $b$ with $a+b>2019$.