Two ships sail on the sea with constant speeds and fixed directions. It is known that at $9:00$ the distance between them was $20$ miles; at $9:35$, $15$ miles; and at $9:55$, $13$ miles. At what moment were the ships the smallest distance from each other, and what was that distance ?

For every real number $ a, $ define the set $ A_a=\left\{ n\in\{ 0\}\cup\mathbb{N}\bigg|\sqrt{n^2+an}\in\{ 0\}\cup\mathbb{N}\right\} . $ [b]a)[/b] Show the equivalence: $ \# A_a\in\mathbb{N}\iff a\neq 0, $ where $ \# B $ is the cardinal of $ B. $ [b]b)[/b] Determine $ \max A_{40} . $

Prove that there do not exist natural numbers $x$ and $y$ with $x>1$ such that , \[ \frac{x^7-1}{x-1}=y^5+1 \]

$f(x),g(x),h(x)$ are square trinomials with discriminant, that equals $2$. And $f(x)+g(x),f(x)+h(x),g(x)+h(x)$ are square trinomials with discriminant, that equals $1$. Prove,that $f(x)+g(x)+h(x)$ has not roots.

Given a positive integer $A$ written in decimal expansion: $(a_{n},a_{n-1}, \ldots, a_{0})$ and let $f(A)$ denote $\sum^{n}_{k=0} 2^{n-k}\cdot a_k$. Define $A_1=f(A), A_2=f(A_1)$. Prove that: [b]I.[/b] There exists positive integer $k$ for which $A_{k+1}=A_k$. [b]II.[/b] Find such $A_k$ for $19^{86}.$

Let $ABCD$ be a cyclic quadrilateral. Let $E$ and $F$ be variable points on the sides $AB$ and $CD$, respectively, such that $AE:EB=CF:FD$. Let $P$ be the point on the segment $EF$ such that $PE:PF=AB:CD$. Prove that the ratio between the areas of triangles $APD$ and $BPC$ does not depend on the choice of $E$ and $F$.

Let $a_1<a_2<a_3<\dots$ be positive integers such that $a_{k+1}$ divides $2(a_1+a_2+\dots+a_k)$ for every $k\geqslant 1$. Suppose that for infinitely many primes $p$, there exists $k$ such that $p$ divides $a_k$. Prove that for every positive integer $n$, there exists $k$ such that $n$ divides $a_k$.

Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.

Nicolas is planning to send a package to his friend Anton, who is a stamp collector. To pay for the postage, Nicolas would like to cover the package with a large number of stamps. Suppose he has a collection of 5-cent, 10-cent, and 25-cent stamps, with exactly 20 of each type. What is the greatest number of stamps Nicolas can use to make exactly $\$7.10$ in postage? (Note: The amount $\$7.10$ corresponds to 7 dollars and 10 cents. One dollar is worth 100 cents.) $\textbf{(A)}\ 45 \qquad \textbf{(B)}\ 46 \qquad \textbf{(C)}\ 51 \qquad \textbf{(D)}\ 54 \qquad \textbf{(E)}\ 55$

