Two circles are said to be [i]orthogonal[/i] if they intersect in two points, and their tangents at either point of intersection are perpendicular. Two circles $\omega_1$ and $\omega_2$ with radii $10$ and $13$, respectively, are externally tangent at point $P$. Another circle $\omega_3$ with radius $2\sqrt2$ passes through $P$ and is orthogonal to both $\omega_1$ and $\omega_2$. A fourth circle $\omega_4$, orthogonal to $\omega_3$, is externally tangent to $\omega_1$ and $\omega_2$. Compute the radius of $\omega_4$.

In a right-angled and isosceles triangle, the two catheti are both length $1$. Find the length of the shortest line segment dividing the triangle into two figures with the same area, and specify the location of this line segment

On a isosceles triangle $\triangle ABC$ with $AB=BC$ let $K,M$ be the midpoints of $AB,AC$ respectivily. Let $(CKB)$ intersect $BM$ at $N \ne M$, the line through $N$ parallel to $AC$ intersects $(ABC)$ at $A_1,C_1$. Show that $\triangle A_1BC_1$ is equilateral.

Positive numbers $x,y$ satisfy $x^2+y^3 \ge x^3+y^4$. Prove that $x^3+y^3 \le 2$.

[u]Round 5[/u] [b]p13.[/b] Two concentric circles have radii $1$ and $3$. Compute the length of the longest straight line segment that can be drawn froma point on the circle of radius $1$ to a point on the circle of radius $3$ if the segment cannot intersect the circle of radius $1$. [b]p14.[/b] Find the value of $\frac{1}{3} + \frac29+\frac{3}{27}+\frac{4}{81}+\frac{5}{243}+...$ [b]p15.[/b] Bob is trying to type the word "welp". However, he has a $18$ chance ofmistyping each letter and instead typing one of four adjacent keys, each with equal probability. Find the probability that he types "qelp" instead of "welp". [u]Round 6[/u] [b]p16.[/b] How many ways are there to tile a $2\times 12$ board using an unlimited supply of $1\times 1$ and $1\times 3$ pieces? [b]p17.[/b] Jeffrey and Yiming independently choose a number between $0$ and $1$ uniformly at random. What is the probability that their two numbers can formthe sidelengths of a triangle with longest side of length $1$? [b]p18.[/b] On $\vartriangle ABC$ with $AB = 12$ and $AC = 16$, let $M$ be the midpoint of $BC$ and $E$,$F$ be the points such that $E$ is on $AB$, $F$ is on $AC$, and $AE = 2AF$. Let $G$ be the intersection of $EF$ and $AM$. Compute $\frac{EG}{GF}$ . [u]Round 7[/u] [b]p19.[/b] Find the remainder when $2019x^{2019} -2018x^{2018}+ 2017x^{2017}-...+x$ is divided by $x +1$. [b]p20.[/b] Parallelogram $ABCD$ has $AB = 5$, $BC = 3$, and $\angle ABC = 45^o$. A line through C intersects $AB$ at $M$ and $AD$ at $N$ such that $\vartriangle BCM$ is isosceles. Determine the maximum possible area of $\vartriangle MAN$. [b]p21[/b]. Determine the number of convex hexagons whose sides only lie along the grid shown below. [img]https://cdn.artofproblemsolving.com/attachments/2/9/93cf897a321dfda282a14e8f1c78d32fafb58d.png[/img] [u]Round 8[/u] [b]p22.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 4$, $BC = 5$, and $C A = 6$. Extend ray $\overrightarrow{AB}$ to a point $D$ such that $AD = 12$, and similarly extend ray $\overrightarrow{CB}$ to point $E$ such that $CE = 15$. Let $M$ and $N$ be points on the circumcircles of $ABC$ and $DBE$, respectively, such that line $MN$ is tangent to both circles. Determine the length of $MN$. [b]p23.[/b] A volcano will erupt with probability $\frac{1}{20-n}$ if it has not erupted in the last $n$ years. Determine the expected number of years between consecutive eruptions. [b]p24.[/b] If $x$ and $y$ are integers such that $x+ y = 9$ and $3x^2+4x y = 128$, find $x$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165997p28809441]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166099p28810427]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $g(x)=x^5+x^4+x^3+x^2+x+1$. What is the remainder when the polynomial $g(x^{12})$ is divided by the polynomial $g(x)$? $\textbf{(A) }6\qquad\textbf{(B) }5-x\qquad\textbf{(C) }4-x+x^2\qquad$ $\textbf{(D) }3-x+x^2-x^3\qquad \textbf{(E) }2-x+x^2-x^3+x^4$

