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 $a_1, a_2, . . ., a_n$ be a finite sequence of $0$ and $1$. Under any two consecutive terms of this sequence $0$ is written if the digits are equal and $1$ is written otherwise. This way a new sequence of length $n -1$ is obtained. By repeating this procedure $n - 1$ times one obtains a triangular table of $0$ and $1$. Find the maximum possible number of ones that can appear on this table

There is a lighthouse on a small island. Its lamp enlights a segment of a sea to the distance $a$. The light is turning uniformly, and the end of the segment moves with the speed $v$. Prove that a ship, whose speed doesn't exceed $v/8$ cannot arrive to the island without being enlightened.

Let $T$ be an isosceles right triangle. Let $S$ be the circle such that the difference in the areas of $T \cup S$ and $T \cap S$ is the minimal. Prove that the centre of $S$ divides the altitude drawn on the hypotenuse of $T$ in the golden ratio (i.e., $\frac{(1 + \sqrt{5})}{2}$)

Let $ ABC$ be an isoceles triangle with $ AC\equal{}BC$. A point $ P$ lies inside $ ABC$ such that \[ \angle PAB \equal{} \angle PBC, \angle PAC \equal{} \angle PCB.\] Let $ M$ be the midpoint of $ AB$ and $ K$ be the intersection of $ BP$ and $ AC$. Prove that $ AP$ and $ PK$ trisect $ \angle MPC$.

Solve for $x$ if $20x + 21 = 121$. $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }7$

Figures $I$, $II$, and $III$ are squares. The perimeter of $I$ is $12$ and the perimeter of $II$ is $24$. The perimeter of $III$ is [asy] draw((0,0)--(15,0)--(15,6)--(12,6)--(12,9)--(0,9)--cycle); draw((9,0)--(9,9)); draw((9,6)--(12,6)); label("$III$",(4.5,4),N); label("$II$",(12,2.5),N); label("$I$",(10.5,6.75),N); [/asy] $\text{(A)}\ 9 \qquad \text{(B)}\ 18 \qquad \text{(C)}\ 36 \qquad \text{(D)}\ 72 \qquad \text{(D)}\ 81$

Let the two tangents from a point $A$ outside a circle $k$ touch $k$ at $M$ and $N$. A line $p$ through $A$ intersects $k$ at $B$ and $C$, and $D$ is the midpoint of $MN$. Prove that $MN$ bisects the angle $BDC$

The vertices of a convex $2550$-gon are colored black and white as follows: black, white, two black, two white, three black, three white, ..., 50 black, 50 white. Dania divides the polygon into quadrilaterals with diagonals that have no common points. Prove that there exists a quadrilateral among these, in which two adjacent vertices are black and the other two are white. [i]D. Rudenko[/i]

Let $N$ be a given positive integer. Consider a permutation of $1,2,3,\cdots,N$, denoted as $p_1,p_2,\cdots,p_N$. For a section $p_l, p_{l+1},\cdots, p_r$, we call it "extreme" if $p_l$ and $p_r$ are the maximum and minimum value of that section. We say a permutation $p_1,p_2,\cdots,p_N$ is "super balanced" if there isn't an "extreme" section with a length at least $3$. For example, $1,4,2,3$ is "super balanced", but $3,1,2,4$ isn't. Please answer the following questions: 1. How many "super balanced" permutations are there? 2. For each integer $M\leq N$. How many "super balanced" permutations are there such that $p_1=M$? [i]Proposed by ltf0501[/i]

Let $BC=6$, $BX=3$, $CX=5$, and let $F$ be the midpoint of $\overline{BC}$. Let $\overline{AX}\perp\overline{BC}$ and $AF=\sqrt{247}$. If $AC$ is of the form $\sqrt{b}$ and $AB$ is of the form $\sqrt{c}$ where $b$ and $c$ are nonnegative integers, find $2c+3b$.

Show that $\frac{(x - y)^7 + (y - z)^7 + (z - x)^7 - (x - y)(y - z)(z - x) ((x - y)^4 + (y - z)^4 + (z - x)^4)} {(x - y)^5 + (y - z)^5 + (z - x)^5} \ge 3$ holds for all triples of distinct integers $x, y, z$. When does equality hold?