[b]p1.[/b] You are on a flat planet. There are $100$ cities at points $x = 1, ..., 100$ along the line $y = -1$, and another $100$ cities at points $x = 1, ... , 100$ along the line $y = 1$. The planet’s terrain is scalding hot, and you cannot walk over it directly. Instead, you must cross archways from city to city. There are archways between all pairs of cities with different $y$ coordinates, but no other pairs: for instance, there is an archway from $(1, -1)$ to $(50, 1)$, but not from $(1, -1)$ to $(50, -1)$. The amount of “effort” necessary to cross an archway equals the square of the distance between the cities it connects. You are at $(1, -1)$, and you want to get to $(100, -1)$. What is the least amount of effort this journey can take? [b]p2.[/b] Let $f(x) = x^4 + ax^3 + bx^2 + cx + 25$. Suppose $a, b, c$ are integers and $f(x)$ has $4$ distinct integer roots. Find $f(3)$. [b]p3.[/b] Frankenstein starts at the point $(0, 0, 0)$ and walks to the point $(3, 3, 3)$. At each step he walks either one unit in the positive $x$-direction, one unit in the positive $y$-direction, or one unit in the positive $z$-direction. How many distinct paths can Frankenstein take to reach his destination? [b]p4.[/b] Let $ABCD$ be a rectangle with $AB = 20$, $BC = 15$. Let $X$ and $Y$ be on the diagonal $\overline{BD}$ of $ABCD$ such that $BX > BY$ . Suppose $A$ and $X$ are two vertices of a square which has two sides on lines $\overline{AB}$ and $\overline{AD}$, and suppose that $C$ and $Y$ are vertices of a square which has sides on $\overline{CB}$ and $\overline{CD}$. Find the length $XY$ . [img]https://cdn.artofproblemsolving.com/attachments/2/8/a3f7706171ff3c93389ff80a45886e306476d1.png[/img] [b]p5.[/b] $n \ge 2$ kids are trick-or-treating. They enter a haunted house in a single-file line such that each kid is friends with precisely the kids (or kid) adjacent to him. Inside the haunted house, they get mixed up and out of order. They meet up again at the exit, and leave in single file. After leaving, they realize that each kid (except the first to leave) is friends with at least one kid who left before him. In how many possible orders could they have left the haunted house? [b]p6.[/b] Call a set $S$ sparse if every pair of distinct elements of S differ by more than $1$. Find the number of sparse subsets (possibly empty) of $\{1, 2,... , 10\}$. [b]p7.[/b] How many ordered triples of integers $(a, b, c)$ are there such that $1 \le a, b, c \le 70$ and $a^2 + b^2 + c^2$ is divisible by $28$? [b]p8.[/b] Let $C_1$, $C_2$ be circles with centers $O_1$, $O_2$, respectively. Line $\ell$ is an external tangent to $C_1$ and $C_2$, it touches $C_1$ at $A$ and $C_2$ at $B$. Line segment $\overline{O_1O_2}$ meets $C_1$ at $X$. Let $C$ be the circle through $A, X, B$ with center $O$. Let $\overline{OO_1}$ and $\overline{OO_2}$ intersect circle $C$ at $D$ and $E$, respectively. Suppose the radii of $C_1$ and $C_2$ are $16$ and $9$, respectively, and suppose the area of the quadrilateral $O_1O_2BA$ is $300$. Find the length of segment $DE$. [b]p9.[/b] What is the remainder when $5^{5^{5^5}}$ is divided by $13$? [b]p10.[/b] Let $\alpha$ and $\beta$ be the smallest and largest real numbers satisfying $$x^2 = 13 + \lfloor x \rfloor + \left\lfloor \frac{x}{2} \right\rfloor +\left\lfloor \frac{x}{3} \right\rfloor + \left\lfloor \frac{x}{4} \right\rfloor .$$ Find $\beta - \alpha$ . ($\lfloor a \rfloor$ is defined as the largest integer that is not larger than $a$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which natural $ n \geq 3 $ numbers from 1 to $ n $ can be arranged by a circle so that each number does not exceed $60$ % of the sum of its two neighbors?

In $\triangle PBC$, $\angle PBC=60^{o}$, the tangent at point $P$ to the circumcircle$g$ of $\triangle PBC$ intersects with line $CB$ at $A$. Points $D$ and $E$ lie on the line segment $PA$ and $g$ respectively, satisfying $\angle DBE=90^{o}$, $PD=PE$. $BE$ and $PC$ meet at $F$. It is known that lines $AF,BP,CD$ are concurrent. a) Prove that $BF$ bisect $\angle PBC$ b) Find $\tan \angle PCB$

If $x=(\log_82)^{(\log_28)}$, then $\log_3x$ equals: $\text{(A)} \ -3 \qquad \text{(B)} \ -\frac13 \qquad \text{(C)} \ \frac13 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 9$

