A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? $ \textbf{(A) }39 \qquad \textbf{(B) }71 \qquad \textbf{(C) }73 \qquad \textbf{(D) }75 \qquad \textbf{(E) }135 \qquad $

Let $ABCD$ be a convex quadrilateral with $AC = 7$ and $BD = 17$. Let $M$, $P$, $N$, $Q$ be the midpoints of sides $AB$, $BC$, $CD$, $DA$ respectively. Compute $MN^2 + PQ^2$ [color = red]The official problem statement does not have the final period.[/color]

Circles $\omega_1,\omega_2,\omega_3$ with centers $O_1,O_2,O_3$, respectively, are externally tangent to each other. The circle $\omega_1$ touches $\omega_2$ at $P_1$ and $\omega_3$ at $P_2$. For any point $A$ on $\omega_1$, $A_1$ denotes the point symmetric to $A$ with respect to $O_1$. Show that the intersection points of $AP_2$ with $\omega_3$, $A_1P_3$ with $\omega_2$, and $AP_3$ with $A_1P_2$ lie on a line.

An infinite sequence of positive real numbers $a_1,a_2,a_3,\dots$ is called [i]territorial[/i] if for all positive integers $i,j$ with $i<j$, we have $|a_i-a_j|\ge\tfrac1j$. Can we find a territorial sequence $a_1,a_2,a_3,\dots$ for which there exists a real number $c$ with $a_i<c$ for all $i$?

Let $a$ and $b$ be rational numbers such that $s=a+b=a^2+b^2$. Prove that $s$ can be written as a fraction where the denominator is relatively prime to $6$.

Find solutions of the equation $u_t=u_{xxx}+uu_x$ in the form of a traveling wave $u=\varphi(x-ct)$, $\varphi(\pm\infty)=0$.

Let $\triangle {ABC} $ be isosceles triangle with $AC=BC$ . The point $D$ lies on the extension of $AC$ beyond $C$ and is that $AC>CD$. The angular bisector of $ \angle BCD $ intersects $BD$ at point $N$ and let $M$ be the midpoint of $BD$. The tangent at $M$ to the circumcircle of triangle $AMD$ intersects the side $BC$ at point $P$. Prove that points $A,P,M$ and $N$ lie on a circle.

Let $ABC$ be a triangle with $AB \neq AC$ and circumcenter $O$. The bisector of $\angle BAC$ intersects $BC$ at $D$. Let $E$ be the reflection of $D$ with respect to the midpoint of $BC$. The lines through $D$ and $E$ perpendicular to $BC$ intersect the lines $AO$ and $AD$ at $X$ and $Y$ respectively. Prove that the quadrilateral $BXCY$ is cyclic.

If $f(x)$ is a monic quartic polynomial such that $f(-1)=-1$, $f(2)=-4$, $f(-3)=-9$, and $f(4)=-16$, find $f(1)$.

Seven spheres are situated in space such that no three centers are collinear, no four centers are coplanar, and every pair of spheres intersect each other at more than one point. For every pair of spheres, the plane on which the intersection of the two spheres lies in is drawn. What is the least possible number of sets of four planes that intersect in at least one point?

