In $xyz$ space, find the volume of the solid expressed by $x^2+y^2\leq z\le \sqrt{3}y+1.$

Given the graph $G$ and cycle $C$ in it, we can perform the following operation: add another vertex $v$ to the graph, connect it to all vertices in $C$ and erase all the edges from $C$. Prove that we cannot perform the operation indefinitely on a given graph.

A medial line parallel to the side $AC$ of triangle $ABC$ meets its circumcircle at points at $X$ and $Y$. Let $I$ be the incenter of triangle $ABC$ and $D$ be the midpoint of arc $AC$ not containing $B$.A point $L$ lie on segment $DI$ in such a way that $DL= BI/2$. Prove that $\angle IXL = \angle IYL$.

The geometric mean of any set of $m$ non-negative numbers is the $m$-th root of their product. $\quad (\text{i})\quad$ For which positive integers $n$ is there a finite set $S_n$ of $n$ distinct positive integers such that the geometric mean of any subset of $S_n$ is an integer? $\quad (\text{ii})\quad$ Is there an infinite set $S$ of distinct positive integers such that the geometric mean of any finite subset of $S$ is an integer?

The diagram represents a $ 7$-foot-by-$ 7$-foot floor that is tiled with $ 1$-square-foot black tiles and white tiles. Notice that the corners have white tiles. If a $ 15$-foot-by-$ 15$-foot floor is to be tiled in the same manner, how many white tiles will be needed? [asy]unitsize(10); draw((0,0)--(7,0)--(7,7)--(0,7)--cycle); draw((1,7)--(1,0)); draw((6,7)--(6,0)); draw((5,7)--(5,0)); draw((4,7)--(4,0)); draw((3,7)--(3,0)); draw((2,7)--(2,0)); draw((0,1)--(7,1)); draw((0,2)--(7,2)); draw((0,3)--(7,3)); draw((0,4)--(7,4)); draw((0,5)--(7,5)); draw((0,6)--(7,6)); fill((1,0)--(2,0)--(2,7)--(1,7)--cycle,black); fill((3,0)--(4,0)--(4,7)--(3,7)--cycle,black); fill((5,0)--(6,0)--(6,7)--(5,7)--cycle,black); fill((0,5)--(0,6)--(7,6)--(7,5)--cycle,black); fill((0,3)--(0,4)--(7,4)--(7,3)--cycle,black); fill((0,1)--(0,2)--(7,2)--(7,1)--cycle,black);[/asy] $ \textbf{(A)}\ 49 \qquad \textbf{(B)}\ 57 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 96 \qquad \textbf{(E)}\ 126$

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

In an $2023\times 2023$ grid we fill in numbers $1,2,\cdots,2023^2$ without duplicating. Find the largest integer $M$ such that there exists a way to fill the numbers, satisfying that any two adjacent numbers has a difference at least $M$ (two squares $(x_1,y_1),(x_2,y_2)$ are adjacent if $x_1=x_2$ and $y_1-y_2\equiv \pm1\pmod{2023}$ or $y_1=y_2$ and $x_1-x_2\equiv \pm1\pmod{2023}$). [i]Proposed by chengbilly.[/i]

The large square in the diagram below with sides of length $8$ is divided into $16$ congruent squares. Find the area of the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/6/e/cf828197aa2585f5eab2320a43b80616072135.png[/img]

Let $p$ and $q$ be relatively prime positive odd integers such that $1 < p < q$. Let $A$ be a set of pairs of integers $(a, b)$, where $0 \le a \le p - 1, 0 \le b \le q - 1$, containing exactly one pair from each of the sets $$\{(a, b),(a + 1, b + 1)\}, \{(a, q - 1), (a + 1, 0)\}, \{(p - 1,b),(0, b + 1)\}$$ whenever $0 \le a \le p - 2$ and $0 \le b \le q - 2$. Show that $A$ contains at least $(p - 1)(q + 1)/8$ pairs whose entries are both even. Agnijo Banerjee and Joe Benton, United Kingdom

We are placing $n$ integers whose sum is $94$ over a circle such that each number is equal to the absolute value of the difference of (clockwise) next two numbers. What is the largest $n$ that makes such placing possible? $ \textbf{(A)}\ 188 \qquad\textbf{(B)}\ 186 \qquad\textbf{(C)}\ 141 \qquad\textbf{(D)}\ 100 \qquad\textbf{(E)}\ 47 $

Let $a$, $b$, $c$ be positive reals such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=1$. Show that $$a^abc+b^bca+c^cab\ge 27bc+27ca+27ab.$$ [i]Proposed by Milan Haiman[/i]

Alice chooses a set $A$ of positive integers. Then Bob lists all finite nonempty sets $B$ of positive integers with the property that the maximum element of $B$ belongs to $A$. Bob's list has $2024$ sets. Find the sum of the elements of $A$

