A square with side length 2 and a circle share the same center. The total area of the regions that are inside the circle and outside the square is equal to the total area of the regions that are outside the circle and inside the square. What is the radius of the circle? [asy]defaultpen(linewidth(0.8));pair a=(4,4), b=(0,0), c=(0,4), d=(4,0), o=(2,2); draw(a--d--b--c--cycle); draw(circle(o, 2.5));[/asy] $ \textbf{(A)}\ \frac{2}{\sqrt{\pi}} \qquad \textbf{(B)}\ \frac{1\plus{}\sqrt{2}}{2} \qquad \textbf{(C)}\ \frac{3}{2} \qquad \textbf{(D)}\ \sqrt{3} \qquad \textbf{(E)}\ \sqrt{\pi}$

Let $l$ denote the length of the smallest diagonal of all rectangles inscribed in a triangle $T$ . (By inscribed, we mean that all four vertices of the rectangle lie on the boundary of $T$ .) Determine the maximum value of $\frac{l^2}{S(T)}$ taken over all triangles ($S(T )$ denotes the area of triangle $T$ ).

For real numbers $a_1, a_2, \ldots, a_{200}$, we consider the value $S = a_1a_2 + a_2a_3 + \ldots + a_{199}a_{200} + a_{200}a_1$. In one operation, you can change the sign of any number (that is, change $a_i$ to $-a_i$), and then calculate the value of $S$ for the new numbers again. What is the smallest number of operations needed to always be able to make $S$ nonnegative? [i]Proposed by Oleksii Masalitin[/i]

Let $k$ and $n$ be two given distinct positive integers greater than $1$. There are finitely many (not necessarily distinct) integers written on the blackboard. Kázmér is allowed to erase $k$ consecutive elements of an arithmetic sequence with a difference not divisible by $k$. Similarly, Nándor is allowed to erase $n$ consecutive elements of an arithmetic sequence with a difference that is not divisible by $n$. The initial numbers on the blackboard have the property that both Kázmér and Nándor can erase all of them (independently from each other) in a finite number of steps. Prove that the difference of biggest and the smallest number on the blackboard is at least $\varphi(n)+\varphi(k)$. [i]Proposed by Boldizsár Varga, Budapest[/i]

There are $1988$ towns and $4000$ roads in a certain country (each road connects two towns) . Prove that there is a closed path passing through no more than $20$ towns. (A. Razborov , Moscow)

Find all pairs \((x, y)\) of real numbers that satisfy the system \[ (x + 1)(x^2 + 1) = y^3 + 1 \] \[ (y + 1)(y^2 + 1) = x^3 + 1 \]

Given $ 12$ points in a plane no three of which are collinear, the number of lines they determine is: $ \textbf{(A)}\ 24 \qquad\textbf{(B)}\ 54 \qquad\textbf{(C)}\ 120 \qquad\textbf{(D)}\ 66 \qquad\textbf{(E)}\ \text{none of these}$

In triangle $ABC$ with centroid $G$, let $M \in (AB)$ and $N \in (AC)$ be points on two of its sides. Prove that points $M, G, N$ are collinear if and only if $\frac{MB}{MA}+\frac{NC}{NA}=1$.

Suppose $k>3$ is a divisor of $2^p+1$, where $p$ is prime. Prove that $k\ge2p+1$.

[b]O[/b]n a blackboard a stranger writes the values of $s_7(n)^2$ for $n=0,1,...,7^{20}-1$, where $s_7(n)$ denotes the sum of digits of $n$ in base $7$. Compute the average value of all the numbers on the board.

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 $

3. Let n > 1 be an integer and $a_1, a_2, . . . , a_n$ be positive reals with sum 1. a) Show that there exists a constant c ≥ 1/2 so that $\sum \frac{a_k}{1+(a_0+a_1+...+a_{k-1})^2}\geq c$, where $a_0 = 0$. b) Show that ’the best’ value of c is at least $\frac{\pi}{4}$.

In one criminal kingdom, an underdeveloped state, the King decided to start a fight against corruption and, as an example, punish one of his $199$ ministers. The ministers were summoned to the palace and seated at a large round table. At first they wanted to find the one who had the most money in his bank account and declare him the main corrupt official. It takes $20$ minutes to determine the amount of money in the bank account of one minister. But the King ordered that the accused be found within four hours while he underwent medical procedures. According to the Noble Court Administrator, any minister can be accused, you just need to find a legal justification.The Chief Lawyer proposed that the first minister discovered, who has more money in his bank account than each of his two neighbors (one on the right and one on the left), be declared corrupt. How can one be sure to find a minister who meets this condition within the allotted $4$ hours? (During this time, it is possible to consistently determine the size of the bank accounts of no more than $12$ ministers. It is assumed that the amount of money in bank accounts is different.)