Let $P$ be a point that lies outside of circle $O$. A line passes through $P$ and meets the circle at $A$ and $B$, and another line passes through $P$ and meets the circle at $C$ and $D$. The point $A$ is between $P$ and $B$, $C$ is between $P$ and $D$. Let the intersection of segment $AD$ and $BC$ be $L$ and construct $E$ on ray $(PA$ so that $BL \cdot PE = DL \cdot PD$. Show that $M$ is the midpoint of the segment $DE$, where $M$ is the intersection of lines $PL$ and $DE$.

Let $c$ be a positive integer. The sequence $\{f_n\}$ is defined as follows: \[f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 \quad (n \geq 2).\] Show that for each $k \in \mathbb N$ there exists $r \in \mathbb N$ such that $f_kf_{k+1}= f_r.$

Find all function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following equality holds \[ f(\left\lfloor x\right\rfloor y)=f(x)\left\lfloor f(y)\right\rfloor \] where $\left\lfloor a\right\rfloor $ is greatest integer not greater than $a.$ [i]Proposed by Pierre Bornsztein, France[/i]

For each positive integer $n$ , define $a_n = 20 + n^2$ and $d_n = gcd(a_n, a_{n+1})$. Find the set of all values that are taken by $d_n$ and show by examples that each of these values is attained.

Elisa has $2023$ treasure chests, all of which are unlocked and empty at first. Each day, Elisa adds a new gem to one of the unlocked chests of her choice, and afterwards, a fairy acts according to the following rules: [list=disc] [*]if more than one chests are unlocked, it locks one of them, or [*]if there is only one unlocked chest, it unlocks all the chests. [/list] Given that this process goes on forever, prove that there is a constant $C$ with the following property: Elisa can ensure that the difference between the numbers of gems in any two chests never exceeds $C$, regardless of how the fairy chooses the chests to unlock.

Determine the smallest possible value of the sum $S (a, b, c) = \frac{ab}{c}+\frac{bc}{a}+\frac{ca}{b}$ where $a, b, c$ are three positive real numbers with $a^2 + b^2 + c^2 = 1$

Three rays are going out from point $O$ in space, forming pairwise angles $\alpha, \beta$ and $\gamma$ with $0^o<\alpha \le \beta \le \gamma <180^o$. Prove that $\sin \frac{\alpha}{2}+ \sin \frac{\beta}{2} > \sin \frac{\gamma}{2}$.

A fighting game club has $2024$ members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly $3$ other members. Each match has a winner and a loser. A member will be [i]happy[/i] if they won in at least $2$ of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?

$(GBR 2)$ Let $a, b, x, y$ be positive integers such that $a$ and $b$ have no common divisor greater than $1$. Prove that the largest number not expressible in the form $ax + by$ is $ab - a - b$. If $N(k)$ is the largest number not expressible in the form $ax + by$ in only $k$ ways, find $N(k).$

Prove that: [b](a)[/b] $ 5<\sqrt {5}\plus{}\sqrt [3]{5}\plus{}\sqrt [4]{5}$ [b](b)[/b] $ 8>\sqrt {8}\plus{}\sqrt [3]{8}\plus{}\sqrt [4]{8}$ [b](c)[/b] $ n>\sqrt {n}\plus{}\sqrt [3]{n}\plus{}\sqrt [4]{n}$ for all integers $ n\geq 9 .$ [b][Weightage 16/100][/b]

Let $X_1$, $Z_2$, $Y_1$, $X_2$, $Z_1$, $Y_2$ be six points lying on the periphery of a circle (in this order). Let the chords $Y_1Y_2$ and $Z_1Z_2$ meet at a point $A$; let the chords $Z_1Z_2$ and $X_1X_2$ meet at a point $B$; let the chords $X_1X_2$ and $Y_1Y_2$ meet at a point $C$. Prove that $\left( BX_2-CX_1\right) \cdot BC+\left( CY_2-AY_1\right) \cdot CA+\left( AZ_2-BZ_1\right) \cdot AB=0$. [i]Comment on the source.[/i] The problem is inspired by Stergiu's proof in [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=326112#p326112]http://www.mathlinks.ro/Forum/viewtopic.php?t=50262 post #5[/url]. Darij

Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1, 2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) Does $\sum_{i=1}^{p-1}\frac{1}{i}\equiv 0\pmod{p^2}$ for all odd prime numbers $p$? (Note that $\frac{1}{i}$ denotes the number such that $i\cdot\frac{1}{i}\equiv 1\pmod{p^2}$) (b) Do there exist $2017$ positive perfect cubes that sum to a perfect cube? (c) Does there exist a right triangle with rational side lengths and area $5$? (d) A [i]magic square[/i] is a $3\times 3$ grid of numbers, all of whose rows, columns, and major diagonals sum to the same value. Does there exist a magic square whose entries are all [color = red]different[/color] prime numbers? (e) Is $\prod_{p} \frac{p^2+1}{p^2-1} = \frac{2^2+1}{2^2-1}\cdot\frac{3^2+1}{3^2-1}\cdot\frac{5^2+1}{5^2-1}\cdot\frac{7^2+1}{7^2-1}\cdot\dots$ a rational number? (f) Do there exist infinite number of pairs of [i]distinct[/i] integers $(a,b)$ such that $a$ and $b$ have the same set of prime divisors, and $a+1$ and $b+1$ have the same set of prime divisors? [color = red]The USAYNO disclaimer is only included in problem 33. I have included it here for convenience.[/color] [color = red]A clarification was issued for problem 36(d) during the test. I have included it above.[/color]

Of the following statements, the only one that is incorrect is: $ \textbf{(A)}$ An inequality will remain true after each side is increased, decreased, multiplied or divided (zero excluded) by the same positive quantity. $ \textbf{(B)}$ The arithmetic mean of two unequal positive quantities is greater than their geometric mean. $ \textbf{(C)}$ If the sum of two positive quantities is given, ther product is largest when they are equal. $ \textbf{(D)}$ If $ a$ and $ b$ are positive and unequal, $ \frac {1}{2}(a^2 \plus{} b^2)$ is greater than $ [\frac {1}{2}(a \plus{} b)]^2$. $ \textbf{(E)}$ If the product of two positive quantities is given, their sum is greatest when they are equal.

Suppose $2$ cars are going into a turn the shape of a half-circle. Car $ 1$ is traveling at $50$ meters per second and is hugging the inside of the turn, which has radius $200$ meters. Car $2$ is trying to pass Car $ 1$ going along the turn, but in order to do this, he has to move to the outside of the turn, which has radius $210$. Suppose that both cars come into the turn side by side, and that they also end the turn being side by side. What was the average speed of Car $2$, in meters per second, throughout the turn?

Let $m, n$ be positive integers and $a_1,\dots , a_m, b_1, \dots , b_n$ positive real numbers such that for every positive integer $k$ we have that $$(a_1^k + \cdots + a^k_m) - (b^k_1 + \cdots + b^k_n) \leq CkN, $$ for some fix $C$ and $N$. Show that there exists $l \leq m, n$ and permutations $\sigma$ of $\{1, \dots , m\}$ and $\tau$ of $\{1,\dots , n\}$, such that 1. $a\sigma(i) = b\tau(i)$ for $1 \leq i \leq l,$ 2. $a\sigma(i) , b\tau(i) \leq 1$ for $i > l.$