A straight line passing through the point $(0,4)$ is perpendicular to the line $x-3y-7=0$. Its equation is: $\textbf{(A)}\ y+3x-4=0 \qquad \textbf{(B)}\ y+3x+4=0 \qquad \textbf{(C)}\ y-3x-4=0 \qquad\\ \textbf{(D)}\ 3y+x-12=0 \qquad \textbf{(E)}\ 3y-x-12=0 $

Let $ABC$ be a triangle with $AB < AC$, incenter $I$, and $A$ excenter $I_{A}$. The incircle meets $BC$ at $D$. Define $E = AD\cap BI_{A}$, $F = AD\cap CI_{A}$. Show that the circumcircle of $\triangle AID$ and $\triangle I_{A}EF$ are tangent to each other

For each positive integer $n$, let $I_n$ denote the number of integers $p$ for which $50^n<7^p<50^{n+1}$. (a) Prove that, for each $n$, $I_n$ is either $2$ or $3$. (b) Prove that $I_n=3$ for infinitely many $n\in\mathbb N$, and find at least one such $n$.

$64$ teams with distinct skill levels participate in a knockout tournament. In each of the $6$ rounds, teams are paired into match-ups and compete; the winning team moves on to the next round and the losing team is eliminated. After the second-to-last round, winners compete for first and second and losers compete for third and fourth. Assume that the team with higher skill level always wins. What is the probability that the first, second, and third place teams have the highest, second highest, and third highest skill levels, respectively? [i]2019 CCA Math Bonanza Lightning Round #3.3[/i]

Circle $k$ passes through $A$ and intersects the sides of $\Delta ABC$ in $P,Q$, and $L$. Prove that: $\frac{S_{PQL}}{S_{ABC}}\leq \frac{1}{4} (\frac{PL}{AQ})^2$.

$\triangle ABC$ has side lengths $AB=15$, $BC=34$, and $CA=35$. Let the circumcenter of $ABC$ be $O$. Let $D$ be the foot of the perpendicular from $C$ to $AB$. Let $R$ be the foot of the perpendicular from $D$ to $AC$, and let $W$ be the perpendicular foot from $D$ to $BC$. Find the area of quadrilateral $CROW$.

Let $A = (a_1, a_2, \ldots, a_{2001})$ be a sequence of positive integers. Let $m$ be the number of 3-element subsequences $(a_i,a_j,a_k)$ with $1 \leq i < j < k \leq 2001$, such that $a_j = a_i + 1$ and $a_k = a_j + 1$. Considering all such sequences $A$, find the greatest value of $m$.

A token is placed at each vertex of a regular $2n$-gon. A [i]move[/i] consists in choosing an edge of the $2n$-gon and swapping the two tokens placed at the endpoints of that edge. After a finite number of moves have been performed, it turns out that every two tokens have been swapped exactly once. Prove that some edge has never been chosen.

Using each of the digits $1,2,3,\ldots ,8,9$ exactly once,we form nine,not necassarily distinct,nine-digit numbers.Their sum ends in $n$ zeroes,where $n$ is a non-negative integer.Determine the maximum possible value of $n$.

Let $P$ be a polynomial with integer coefficients. Suppose that for $n=1,2,3,\ldots ,1998$ the number $P(n)$ is a three-digit positive integer. Prove that the polynomial $P$ has no integer roots.

Let $ABCD$ be a trapezoid such that $AB \parallel CD$, $|AB|<|CD|$, and $\text{Area}(ABC)=30$. Let the line through $B$ parallel to $AD$ meet $[AC]$ at $E$. If $|AE|:|EC|=3:2$, then what is the area of trapezoid $ABCD$? $ \textbf{(A)}\ 45 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 72 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 90 $

A kite is a quadrilateral with $2$ pairs of equal adjacent sides. Given a cyclic kite with side lengths $3$ and $4$, compute the distance between the intersection of its diagonals and the center of the circle circumscribing it.

Determine all Functions $f:\mathbb{Z} \to \mathbb{Z}$ such that $f(f(a)-b)+bf(2a)$ is a perfect square for all integers $a$ and $b$.

How many solutions does the equation $\sin \left( \frac{\pi}2 \cos x\right)=\cos \left( \frac{\pi}2 \sin x\right)$ have in the closed interval $[0,\pi]$? $\textbf{(A) }0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3\qquad \textbf{(E) }4$