Periodic sequences $(a_n),(b_n),(c_n)$ and $(d_n)$ satisfy the following conditions: $$a_{n+1}=a_n+b_n,\enspace\enspace b_{n+1}=b_n+c_n,$$ $$c_{n+1}=c_n+d_n,\enspace\enspace d_{n+1}=d_n+a_n,$$ for $n=1,2,\ldots$. Prove that $a_2=b_2=c_2=d_2=0$.

A castle is surrounded by a circular wall with $9$ towers which are guarded by knights during the night. Every hour the castle clock strikes and the guards shift to the neighboring towers, each guard always moves in the same direction (either clockwise or counterclockwise). Given that (i) during the night each knight guards every tower (ii) at some hour each tower was guarded by at least two knights (iii) at some hour exactly $5$ towers were guarded by single knights, prove that at some hour one of the towers was unguarded.

Let $ABC$ be an acute triangle such that $AB<AC$. Denote by $A'$ the reflection of $A$ with respect to $BC$. The circumcircle of $A'BC$ meets the rays $AB$ and $AC$ at $D$ and $E$ respectively, such that $B$ is between $A$ and $D$, and $E$ is between $A$ and $C$. Denote by $P$ and $Q$ the midpoints of the segments $CD$ and $BE$, and let $S$ be the midpoint of $BC$. Show that the lines $BC$ and $AA'$ meet on the circumcircle of $PQS$. [i] Authored by Nikola Velov[/i]

At lunch, the seven members of the Kubik family sit down to eat lunch together at a round table. In how many distinct ways can the family sit at the table if Alexis refuses to sit next to Joshua? (Two arrangements are not considered distinct if one is a rotation of the other.)

Nam spent $20$ dollars for $20$ stationery items consisting of books, pens and pencils. Each book, pen, and pencil cost $3$ dollars, $1.5$ dollars and $0.5$ dollar respectively. How many dollars did Nam spend for books?

Determine all positive integers which cannot be represented as $\frac{a}{b}+\frac{a+1}{b+1}$ with $a,b$ being positive integers.

Elmo has 2023 cookie jars, all initially empty. Every day, he chooses two distinct jars and places a cookie in each. Every night, Cookie Monster finds a jar with the most cookies and eats all of them. If this process continues indefinitely, what is the maximum possible number of cookies that the Cookie Monster could eat in one night? [i]Proposed by Espen Slettnes[/i]

Is it possible to find $p,q,r\in\mathbb Q$ such that $p+q+r=0$ and $pqr=1$? [i]Proposed by Máté Weisz, Cambridge[/i]

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

A machine takes $6$ seconds to make $4$ coins. How long does it take for the machine to make $22$ coins? The machine makes coins at the same constant rate. $\textbf{(A) }30\qquad\textbf{(B) }33\qquad\textbf{(C) }36\qquad\textbf{(D) }39\qquad\textbf{(E) }42$

Let $ x,y,z$ be positive real numbers such that $ xy \plus{} yz \plus{} zx \equal{} x \plus{} y \plus{} z$. Prove the inequality $ \frac1{x^2 \plus{} y \plus{} 1} \plus{} \frac1{y^2 \plus{} z \plus{} 1} \plus{} \frac1{z^2 \plus{} x \plus{} 1}\le1$ When does the equality hold?

