Alice is standing on the circumference of a large circular room of radius $10$. There is a circular pillar in the center of the room of radius $5$ that blocks Alice’s view. The total area in the room Alice can see can be expressed in the form $\frac{m\pi}{n} +p\sqrt{q}$, where $m$ and $n$ are relatively prime positive integers and $p$ and $q$ are integers such that $q$ is square-free. Compute $m + n + p + q$. (Note that the pillar is not included in the total area of the room.) [img]https://cdn.artofproblemsolving.com/attachments/5/1/26e8aa6d12d9dd85bd5b284b6176870c7d11b1.png[/img]

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

In triangle $ABC$, the angle bisectors are $BE$ and $CF$ (where $E, F$ are on the sides of the triangle), and their intersection point is $I$. Point $N$ lies on the circumcircle of $AEF$, and the angle $\angle IAN$ is right. The circumcircle of $AEF$ meets the line $NI$ a second time at the point $L$. Show that the circumcenter of $AIL$ lies on line $BC$.

Let $ABC$ be an acute triangle. Squares $AA_1A_2A_3$, $BB_1B_2B_3$ and $CC_1C_2C_3$ are located such that the lines $A_1A_2$, $B_1B_2$, $C_1C_2$ pass through the points $B$, $C$ and $A$ respectively and the lines $A_2A_3$, $B_2B_3$, $C_2C_3$ pass through the points $C$, $A$ and $B$ respectively. Prove that (a) the lines $AA_2$, $B_1B_2$ and $C_1C_3$ intersect at one point. (b) the lines $AA_2$, $BB_2$ and $CC_2$ intersect at one point. (Mykhailo Plotnikov) [img]https://cdn.artofproblemsolving.com/attachments/3/d/ad2fe12ae2c82d04b48f5e683b7d54e0764baf.png[/img]

Let $ P$ be a polynomial with integer coefficients such that there are two distinct integers at which $ P$ takes coprime values. Show that there exists an infinite set of integers, such that the values $ P$ takes at them are pairwise coprime.

Let $k>1$ be a given positive integer. A set $S$ of positive integers is called [i]good[/i] if we can colour the set of positive integers in $k$ colours such that each integer of $S$ cannot be represented as sum of two positive integers of the same colour. Find the greatest $t$ such that the set $S=\{a+1,a+2,\ldots ,a+t\}$ is [i]good[/i] for all positive integers $a$. [i]A. Ivanov, E. Kolev[/i]

For $ n\ge 2$, let $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ be $ 2^n$ subsets of $ A \equal{} \{1, 2, 3, \ldots, 2^{n \plus{} 1}\}$ that satisfy the following property: There do not exist indices $ a$ and $ b$ with $ a < b$ and elements $ x$, $ y$, $ z\in A$ with $ x < y < z$ and $ y$, $ z\in S_a$, and $ x$, $ z\in S_b$. Prove that at least one of the sets $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ contains no more than $ 4n$ elements. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Let $G$ a $n$ elements group. Find all the functions $f:G\rightarrow \mathbb{N}^*$ such that: (a) $f(x)=1$ if and only if $x$ is $G$'s identity; (b) $f(x^k)=\frac{f(x)}{(f(x),k)}$ for any divisor $k$ of $n$, where $(r,s)$ stands for the greatest common divisor of the positive integers $r$ and $s$.

Let $n,k$ be arbitrary positive integers. We fill the entries of an $n\times k$ array with integers such that all the $n$ rows contain the integers $1,2,\dots,k$ in some order. Add up the numbers in all $k$ columns – let $S$ be the largest of these sums. What is the minimal value of $S$?