Carissa is crossing a very, very, very wide street, and did not properly check both ways before doing so. (Don't be like Carissa!) She initially begins walking at $2$ feet per second. Suddenly, she hears a car approaching, and begins running, eventually making it safely to the other side, half a minute after she began crossing. Given that Carissa always runs $n$ times as fast as she walks and that she spent $n$ times as much time running as she did walking, and given that the street is $260$ feet wide, find Carissa's running speed, in feet per second. [i]Proposed by Andrew Wu[/i]

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

Suppose $a, b$ are integers and $a+b$ is a root of $x^2 +ax+b = 0$. What is the maximum possible value of $b^2$?

It is possible to place an even number of pears in a row such that the masses of any two neighbouring pears differ by at most $1$ gram. Prove that it is then possible to put the pears two in a bag and place the bags in a row such that the masses of any two neighbouring bags differ by at most $1$ gram.

The numbers $a,b,c$ are the digits of a three digit number which satisfy $49a+7b+c = 286$. What is the three digit number $(100a+10b+c)$?

Compute \[\sum_{i=0}^{\frac{q-1}{2}}\left\lfloor\frac{ip}{q}\right\rfloor+\sum_{j=0}^{\frac{p-1}{2}}\left\lfloor\frac{jq}{p}\right\rfloor\] if $p=51$ and $q=81$. [i]2018 CCA Math Bonanza Team Round #7[/i]

Let $S$ be a finite set of cells in a square grid. On each cell of $S$ we place a grasshopper. Each grasshopper can face up, down, left or right. A grasshopper arrangement is Asturian if, when each grasshopper moves one cell forward in the direction in which it faces, each cell of $S$ still contains one grasshopper. [list] [*] Prove that, for every set $S$, the number of Asturian arrangements is a perfect square. [*] Compute the number of Asturian arrangements if $S$ is the following set:

Denote $\textrm{SL}_2 (\mathbb{Z})$ and $\textrm{SL}_3 (\mathbb{Z})$ the sets of matrices with $2$ rows and $2$ columns, respectively with $3$ rows and $3$ columns, with integer entries and their determinant equal to $1$. $\textbf{(a)}$ Let $N$ be a positive integer and let $g$ be a matrix with $3$ rows and $3$ columns, with rational entries. Suppose that for each positive divisor $M$ of $N$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $N$ and a matrix $\gamma_M \in \textrm{SL}_3 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & M^{} \end{array}\right) . \] Moreover, if $q_1 = 1$, prove that $\det (g) = N$ and $g$ has the following shape: \[ g = \left(\begin{array}{ccc} a_{11} & a_{12} & Na_{13}\\ a_{21} & a_{22} & Na_{23}\\ Na_{31} & Na_{32} & Na_{33} \end{array}\right), \] where $a_{ij}$ are all integers, $i, j \in \{ 1, 2, 3 \} .$ $\textbf{(b)}$ Provide an example of a matrix $g$ with $2$ rows and $2$ columns which satisfies the following properties: $\bullet$ For each positive divisor $M$ of $6$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $6$ and a matrix $\gamma_M \in \textrm{SL}_2 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{cc} 1 & 0\\ 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{cc} 1 & 0\\ 0 & M^{} \end{array}\right) \] and $q_1 = 1$. $\bullet$ $g$ does not have its determinant equal to $6$ and is not of the shape \[ g = \left(\begin{array}{cc} a_{22} & 6 a_{23}\\ 6 a_{32} & 6 a_{33} \end{array}\right), \] where $a_{ij}$ are all positive integers, $i, j \in \{ 2, 3 \}$. [i](Radu Toma)[/i]

A right that passes through the incircle $ I$ of the triangle $ \Delta ABC$ intersects the side $ AB$ and $ CA$ in $ P$, respective $ Q$. We denote $ BC\equal{}a\ , \ AC\equal{}b\ ,\ AB\equal{}c$ and $ \frac{PB}{PA}\equal{}p\ ,\ \frac{QC}{QA}\equal{}q$. i) Prove that: \[ a(1\plus{}p)\cdot \overrightarrow{IP}\equal{}(a\minus{}pb)\overrightarrow{IB}\minus{}pc\overrightarrow{IC}\] ii) Show that $ a\equal{}bp\plus{}cq$. iii) If $ a^2\equal{}4bcpq$, then the rights $ AI\ ,\ BQ$ and $ CP$ are concurrents.

Let $f:\mathbb R\to\mathbb R$ be a continuous function. Do there exist continuous functions $g:\mathbb R\to\mathbb R$ and $h:\mathbb R\to\mathbb R$ such that $f(x)=g(x)\sin x+h(x)\cos x$ holds for every $x\in\mathbb R$?

An [i]augmentation[/i] on a graph $G$ is defined as doing the following: - Take some set $D$ of vertices in $G$, and duplicate each vertex $v_i \in D$ to create a new vertex $v_i'$. - If there's an edge between a pair of vertices $v_i, v_j \in D$, create an edge between vertices $v_i'$ and $v_j'$. If there's an edge between a pair of vertices $v_i \in D$, $v_j \notin D$, you can choose to create an edge between $v_i'$ and $v_j$ but do not have to. A graph is called [i]reachable[/i] from $G$ if it can be created through some sequence of augmentations on $G$. Some graph $H$ has $n$ vertices and satisfies that both $H$ and the complement of $H$ are reachable from a complete graph of $2021$ vertices. If the maximum and minimum values of $n$ are $M$ and $m$, find $M+m$. [i]Proposed by Oliver Hayman[/i]

Let $ABCD$ be a trapezium with $AD||BC$; and let $X$ and $Y$ be the midpoints of $AC$ and $BD$ respectively. Prove that if $\angle DAY=\angle CAB$ then the internal bisectors of $\angle XAY$ and $\angle XBY$ meet on $XY$. Proposed by Belur Jana Venkatachala

Let $n$ be positive integer and let $a_1, a_2,...,a_n$ be real numbers. Prove that there exist positive integers $m, k$ $<=n$ , $|$ $(a_1+a_2+...+a_m)$ $-$ $(a_{m+1}+a_{m+2}+...+a_n)$ $|$ $<=$ $|$ $a_k$ $|$