Let $n$ be an integer and $p$ a prime greater than 2. Show that: $$(p-1)^nn!|(p^n-1)(p^n-p)(p^n-p^2)\cdots(p^n-p^{n-1}).$$

A ball is launched upward from the ground at an initial vertical speed of $v_\text{0}$ and begins bouncing vertically. Every time it rebounds, it loses a proportion of the magnitude of its velocity due to the inelastic nature of the collision, such that if the speed just before hitting the ground on a bounce is $v$, then the speed just after the bounce is $rv$, where $r < 1$ is a constant. Calculate the total length of time that the ball remains bouncing, assuming that any time associated with the actual contact of the ball with the ground is negligible. (a) $\frac{2v_\text{0}}{g}\frac{1}{1-r}$ (b) $\frac{v_\text{0}}{g}\frac{r}{1-r}$ (c) $\frac{2v_\text{0}}{g}\frac{1-r}{r}$ (d) $\frac{2v_\text{0}}{g}\frac{1}{1-r^2}$ (e) $\frac{2v_\text{0}}{g}\frac{1}{1+(1-r)^2}$

$30$ same balls are put into four boxes $ A$, $ B$, $ C$, $ D$ in such a way that sum of number of balls in $ A$ and $ B$ is greater than sum of in $ C$ and $ D$. How many possible ways are there? $\textbf{(A)}\ 2472 \qquad\textbf{(B)}\ 2600 \qquad\textbf{(C)}\ 2728 \qquad\textbf{(D)}\ 2856 \qquad\textbf{(E)}\ \text{None}$

13 LHS Students attend the LHS Math Team tryouts. The students are numbered $1, 2, .. 13$. Their scores are $s_1,s_2, ... s_{13}$, respectively. There are 5 problems on the tryout, each of which is given a weight, labeled $w_1, w_2, ... w_5$. Each score $s_i$ is equal to the sums of the weights of all problems solved by student $i$. On the other hand, each weight $w_j$ is assigned to be $\frac{1}{\sum_ {s_i} }$, where the sum is over all the scores of students who solved problem $j$. (If nobody solved a problem, the score doesn't matter). If the largest possible average score of the students can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ is square-free, find $a+b$. [i]Proposed by Jeff Lin[/i]

Find all pairs $(a, b)$ of real numbers such that $a \cdot \lfloor b \cdot n\rfloor = b \cdot \lfloor a \cdot n \rfloor$ applies to all positive integers$ n$. (For a real number $x, \lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$.)

The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = 0$, $a_n = a_{[n/2]} + (-1)^{n(n+1)/2}$. Show that for any positive integer $k$ we can find $n$ in the range $2^k \leq n < 2^{k+1}$ such that $a_n = 0$.

Given two positive integers $n$ and $m$ and a function $f : \mathbb{Z} \times \mathbb{Z} \to \left\{0,1\right\}$ with the property that \begin{align*} f\left(i, j\right) = f\left(i+n, j\right) = f\left(i, j+m\right) \qquad \text{for all } \left(i, j\right) \in \mathbb{Z} \times \mathbb{Z} . \end{align*} Let $\left[k\right] = \left\{1,2,\ldots,k\right\}$ for each positive integer $k$. Let $a$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i+1, j\right) = f\left(i, j+1\right) . \end{align*} Let $b$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i-1, j\right) = f\left(i, j-1\right) . \end{align*} Prove that $a = b$.

For every $ n \ge 2$, $ a_n \equal{} \sqrt [3]{n^3 \plus{} n^2 \minus{} n \minus{} 1}/n$. What is the least value of positive integer $ k$ satisfying $ a_2a_3\cdots a_k > 3$ ? $\textbf{(A)}\ 100 \qquad\textbf{(B)}\ 102 \qquad\textbf{(C)}\ 104 \qquad\textbf{(D)}\ 106 \qquad\textbf{(E)}\ \text{None}$