Triangle $ABC$ has points $A$ at $\left(0,0\right)$, $B$ at $\left(9,12\right)$, and $C$ at $\left(-6,8\right)$ in the coordinate plane. Find the length of the angle bisector of $\angle{BAC}$ from $A$ to where it intersects $BC$. [i]2017 CCA Math Bonanza Lightning Round #1.3[/i]

In the future city Baltic Way there are sixteen hospitals. Every night exactly four of them must be on duty for emergencies. Is it possible to arrange the schedule in such a way that after twenty nights every pair of hospitals have been on common duty exactly once?

Let $n$ points with integer coordinates be given in the $xy$-plane. What is the minimum value of $n$ which will ensure that three of the points are the vertices of a triangel with integer (possibly, 0) area?

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

In coordinate plane, a variable point $M$, starting from the origin $O(0, 0)$, moves on the line $l$ with slope $k$, where $k$ is an irrational number. [b](i)[/b] Prove that point $O(0, 0)$ is the only rational point (namely, the coordinates of which are both rationals) on the line $l.$ [b](ii)[/b] Prove that for any number $\varepsilon > 0$, there exist integers $m, n$ such that the distance between $l$ and the point $(m, n)$ is less than $\varepsilon.$

The coordinates of the vertices of isosceles trapezoid $ABCD$ are all integers, with $A=(20,100)$ and $D=(21,107).$ The trapezoid has no horizontal or vertical sides, and $\overline{AB}$ and $\overline{CD}$ are the only parallel sides. The sum o f the absolute values of all possible slopes for $\overline{AB}$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

A ray is drawn from the origin tangent to the graph of the upper part of the hyperbola $y^2=x^2-x+1$ in the first quadrant. This ray makes an angle of $\theta$ with the positive $x$-axis. Compute $\cos\theta$.

Let $a,b,c,d$ are integers such that $(a,b)=(c,d)=1$ and $ad-bc=k>0$. Prove that there are exactly $k$ pairs $(x_{1},x_{2})$ of rational numbers with $0\leq x_{1},x_{2}<1$ for which both $ax_{1}+bx_{2},cx_{1}+dx_{2}$ are integers.

Consider the function $ f:\mathbb{R}\longrightarrow\mathbb{R} ,\quad f(x)=\max (x-3,2) . $ Find the perimeter and the area of the figure delimited by the lines $ x=-3,x=1, $ the $ Ox $ axis, and the graph of $ f. $

Square $ABCD$ in the coordinate plane has vertices at the points $A(1,1), B(-1,1), C(-1,-1),$ and $D(1,-1).$ Consider the following four transformations: [list=] [*]$L,$ a rotation of $90^{\circ}$ counterclockwise around the origin; [*]$R,$ a rotation of $90^{\circ}$ clockwise around the origin; [*]$H,$ a reflection across the $x$-axis; and [*]$V,$ a reflection across the $y$-axis. [/list] Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying $R$ and then $V$ would send the vertex $A$ at $(1,1)$ to $(-1,-1)$ and would send the vertex $B$ at $(-1,1)$ to itself. How many sequences of $20$ transformations chosen from $\{L, R, H, V\}$ will send all of the labeled vertices back to their original positions? (For example, $R, R, V, H$ is one sequence of $4$ transformations that will send the vertices back to their original positions.) $\textbf{(A)}\ 2^{37} \qquad\textbf{(B)}\ 3\cdot 2^{36} \qquad\textbf{(C)}\ 2^{38} \qquad\textbf{(D)}\ 3\cdot 2^{37} \qquad\textbf{(E)}\ 2^{39}$

In rectangle $ABCD$, $DC = 2CB$ and points $E$ and $F$ lie on $\overline{AB}$ so that $\overline{ED}$ and $\overline{FD}$ trisect $\angle ADC$ as shown. What is the ratio of the area of $\triangle DEF$ to the area of rectangle $ABCD$? [asy] draw((0, 0)--(0, 1)--(2, 1)--(2, 0)--cycle); draw((0, 0)--(sqrt(3)/3, 1)); draw((0, 0)--(sqrt(3), 1)); label("A", (0, 1), N); label("B", (2, 1), N); label("C", (2, 0), S); label("D", (0, 0), S); label("E", (sqrt(3)/3, 1), N); label("F", (sqrt(3), 1), N); [/asy] ${ \textbf{(A)}\ \ \frac{\sqrt{3}}{6}\qquad\textbf{(B)}\ \frac{\sqrt{6}}{8}\qquad\textbf{(C)}\ \frac{3\sqrt{3}}{16}\qquad\textbf{(D)}}\ \frac{1}{3}\qquad\textbf{(E)}\ \frac{\sqrt{2}}{4}$