Given that $x^2 + y^2 = 14x + 6y + 6$, what is the largest possible value that $3x + 4y$ can have? $\text{(A)}\ 72 \qquad \text{(B)}\ 73 \qquad \text{(C)}\ 74 \qquad \text{(D)}\ 75\qquad \text{(E)}\ 76$

Let $f\in C^1[a,b]$, $f(a)=0$ and suppose that $\lambda\in\mathbb R$, $\lambda >0$, is such that $$|f'(x)|\leq \lambda |f(x)|$$ for all $x\in [a,b]$. Is it true that $f(x)=0$ for all $x\in [a,b]$?

Let $ABC$ be a triangle, ($BC < AB$). The line $l$ passing trough the vertices $C$ and orthogonal to the angle bisector $BE$ of $\angle B$, meets $BE$ and the median $BD$ of the side $AC$ at points $F$ and $G$, respectively. Prove that segment $DF$ bisects the segment $EG$.

Find the minimum value of $\int_0^{\pi} (x-y)^2 (\sin x)|\cos x|dx$.

Let $ABC$ be a triangle with area $K$. Points $A^*$, $B^*$, and $C^*$ are chosen on $AB$, $BC$, and $CA$ respectively such that $\triangle{A^*B^*C^*}$ has area $J$. Suppose that \[\frac{AA^*}{AB}=\frac{BB^*}{BC}=\frac{CC^*}{CA}=\frac{J}{K}=x\] for some $0<x<1$. What is $x$? [i]2019 CCA Math Bonanza Lightning Round #4.3[/i]

For all valid values of $a$ and $b$, simplify the expression $$\frac{\sqrt{4b-a^2+2ab+4}+a}{\sqrt{4ab-10b^2-8}+b}.$$

A quadrilateral $ ABCD $ is inscribed in a circle. The lines $AB$ and $CD$ intersect at point $E$, and the lines $AD$ and $BC$ intersect at point $F$. The bisector of the angle $ AEC $ intersects the side $ BC $ at the point $ M $ and the side $ AD $ at the point $ N $; and the bisector of the angle $ BFD $ intersects the side $ AB $ at the point $ P $ and the side $ CD $ at the point $ Q $. Prove that the quadrilateral $MPNQ$ is a rhombus.

In a country, there are $100$ towns. Some pairs of towns are joined by roads. The roads do not intersect one another except meeting at towns. It is possible to go from any town to any other town by road. Prove that it is possible to pave some of the roads so that the number of paved roads at each town is odd.

Show that if $a, b, c$ are the lengths of the sides of a triangle and if $2S = a + b + c$, then \[\frac{a^n}{b+c} + \frac{b^n}{c+a} +\frac{c^n}{a+b} \geq \left(\dfrac 23 \right)^{n-2}S^{n-1} \quad \forall n \in \mathbb N \] [i]Proposed by Greece.[/i]

How many of the numbers $2,6,12,20,\ldots,14520$ are divisible by $120$? $\text{(A) }2\qquad\text{(B) }8\qquad\text{(C) }12\qquad\text{(D) }24\qquad\text{(E) }32$

Triangle $ABC$ is a triangle with side lengths $13$, $14$, and $15$. A point $Q$ is chosen uniformly at random in the interior of $\triangle{ABC}$. Choose a random ray (of uniformly random direction) with endpoint $Q$ and let it intersect the perimeter of $\triangle{ABC}$ at $P$. What is the expected value of $QP^2$? [i]2018 CCA Math Bonanza Tiebreaker Round #4[/i]

Let $ABC$ be an isosceles triangle with $CA = CB$. Let $D$ be the foot of the alttiude from $C$, and $\ell$ be the external angle bisector at $C$. Take a point $N$ on $\ell$ so that $AN> AC$ , on the same side as $A$ wrt $CD$. The bisector of the angle $NAC$ cuts $\ell$'at $F$. Show that $\angle NCD + \angle BAF> 180^o.$