Let $p$ be a prime number. Find all pairs $(x, y)$ of positive integers such that $x^3 + y^3 - 3xy = p -1$.

In a village, the maximum distance between two houses is $M$ and the minimum distance is $m$. Prove that if the village has $6$ houses, then $\frac{M}{m} \ge \sqrt3$.

In a new school $40$ percent of the students are freshmen, $30$ percent are sophomores, $20$ percent are juniors, and $10$ percent are seniors. All freshmen are required to take Latin, and $80$ percent of the sophomores, $50$ percent of the juniors, and $20$ percent of the seniors elect to take Latin. The probability that a randomly chosen Latin student is a sophomore is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find the number of functions $ A\stackrel{f}{\longrightarrow } A $ for which there exist two functions $ A\stackrel{g}{\longrightarrow } B\stackrel{h}{\longrightarrow } A $ having the properties that $ g\circ h =\text{id.} $ and $ h\circ g=f, $ where $ B $ and $ A $ are two finite sets.

On two intersecting lines $\ell_1$ and $\ell_2$, segments $AB$ and $CD$ of a given length are selected, respectively. Prove that the volume of the tetrahedron $ABCD$ does not depend on the position of the segments $AB$ and $CD$ on the lines $\ell_1$ and $\ell_2$.

Let $ABC$ be a triangle with side lengths $5$, $4\sqrt 2$, and $7$. What is the area of the triangle with side lengths $\sin A$, $\sin B$, and $\sin C$?

An urn contains $n$ balls labeled $1, 2, ... , n$. We draw the balls out one by one (without replacing them) until we obtain a ball whose number is divisible by $k$. Find all $k$ such that the expected number of balls removed is $k$.

Let $\mathbb N$ be the set of all positive integers. A subset $A$ of $\mathbb N$ is [i]sum-free[/i] if, whenever $x$ and $y$ are (not necessarily distinct) members of $A$, their sum $x+y$ does not belong to $A$. Determine all surjective functions $f:\mathbb N\to\mathbb N$ such that, for each sum-free subset $A$ of $\mathbb N$, the image $\{f(a):a\in A\}$ is also sum-free. [i]Note: a function $f:\mathbb N\to\mathbb N$ is surjective if, for every positive integer $n$, there exists a positive integer $m$ such that $f(m)=n$.[/i]

Consider a function $f(x)=\frac{\sin x}{9+16\sin ^ 2 x}\ \left(0\leq x\leq \frac{\pi}{2}\right).$ Let $a$ be the value of $x$ for which $f(x)$ is maximized. Evaluate $\int_a^{\frac{\pi}{2}} f(x)\ dx.$ [i]2010 Saitama University entrance exam/Mathematics[/i] Last Edited

Let $S_n=\sum_{k=1}^n (k^5+k^7).$ Let the prime factorization of $\text{gcd}(S_{2020},S_{6060})$ be $p_1^{k_1}\cdot p_2^{k_2}\cdots p_i^{k_i}$. Compute $p_1+p_2+\cdots +p_i+k_1+k_2+\cdots + k_i $.

Let $d_1,d_2,d_3,d_4$ be the four smallest divisors of a positive integer $n$ (having at least four divisors). Find all $n$ such that $d_1^2+d_2^2+d_3^2+d_4^2 = n$.

All the squares of a $2022 \times 2022$ board will be colored white or black. Chips will be placed in several of these boxes, at most one per box. We say that two tokens attack each other, when the following two conditions are met: a) There is a path of squares that joins the squares where the pieces were placed. This path can have a horizontal, vertical, or diagonal direction. b) All the squares in this path, including the squares where the pieces are, are of the same color. For example, the following figure shows a small example of a possible coloring of a $6 \times 6$ board with $A, B, C, D$, and $E$ tiles placed. The pairs of checkers that attack each other are $(D, E)$, $(C, D)$, and $(B, E)$. [img]https://cdn.artofproblemsolving.com/attachments/2/0/52ec7b7d1c02e266b666e4f8b25e87c58f0c89.png[/img] What is the maximum value of $k$ such that it is possible to color the board and place $k$ tiles without any two of them attacking each other?