An ant is moving on the cooridnate plane, starting form point $(0,-1)$ along a straight line until it reaches the $x$- axis at point $(x,0)$ where $x$ is a real number. After it turns $90^o$ to the left and moves again along a straight line until it reaches the $y$-axis . Then it again turns left and moves along a straight line until it reaches the $x$-axis, where it once more turns left by $90^o$ and moves along a straight line until it finally reached the $y$-axis. Can both the length of the ant's journey and distance between it's initial and final point be: (a) rational numbers ? (b) integers? Justify your answers PS. Collected [url=https://artofproblemsolving.com/community/c949609_2019_nigerian_senior_mo_round_4]here[/url]

Let $n$ be a given positive integer. Say that a set $K$ of points with integer coordinates in the plane is connected if for every pair of points $R, S\in K$, there exists a positive integer $\ell$ and a sequence $R=T_0,T_1, T_2,\ldots ,T_{\ell}=S$ of points in $K$, where each $T_i$ is distance $1$ away from $T_{i+1}$. For such a set $K$, we define the set of vectors \[\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\}\] What is the maximum value of $|\Delta(K)|$ over all connected sets $K$ of $2n+1$ points with integer coordinates in the plane? [i]Grigory Chelnokov, Russia[/i]

Prove that on a coordinate plane it is impossible to draw a closed broken line such that [list][*] coordinates of each vertex are rational, [*] the length of its every edge is equal to $1$, [*] the line has an odd number of vertices.[/list]

Find minimum value of $F(x,y)=\sqrt{(x+1)^{2}+(y-1)^{2}}+\sqrt{(x-1)^{2}+(y+1)^{2}}+\sqrt{(x+2)^{2}+(y+2)^{2}}$, where $x,y\in\mathbb{R}$.

Draw a tangent with positive slope to a parabola $y=x^2+1$. Find the $x$-coordinate such that the area of the figure bounded by the parabola, the tangent and the coordinate axisis is $\frac{11}{3}.$

Let $R=(8,6)$. The lines whose equations are $8y=15x$ and $10y=3x$ contain points $P$ and $Q$, respectively, such that $R$ is the midpoint of $\overline{PQ}$. The length of $PQ$ equals $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

During a recent campaign for office, a candidate made a tour of a country which we assume lies in a plane. On the first day of the tour he went east, on the second day he went north, on the third day west, on the fourth day south, on the fifth day east, etc. If the candidate went $n^2/2$ miles on the $n^{\text{th}}$ day of this tour, how many miles was he from his starting point at the end of the $40^{\text{th}}$ day?

Determine all real numbers $ a$ such that the inequality $ |x^2 \plus{} 2ax \plus{} 3a|\le2$ has exactly one solution in $ x$.

Let $ S $ be the first quadrant and $ T:S\longrightarrow S $ be a transformation that takes the reciprocal of the coordinates of the points that belong to its domain. Define an [i]S-line[/i] to be the intersection of a line with $ S. $ [b]a)[/b] Show that the fixed points of $ T $ lie on any fixed S-line of $ T. $ [b]b)[/b] Find all fixed S-lines of $ T. $ [i]Gabriel Popa[/i]

Lines in the xy-plane are drawn through the point $(3,4)$ and the trisection points of the line segment joining the points $(-4,5)$ and $(5,-1).$ One of these lines has the equation $\textbf{(A) }3x-2y-1=0\qquad\textbf{(B) }4x-5y+8=0\qquad\textbf{(C) }5x+2y-23=0\qquad$ $\textbf{(D) }x+7y-31=0\qquad \textbf{(E) }x-4y+13=0$

Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.

Every natural number is coloured in one of the $ k$ colors. Prove that there exist four distinct natural numbers $ a, b, c, d$, all coloured in the same colour, such that $ ad \equal{} bc$, $ \displaystyle \frac b a$ is power of 2 and $ \displaystyle \frac c a$ is power of 3.

Let $ n$ and $ m$ be given positive integers. In one move, a chess piece called an $ (n,m)$-crocodile goes $ n$ squares horizontally or vertically and then goes $ m$ squares in a perpendicular direction. Prove that the squares of an infinite chessboard can be painted in black and white so that this chess piece always moves from a black square to a white one or vice-versa.

Let points $ A = (0,0) , \ B = (1,2), \ C = (3,3), $ and $ D = (4,0) $. Quadrilateral $ ABCD $ is cut into equal area pieces by a line passing through $ A $. This line intersects $ \overline{CD} $ at point $ \left (\frac{p}{q}, \frac{r}{s} \right ) $, where these fractions are in lowest terms. What is $ p + q + r + s $? $ \textbf{(A)} \ 54 \qquad \textbf{(B)} \ 58 \qquad \textbf{(C)} \ 62 \qquad \textbf{(D)} \ 70 \qquad \textbf{(E)} \ 75 $