[b]p1.[/b] Eric is playing Brawl Stars. If he starts playing at $11:10$ AM, and plays for $2$ hours total, then how many minutes past noon does he stop playing? [b]p2.[/b] James is making a mosaic. He takes an equilateral triangle and connects the midpoints of its sides. He then takes the center triangle formed by the midsegments and connects the midpoints of its sides. In total, how many equilateral triangles are in James’ mosaic? [b]p3.[/b] What is the greatest amount of intersections that $3$ circles and $3$ lines can have, given that they all lie on the same plane? [b]p4.[/b] In the faraway land of Arkesia, there are two types of currencies: Silvers and Gold. Each Silver is worth $7$ dollars while each Gold is worth $17$ dollars. In Daniel’s wallet, the total dollar value of the Silvers is $1$ more than that of the Golds. What is the smallest total dollar value of all of the Silvers and Golds in his wallet? [b]p5.[/b] A bishop is placed on a random square of a $8$-by-$8$ chessboard. On average, the bishop is able to move to $s$ other squares on the chessboard. Find $4s$. Note: A bishop is a chess piece that can move diagonally in any direction, as far as it wants. [b]p6.[/b] Andrew has a certain amount of coins. If he distributes them equally across his $9$ friends, he will have $7$ coins left. If he apportions his coins for each of his $15$ classmates, he will have $13$ coins to spare. If he splits the coins into $4$ boxes for safekeeping, he will have $2$ coins left over. What is the minimum number of coins Andrew could have? [b]p7.[/b] A regular polygon $P$ has three times as many sides as another regular polygon $Q$. The interior angle of $P$ is $16^o$ greater than the interior angle of $Q$. Compute how many more diagonals $P$ has compared to $Q$. [b]p8.[/b] In an certain airport, there are three ways to switch between the ground floor and second floor that are 30 meters apart: either stand on an escalator, run on an escalator, or climb the stairs. A family on vacation takes 65 seconds to climb up the stairs. A solo traveller late for their flight takes $25$ seconds to run upwards on the escalator. The amount of time (in seconds) it takes for someone to switch floors by standing on the escalator can be expressed as $\frac{u}{v}$ , where $u$ and $v$ are relatively prime. Find $u + v$. (Assume everyone has the same running speed, and the speed of running on an escalator is the sum of the speeds of riding the escalator and running on the stairs.) [b]p9.[/b] Avanish, being the studious child he is, is taking practice tests to improve his score. Avanish has a $60\%$ chance of passing a practice test. However, whenever Avanish passes a test, he becomes more confident and instead has a $70\%$ chance of passing his next immediate test. If Avanish takes $3$ practice tests in a row, the expected number of practice tests Avanish will pass can be expressed as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime. Find $a + b$. [b]p10.[/b] Triangle $\vartriangle ABC$ has sides $AB = 51$, $BC = 119$, and $AC = 136$. Point $C$ is reflected over line $\overline{AB}$ to create point $C'$. Next, point $B$ is reflected over line $\overline{AC'}$ to create point $B'$. If $[B'C'C]$ can be expressed in the form of $a\sqrt{b}$, where $b$ is not divisible by any perfect square besides $1$, find $a + b$. [b]p11[/b]. Define the following infinite sequence $s$: $$s = \left\{\frac{1}{1},\frac{1}{1 + 3},\frac{1}{1 + 3 + 6}, ... ,\frac{1}{1 + 3 + 6 + ...+ t_k},...\right\},$$ where $t_k$ denotes the $k$th triangular number. The sum of the first $2024$ terms of $s$, denoted $S$, can be expressed as $$S = 3 \left(\frac{1}{2}+\frac{1}{a}-\frac{1}{b}\right),$$ where $a$ and $b$ are positive integers. Find the minimal possible value of $a + b$. [b]p12.[/b] Omar writes the numbers from $1$ to $1296$ on a whiteboard and then converts each of them into base $6$. Find the sum of all of the digits written on the whiteboard (in base $10$), including both the base $10$ and base $6$ numbers. [b]p13.[/b] A mountain number is a number in a list that is greater than the number to its left and right. Let $N$ be the amount of lists created from the integers $1$ - $100$ such that each list only has one mountain number. $N$ can be expressed as $$N = 2^a(2^b - c^2),$$ where $a$, $b$ and $c$ are positive integers and $c$ is not divisible by $2$. Find $a + b+c$. (The numbers at the beginning or end of a list are not considered mountain numbers.)[hide]Original problem was voided because the original format of the answer didn't match the result's format. So I changed it in the wording, in order the problem to be correct[/hide] [b]p14.[/b] A circle $\omega$ with center $O$ has a radius of $25$. Chords $\overline{AB}$ and $\overline{CD}$ are drawn in $\omega$ , intersecting at $X$ such that $\angle BXC = 60^o$ and $AX > BX$. Given that the shortest distance of $O$ with $\overline{AB}$ and $\overline{CD}$ is $7$ and $15$ respectively, the length of $BX$ can be expressed as $x - \frac{y}{\sqrt{z}}$ , where $x$, $y$, and $z$ are positive integers such that $z$ is not divisible by any perfect square. Find $x + y + z.$ [hide]two answers were considered correct according to configuration[/hide] [b]p15.[/b] How many ways are there to split the first $10$ natural numbers into $n$ sets (with $n \ge 1$) such that all the numbers are used and each set has the same average? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be a triangle with points $E, F$ on $CA$, $AB$, respectively. Circle $C_1$ passes through $E, F$ and is tangent to segment $BC$ at $D$. Suppose that $AE = AF = EF = 3$, $BF = 1$, and $CE = 2$. What is $\frac{ED^2}{F D^2}$ ?

Compute $$\left(20+\frac{1}{23}\right)\cdot\left(23+\frac{1}{20}\right)-\left(20-\frac{1}{23}\right)\cdot\left(23-\frac{1}{20}\right)$$ [i]Proposed by Andy Xu[/i]

Does there exist a function $f : N\to N$ such that $f ( f (n-1)) = f (n+1)- f (n)$ for all $n \ge 2$?

Let $ABC$ be a triangle, and $M$ be the midpoint of $BC$, Let $N$ be the point on the segment $AM$ with $AN = 3NM$, and $P$ be the intersection point of the lines $BN$ and $AC$. What is the area in cm$^2$ of the triangle $ANP$ if the area of the triangle $ABC$ is $40$ cm$^2$?