Harold tosses a nickel four times. The probability that he gets at least as many heads as tails is $\text{(A)}\ \frac{5}{16} \qquad \text{(B)}\ \frac{3}{8} \qquad \text{(C)}\ \frac{1}{2} \qquad \text{(D)}\ \frac{5}{8} \qquad \text{(E)}\ \frac{11}{16}$

Let there be a figure with $9$ disks and $11$ edges, as shown below. We will write a real number in each and every disk. Then, for each edge, we will write the square of the difference between the two real numbers written in the two disks that the edge connects. We must write $0$ in disk $A$, and $1$ in disk $I$. Find the minimum sum of all real numbers written in $11$ edges.

There is scales on the teacher's table. There is a set of weighs on the scales, and there are some pupils' names (may be more than one) on the every weigh. A pupil entering the classroom moves all the weight with his name to another side of the scales. Prove that you can let in such a subset of the pupils, that the scales will change its position.

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

Two players play alternately on a $ 5 \times 5$ board. The first player always enters a $ 1$ into an empty square and the second player always enters a $ 0$ into an empty square. When the board is full, the sum of the numbers in each of the nine $ 3 \times 3$ squares is calculated and the first player's score is the largest such sum. What is the largest score the first player can make, regardless of the responses of the second player?

a) Is it possible to colour the positive rational numbers with blue and red in a way that there are numbers of both colours and the sum of any two numbers of the same colour is the same colour as them? b) Is it possible to colour the positive rational numbers with blue and red in a way that there are numbers of both colours and the product of any two numbers of the same colour is the same colour as them? Note: When forming a sum or a product, it is allowed to pick the same number twice.

$a_1,a_2, \cdots , a_{2003}$ are integers such that $|a_1| = 1$ and $|a_{i+1}|=|a_i+1|$ $(1\leq i \leq 2002)$. What is the minimal value of $|a_1+a_2+\cdots + a_{2003}|$? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 34 \qquad\textbf{(C)}\ 56 \qquad\textbf{(D)}\ 65 \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $ABCD$ be a trapezoid such that $AD\parallel BC$. The interior angle bisectors of the corners $A$ and $B$ meet on $[DC]$. If $|BC|=9$ and $|AD|=4$, find $|AB|$.

How many ordered integer pairs $(x,y)$ ($0\leq x,y < 31$) are there satisfying $(x^2-18)^2\equiv y^2 (\mod 31)$? $ \textbf{(A)}\ 59 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 61 \qquad\textbf{(D)}\ 62 \qquad\textbf{(E)}\ \text{None} $

A grid consists of $n\times n$ points, with $n\in\mathbb{Z}^+$. In some of these points is a sentry. Every sentry chooses two directions, one perpendicular to the other (one vertical and the other horizontal) and watches over all the points that are found in the two chosen directions. Each sentry watches over her own point as well and the sentries on the edge of the grid can also watch the vacuum, depending on the directions they have chosen. For instance, in the figure below, representing a disposition of $5$ sentries in a $4\times 4$ grid, the sentries in $A,\,B,\,C,\,D,\,E$ watch over $1,\,3,\,4,\,5,\,7$ points, respectively; points $D$ and $E$ are watched by one sentry, point $C$ is watched by two sentries, points $A,\,B$ and $F$ are watched by three sentries. (a) Prove that we can place $12$ sentries in a $4\times 4$ grid in such a way that every point of the grid is watched by at most two sentries. (b) Let $S(n)$ be the maximum number of sentries we can place on an $n\times n$ grid in such a way that every point of the grid is watched by at most two sentries. Prove that $3n\leq S(n)\leq 4n$ for all $n\geq 3$.

A real number $x$ is chosen uniformly at random from the interval $[0, 1000].$ Find the probability that $$\left\lfloor\frac{\lfloor \tfrac{x}{2.5}\rfloor}{2.5}\right\rfloor=\left\lfloor\frac{x}{6.25}\right\rfloor.$$

The sequence of numbers $a_0,a_1,a_2,...$ is determined by $a_0 = 0$, and $$a_n= \begin{cases} 1+a_{n-1} \,\,\, when\,\,\, n \,\,\, is \,\,\, positive \,\,\, and \,\,\, odd \\ 3a_{n/2} \,\,\,when \,\,\,n \,\,\,is \,\,\,positive \,\,\,and \,\,\,even\end{cases}$$ How many of these numbers are less than $2007$ ?

Let $A$,$B$,$C$, and $D$ be points in the plane with $AB=AC=BC=BD=CD=36$ and such that $A \neq D$. Point $K$ lies on segment $AC$ such that $AK=2KC$. Point $M$ lies on segment $AB$, and point $N$ lies on line $AC$, such that $D$, $M$, and $N$ are collinear. Let lines $CM$ and $BN$ intersect at $P$. Then the maximum possible length of segment $KP$ can be expressed in the form $m+\sqrt{n}$ for positive integers $m$ and $n$. Compute $100m+n$. [i]Proposed by James Lin[/i]