Let $\phi = \frac{1+\sqrt{5}}{2}$. A [i]base-$\phi$ number[/i] $(a_n a_{n-1} ... a_1 {a_0})_{\phi}$, where $0 \le a_n, a_{n-1}, ..., a_0 \le 1$ are integers, is defined by \[ (a_n a_{n-1} ... a_1 {a_0})_{\phi} = a_n \cdot \phi^n + a_{n-1} \cdot \phi^{n-1} + ... + a_1 \cdot \phi^1 + a_0. \] Compute the number of base-$\phi$ numbers $(b_jb_{j-1}... b_1{b_0})_\phi$ which satisfy $b_j \ne 0$ and \[ (b_jb_{j-1}... b_1{b_0})_\phi = \underbrace{(100 ... 100)_\phi}_{\text{Twenty}\ 100's}. \][i]Proposed by Yang Liu[/i]

Let $f(n)$ be the smallest number of 1s needed to represent the positive integer $n$ using only 1s, $+$ signs, $\times$ signs and brackets $(,)$. For example, you could represent 80 with 13 1s as follows: $(1+1+1+1+1)(1+1+1+1)(1+1+1+1)$. Show that $3 \log(n) \leq \log(3)f(n) \leq 5 \log(n)$ for $n > 1$.

Inside the triangle $ ABC $ a point $ M $ is given. The line $ BM $ meets the side $ AC $ at $ N $. The point $ K $ is symmetrical to $ M $ with respect to $ AC $. The line $ BK $ meets $ AC $ at $ P $. If $ \angle AMP = \angle CMN $, prove that $ \angle ABP=\angle CBN $.

Let $p$ be the probability that, in the process of repeatedly flipping a fair coin, one will encounter a run of 5 heads before one encounters a run of 2 tails. Given that $p$ can be written in the form $m/n$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Let $p>1,\frac1p+\frac1q=1$ and $r>1$. If $u(x,y),v(x,y)>0$, and $f(x,y),g(x,y)$ are continuous functions on $[a,b]\times[c,d]$, then prove $$\left(\frac{\left(\int^b_a\int^d_c(f(x,y)+g(x,y))^rdxdy\right)^{1/r}}{(u(x,y)+v(x,y))^{1/q}}\right)^p\le\left(\frac{\left(\int^b_a\int^d_cf(x,y)^rdxdy\right)^{1/r}}{u(x,y)^{1/q}}\right)^p+\left(\frac{\left(\int^b_a\int^d_cg(x,y)^rdxdy\right)^{1/r}}{v(x,y)^{1/q}}\right)^p,$$ with equality if and only if either $$\left(\lVert f(x,y)\rVert^r_r,\lVert g(x,y)\rVert^r_r\right)=\alpha\left(\lVert u(x,y)\rVert^r_r,\lVert v(x,y)\rVert^r_r\right)$$ for some $\alpha>0$ or $\lVert f(x,y)\rVert^r_r=\lVert g(x,y)\rVert^r_r=0$. [i]Proposed by Chang-Jian Zhao[/i]

An alien with four feet wants to wear four identical socks and four identical shoes, where on each foot a sock must be put on before a shoe. How many ways are there for the alien to wear socks and shoes?

A bored student walks down a hallway where there is a row of closed lockers, numbered from $1$ to $1024$. Opens cabinet No. $1$, then skips one cabinet and opens the next, and so on successively. When he reaches the end of the row, he turns around and starts again: he opens the first cabinet it finds closed, he skips the next closed cabinet and so on until the start from the hallway. goes from beginning to end, from end to beginning of the corridor until all the cabinets are left open. What is the number of the last cabinet he opened?

$\Delta ABC$ is right-angled at $B$, with $AB=1$ and $BC=3$. $E$ is the foot of perpendicular from $B$ to $AC$. $BA$ and $BE$ are produced to $D$ and $F$ respectively such that $D$, $F$, $C$ are collinear and $\angle DAF=\angle BAC$. Find the length of $AD$.

We are given a polyhedron with at least $5$ vertices, such that exactly $3$ edges meet in each of the vertices. Prove that we can assign a rational number to every vertex of the given polyhedron such that the following conditions are met: $(i)$ At least one of the numbers assigned to the vertices is equal to $2020$. $(ii)$ For every polygonal face, the product of the numbers assigned to the vertices of that face is equal to $1$.

What is the area of a triangle with side lengths $17$, $25$, and $26$? [i]2019 CCA Math Bonanza Lightning Round #3.2[/i]

The number $A$ is a product of $n$ distinct natural numbers. Prove that $A$ has at least $\frac{n(n-1)}{2}+1$ distinct divisors (including 1 and $A$).