There are $n$ coins aligned in a row. In each step, it is allowed to choose a coin with the tail up (but not one of the outermost markers), remove it and reverse the closest coin to the left and the closest coin to the right of it. Initially, all the coins have tails up. Prove that one can achieve the state with only two coins remaining if and only if $n-1$ is not divisible by $3$.

Prove that for all positive real numbers $a,b,c$, \[ \frac{a}{\sqrt{a^2 + 8bc}} + \frac{b}{\sqrt{b^2 + 8ca}} + \frac{c}{\sqrt{c^2 + 8ab}} \geq 1. \]

A balance has a left pan, a right pan, and a pointer that moves along a graduated ruler. Like many other grocer balances, this one works as follows: An object of weight $ L$ is placed in the left pan and another of weight $ R$ in the right pan, the pointer stops at the number $ R \minus{} L$ on the graduated ruler. There are $ n, (n \geq 2)$ bags of coins, each containing $ \frac{n(n\minus{}1)}{2} \plus{} 1$ coins. All coins look the same (shape, color, and so on). $ n\minus{}1$ bags contain real coins, all with the same weight. The other bag (we don’t know which one it is) contains false coins. All false coins have the same weight, and this weight is different from the weight of the real coins. A legal weighing consists of placing a certain number of coins in one of the pans, putting a certain number of coins in the other pan, and reading the number given by the pointer in the graduated ruler. With just two legal weighings it is possible to identify the bag containing false coins. Find a way to do this and explain it.

[asy] draw((0,1)--(4,1)--(4,2)--(0,2)--cycle); draw((2,0)--(3,0)--(3,3)--(2,3)--cycle); draw((1,1)--(1,2)); label("1",(0.5,1.5)); label("2",(1.5,1.5)); label("32",(2.5,1.5)); label("16",(3.5,1.5)); label("8",(2.5,0.5)); label("6",(2.5,2.5)); [/asy] The image above is a net of a unit cube. Let $n$ be a positive integer, and let $2n$ such cubes are placed to build a $1 \times 2 \times n$ cuboid which is placed on a floor. Let $S$ be the sum of all numbers on the block visible (not facing the floor). Find the minimum value of $n$ such that there exists such cuboid and its placement on the floor so $S > 2011$.

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

Cities $A$ and $B$ are $45$ miles apart. Alicia lives in $A$ and Beth lives in $B$. Alicia bikes towards $B$ at 18 miles per hour. Leaving at the same time, Beth bikes toward $A$ at 12 miles per hour. How many miles from City $A$ will they be when they meet? $\textbf{(A) }20\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad\textbf{(E) }27$

Let $N_6$ be the answer to problem 6. Given positive integers $n$ and $a$, the $n$[i]th tetration of[/i] $a$ is defined as \[ ^{n}a=\underbrace{a^{a^{\cdot^{\cdot^{\cdot^a}}}}}_{n \text{ times}}. \] For example, $^{4}2=2^{2^{2^2}}=2^{2^4}=2^{16}=65536$. Compute the units digit of $^{2024}N_6$.

The map below shows an east/west road connecting the towns of Acorn, Centerville, and Midland, and a north/south road from Centerville to Drake. The distances from Acorn to Centerville, from Centerville to Midland, and from Centerville to Drake are each 60 kilometers. At noon Aaron starts at Acorn and bicycles east at 17 kilometers per hour, Michael starts at Midland and bicycles west at 7 kilometers per hour, and David starts at Drake and bicycles at a constant rate in a straight line across an open field. All three bicyclists arrive at exactly the same time at a point along the road from Centerville to Midland. Find the number of kilometers that David bicycles. For the map go to http://www.purplecomet.org/welcome/practice

[b]1.[/b] Let $a_{v} $ and $b_{v} $, ${v= 1,2,\dots,n} $, be real numbers such that $a_{1}\geq a_{2} \geq a_{3}\geq\dots\geq a_{n}> 0 $ and $b_{1}\geq a_{1}, b_{1}b_{2}\geq a_{1}a_{2},\dots,b_{1}b_{2}\dots b_{n}\geq a_{1}a_{2}\dots a_{n} $ Show that $b_{1}+b_{2}+\dots+b_{n}\geq a_{1}+a_{2}+\dots+a_{n} $ [b](S. 4)[/b]

We are given a right triangle $ABC$ and the median $BD$ drawn from the vertex $B$ of the right angle. Let the circle inscribed in $\vartriangle ABD$ be tangent to side $AD$ at $K$. Find the angles of $\vartriangle ABC$ if $K$ divides $AD$ in halves.

There exist real numbers $a$, $b$, $c$, $d$, and $e$ such that for all positive integers $n$, we have $$\sqrt{n}=\sum_{i=0}^{n-1}\sqrt[5]{\sqrt{ai^5+bi^4+ci^3+di^2+ei+1}-\sqrt{ai^5+bi^4+ci^3+di^2+ei}}.$$ Find $a+b+c+d$.