The graphs of the following equations divide the $xy$ plane into some number of regions. $4 + (x + 2)y =x^2$ $(x + 2)^2 + y^2 =16$ Find the area of the second smallest region.

In $ n$-dimensional Euclidean space, the union of any set of closed balls (of positive radii) is measurable in the sense of Lebesgue. [i]A. Csaszar[/i]

let $ ABC $ an equilateral triangle with circum circle $ w $ let $ P $ a point on arc $ BC $ ( point $ A $ is on the other side ) pass a tangent line $ d $ through point $ P $ such that $ P \cap AB = F $ and $ AC \cap d = L $ let $ O $ the center of the circle $ w $ prove that $ \angle LOF > 90^{0} $

Let $X$ be a finite set of real numbers. For any $x,x' \in X$ with $x<x'$, define a function $f(x,x')$, then $f$ is called an ordered pair function on $X$. For any given ordered pair function $f$ on $X$, if there exist elements $x_1 <x_2 <\cdots<x_k$ in $X$ such that $f(x_1 ,x_2 ) \le f(x_2 ,x_3 ) \le \cdots \le f(x_{k-1} ,x_k )$, then $x_1 ,x_2 ,\cdots,x_k$ is called an $f$-ascending sequence of length $k$ in $X$. Similarly, define an $f$-descending sequence of length $l$ in $X$. For integers $k,l \ge 3$, let $h(k,l)$ denote the smallest positive integer such that for any set $X$ of $s$ real numbers and any ordered pair function $f$ on $X$, there either exists an $f$-ascending sequence of length $k$ in $X$ or an $f$-descending sequence of length $l$ in $X$ if $s \ge h(k,l)$. Prove: 1.For $k,l>3,h(k,l) \le h(k-1,l)+h(k,l-1)-1$; 2.$h(k,l) \le \binom{l-2}{k+l-4} +1$.

Let $ABC$ be a triangle with $\angle BCA=90^{\circ}$, and let $D$ be the foot of the altitude from $C$. Let $X$ be a point in the interior of the segment $CD$. Let $K$ be the point on the segment $AX$ such that $BK=BC$. Similarly, let $L$ be the point on the segment $BX$ such that $AL=AC$. Let $M$ be the point of intersection of $AL$ and $BK$. Show that $MK=ML$. [i]Proposed by Josef Tkadlec, Czech Republic[/i]

Chandler the Octopus along with his friends Maisy the Bear and Jeff the Frog are solving LMT problems. It takes Maisy $3$ minutes to solve a problem, Chandler $4$ minutes to solve a problem and Jeff $5$ minutes to solve a problem. They start at $12:00$ pm, and Chandler has a dentist appointment from $12:10$ pm to $12:30$, after which he comes back and continues solving LMT problems. The time it will take for them to finish solving $50$ LMT problems, in hours, is $m/n$ ,where $m$ and $n$ are relatively prime positive integers. Find $m +n$. [b]Note:[/b] they may collaborate on problems. [i]Proposed by Aditya Rao[/i]

A random number generator will always output $7$. Sam uses this random number generator once. What is the expected value of the output?

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

Amelia has $27$ unit cubes. She selects one and paints one of its faces. She then randomly glues all $27$ cubes together to form a $3 \times 3 \times 3$ cube (with all possible arrangements of the unit cubes being equally likely). Compute the probability that the resulting cube appears unpainted.

Let $ABCD$ be a convex quadrilateral with $\angle{DAC}= \angle{BDC}= 36^\circ$ , $\angle{CBD}= 18^\circ$ and $\angle{BAC}= 72^\circ$. The diagonals and intersect at point $P$ . Determine the measure of $\angle{APD}$.

Determine the prime numbers $p, q, r$ with the property $\frac {1} {p} + \frac {1} {q} + \frac {1} {r} \ge 1$

Given $2025$ pairwise distinct positive integer numbers \(a_1, a_2, \ldots, a_{2025}\), find the maximum possible number of equal numbers among the fractions of the form \[ \frac{a_i^2 + a_j^2}{a_i + a_j} \] [i]Proposed by Mykhailo Shtandenko[/i]

Andy's lawn has twice as much area as Beth's lawn and three times as much area as Carlos' lawn. Carlos' lawn mower cuts half as fast as Beth's mower and one third as fast as Andy's mower. If they all start to mow their lawns at the same time, who will finish first? $ \textbf{(A)}\ \text{Andy} \qquad \textbf{(B)}\ \text{Beth} \qquad \textbf{(C)}\ \text{Carlos} \qquad \textbf{(D)}\ \text{Andy and Carlos tie for first.}$ $\textbf{(E)}\ \text{All three tie.}$

Find all integers $n>1$ for which there exist positive integers $a_1,a_2,\ldots,a_n$ such that when divided by $a_i+a_j, 1\leq i\leq j\leq n$ there are $\frac{n(n+1)}{2}$ distinct remainders.

Determine the greatest power of $2$ that is a factor of $3^{15}+3^{11}+3^{6}+1$. [i]Proposed by Nathan Xiong[/i]

Let $A_0B_0C_0$ be a triangle. For a positive integer $n \geq 1$, we define $A_n$ on the segment $B_{n-1}C_{n-1}$ such that $B_{n-1}A_n:C_{n-1}A_n=2:1$ and $B_n, C_n$ are defined cyclically in a similar manner. Show that there exists an unique point $P$ that lies in the interior of all triangles $A_nB_nC_n$.

In a triangle $ABC$, with $AB \ne BC$, $E$ is a point on the line $AC$ such that $BE$ is perpendicular to $AC$. A circle passing through $A$ and touching the line $BE$ at a point $P \ne B$ intersects the line $AB$ for the second time at $X$. Let $Q$ be a point on the line $PB$ different from $P$ such that $BQ = BP$. Let $Y$ be the point of intersection of the lines $CP$ and $AQ$. Prove that the points $C, X, Y, A$ are concyclic if and only if $CX$ is perpendicular to $AB$.

In an obtuse triangle $ABC$ $(AB>AC)$,$O$ is the circumcentre and $D,E,F$ are the midpoints of $BC,CA,AB$ respectively.Median $AD$ intersects $OF$ and $OE$ at $M$ and $N$ respectively.$BM$ meets $CN$ at point $P$.Prove that $OP\perp AP$

Prove that the for all $n>1000$, we can arrange the number $1,2,\dots, \binom{n}{2}$ on edges of a complete graph with $n$ vertices so that the sum of the numbers assigned to edges of any length three path (possibly closed) is not less than $3n-1000log_2log_2 n$.

Prove that for any prime $p$, there exist integers $x,y,z,$ and $w$ such that $x^2+y^2+z^2-wp=0$ and $0<w<p$

A bookshelf contains $n$ volumes, labelled $1$ to $n$, in some order. The librarian wishes to put them in the correct order as follows. The librarian selects a volume that is too far to the right, say the volume with label $k$, takes it out, and inserts it in the $k$-th position. For example, if the bookshelf contains the volumes $1,3,2,4$ in that order, the librarian could take out volume $2$ and place it in the second position. The books will then be in the correct order $1,2,3,4$. (a) Show that if this process is repeated, then, however the librarian makes the selections, all the volumes will eventually be in the correct order. (b) What is the largest number of steps that this process can take?

Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$; Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$. Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins. [i]Proposed by Hans Zantema, Netherlands[/i]

Let be a real function that admits finite right-limits everywhere. Prove that the function that maps every real number to its right-limit is right-continuous everywhere. [i]Tolosi Marin[/i]

Tracy has been baking a rectangular cake whose surface is dissected by grid lines in square fields. The number of rows is $ 2^n$ and the number of columns is $ 2^{n \plus{} 1}$ where $ n \geq 1, n \in \mathbb{N}.$ Now she covers the fields with strawberries such that each row has at least $ 2n \plus{} 2$ of them. Show that there four pairwise distinct strawberries $ A,B,C$ and $ D$ which satisfy those three conditions: (a) Strawberries $ A$ and $ B$ lie in the same row and $ A$ further left than $ B.$ Similarly $ D$ lies in the same row as $ C$ but further left. (b) Strawberries $ B$ and $ C$ lie in the same column. (c) Strawberries $ A$ lies further up and further left than $ D.$

On each side of an equilateral triangle of side $n \ge 1$ consider $n - 1$ points that divide the sides into $n$ equal segments. Through these points draw parallel lines to the sides of the triangles, obtaining a net of equilateral triangles of side length $1$. On each of the vertices of the small triangles put a coin head up. A move consists in flipping over three mutually adjacent coins. Find all values of $n$ for which it is possible to turn all coins tail up after a finite number of moves. Colombia 1997