[b]p1.[/b] The serpent of fire and the serpent of ice play a game. Since the serpent of ice loves the lucky number $6$, he will roll a fair $6$-sided die with faces numbered $1$ through $6$. The serpent of fire will pay him $\log_{10} x$, where $x$ is the number he rolls. The serpent of ice rolls the die $6$ times. His expected total amount of winnings across the $6$ rounds is $k$. Find $10^k$. [b]p2.[/b] Let $a = \log_3 5$, $b = \log_3 4$, $c = - \log_3 20$, evaluate $\frac{a^2+b^2}{a^2+b^2+ab} +\frac{b^2+c^2}{b^2+c^2+bc} +\frac{c^2+a^2}{c^2+a^2+ca}$. [b]p3.[/b] Let $\vartriangle ABC$ be an isosceles obtuse triangle with $AB = AC$ and circumcenter $O$. The circle with diameter $AO$ meets $BC$ at points $X, Y$ , where X is closer to $B$. Suppose $XB = Y C = 4$, $XY = 6$, and the area of $\vartriangle ABC$ is $m\sqrt{n}$ for positive integers $m$ and $n$, where $n$ does not contain any square factors. Find $m + n$. [b]p4.[/b] Alice is not sure what to have for dinner, so she uses a fair $6$-sided die to decide. She keeps rolling, and if she gets all the even numbers (i.e. getting all of $2, 4, 6$) before getting any odd number, she will reward herself with McDonald’s. Find the probability that Alice could have McDonald’s for dinner. [b]p5.[/b] How many distinct ways are there to split $50$ apples, $50$ oranges, $50$ bananas into two boxes, such that the products of the number of apples, oranges, and bananas in each box are nonzero and equal? [b]p6.[/b] Sujay and Rishabh are taking turns marking lattice points within a square board in the Cartesian plane with opposite vertices $(1, 1)$,$(n, n)$ for some constant $n$. Sujay loses when the two-point pattern $P$ below shows up:[img]https://cdn.artofproblemsolving.com/attachments/1/9/d1fe285294d4146afc0c7a2180b15586b04643.png[/img] That is, Sujay loses when there exists a pair of points $(x, y)$ and $(x + 2, y + 1)$. He and Rishabh stop marking points when the pattern $P$ appears on the board. If Rishabh goes first, let $S$ be the set of all integers $3 \le n \le 100$ such that Rishabh has a strategy to always trick Sujay into being the one who creates $P$. Find the sum of all elements of $S$. [b]p7.[/b] Let $a$ be the shortest distance between the origin $(0, 0)$ and the graph of $y^3 = x(6y -x^2)-8$. Find $\lfloor a^2 \rfloor $. ($\lfloor x\rfloor $ is the largest integer not exceeding $x$) [b]p8.[/b] Find all real solutions to the following equation: $$2\sqrt2x^2 + x -\sqrt{1 - x^2 } -\sqrt2 = 0.$$ [b]p9.[/b] Given the expression $S = (x^4 - x)(x^2 - x^3)$ for $x = \cos \frac{2\pi}{5 }+ i\sin \frac{2\pi}{5 }$, find the value of $S^2$ . [b]p10.[/b] In a $32$ team single-elimination rock-paper-scissors tournament, the teams are numbered from $1$ to $32$. Each team is guaranteed (through incredible rock-paper-scissors skill) to win any match against a team with a higher number than it, and therefore will lose to any team with a lower number. Each round, teams who have not lost yet are randomly paired with other teams, and the losers of each match are eliminated. After the $5$ rounds of the tournament, the team that won all $5$ rounds is ranked $1$st, the team that lost the 5th round is ranked $2$nd, and the two teams that lost the $4$th round play each other for $3$rd and $4$th place. What is the probability that the teams numbered $1, 2, 3$, and $4$ are ranked $1$st, 2nd, 3rd, and 4th respectively? If the probability is $\frac{m}{n}$ for relatively prime integers $m$ and $n$, find $m$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

$T$ is a given triangle with vertices $P_1,P_2,P_3$. Consider an arbitrary subdivision of $T$ into finitely many subtriangles such that no vertex of a subtriangle lies strictly between two vertices of another subtriangle. To each vertex $V$ of the subtriangles there is assigned a number $n(V)$ according to the following rules: $(\text{i})$ If $V$ = $P_i$, then $n(V) = i$. $(\text{ii})$ If $V$ lies on the side $P_i P_j$ of $T$, then $n(V) = i$ or $j$. $(\text{iii})$ If $V$ lies inside the triangle $T$, then $n(V)$ is any of the numbers $1,2,3$. Prove that there exists at least one subtriangle whose vertices are numbered $1, 2, 3$.

$2024$ otters live in the river. Some are friends with each other. Is it possible that, for any collection of $1012$ otters, there is exactly one additional otter that is friends with all $1012$ otters?

There are $24$ different pencils, $4$ different colors, and $6$ pencils of each color. They were given to $6$ children in such a way that each got $4$ pencils. What is the least number of children that you can randomly choose so that you can guarantee that you have pencils of all colors. P.S. for 10 grade gives same problem with $40$ pencils, $10$ of each color and $10$ children.

Shrek throws $5$ balls into $5$ empty bins, where each ball’s target is chosen uniformly at random. After Shrek throws the balls, the probability that there is exactly one empty bin can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Let $ A$ be the subset of the set of positive integers, having the following $ 2$ properties: 1) If $ a$ belong to $ A$,than all of the divisors of $ a$ also belong to $ A$; 2) If $ a$ and $ b$, $ 1 < a < b$, belong to $ A$, than $ 1 \plus{} ab$ is also in $ A$; Prove that if $ A$ contains at least $ 3$ positive integers, than $ A$ contains all positive integers.

Anna and Berta play a game in which they take turns in removing marbles from a table. Anna takes the first turn. When at the beginning of the turn there are $n\geq 1$ marbles on the table, then the player whose turn it is removes $k$ marbles, where $k\geq 1$ either is an even number with $k\leq \frac{n}{2}$ or an odd number with $\frac{n}{2}\leq k\leq n$. A player win the game if she removes the last marble from the table. Determine the smallest number $N\geq 100000$ such that Berta can enforce a victory if there are exactly $N$ marbles on the tale in the beginning.

[b]6.1. [/b] Three workers can do some work. Second and the third can together complete it twice as fast as the first, the first and the third can together complete it three times faster than the second. At what time since the first and second can do this job faster than the third? [b]6.2.[/b] Prove that the greatest common divisor of the sum of two numbers and their least common multiple is equal to their greatest common divisor the numbers themselves. [b]6.3.[/b] There were 20 schoolchildren at the consultation and 20 problems were dealt with. It turned out that each student solved two problems and each problem was solved by two schoolchildren. Prove that it is possible to organize the analysis in this way tasks so that everyone solves one problem and all tasks are solved. [hide=original wording] Наконсультациибыло20школьниковиразбиралось20задач. Оказалось, что каждый школьник решил две задачи и каждую задачу решило два школьника. Докажите, что можно так организовать разбор задач, чтобыкаждыйрассказалоднузадачуивсезадачибылирассказаны.[/hide] [b]6.4[/b].Two people Α and Β must get from point Μ to point Ν,located 15 km from M. On foot they can move at a speed of 6 km/h. In addition, they have a bicycle at their disposal, on which υou can drive at a speed of 15 km/h. A and B depart from Μ at the same time, A walks, and B rides a bicycle until meeting pedestrian C, going from N to M. Then B walks and C rides a bicycle to meeting with A, hands him a bicycle, on which he arrives at N. When must pedestrian C leave Nfor A and B to arrive at N simultaneously if he walks at the same speed as A and B? [b]6.5./ 7.1[/b] Prove that out of any six people there will always be three pairs of acquaintances or three pairs of strangers. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983442_1961_leningrad_math_olympiad]here[/url].

One Martian, one Venusian, and one Human reside on Pluton. One day they make the following conversation: [b]Martian [/b]: I have spent $1/12$ of my life on Pluton. [b]Human [/b]: I also have. [b]Venusian [/b]: Me too. [b]Martian [/b]: But Venusian and I have spend much more time here than you, Human. [b]Human [/b]: That is true. However, Venusian and I are of the same age. [b]Venusian [/b]: Yes, I have lived $300$ Earth years. [b]Martian [/b]: Venusian and I have been on Pluton for the past $13$ years. It is known that Human and Martian together have lived $104$ Earth years. Find the ages of Martian, Venusian, and Human.* [hide="*"][i]*: Note that the numbers in the problem are not necessarily in base $10.$[/i][/hide]

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

New license plates consist of two letters, three digits, and two letters (from the English alphabet of$ 26$ letters). What is the largest possible number of such license plates if it is required that every two of them differ at no less than two positions?

Let $ A \equal{} \{(a_1,\dots,a_8)|a_i\in\mathbb{N}$ , $ 1\leq a_i\leq i \plus{} 1$ for each $ i \equal{} 1,2\dots,8\}$.A subset $ X\subset A$ is called sparse if for each two distinct elements $ (a_1,\dots,a_8)$,$ (b_1,\dots,b_8)\in X$,there exist at least three indices $ i$,such that $ a_i\neq b_i$. Find the maximal possible number of elements in a sparse subset of set $ A$.

Let $ABCD$ be a square with side $4$. Find, with proof, the biggest $k$ such that no matter how we place $k$ points into $ABCD$, such that they are on the interior but not on the sides, we always have a square with sidr length $1$, which is inside the square $ABCD$, such that it contains no points in its interior(they can be on the sides).

Given natural $n$. We shall call "universal" such a sequence of natural number $a_1, a_2, ... , a_k, k\ge n$, if we can obtain every transposition of the first $n$ natural numbers (i.e such a sequence of $n$ numbers, that every one is encountered only once) by deleting some its members. (Examples: ($1,2,3,1,2,1,3$) is universal for $n=3$, and ($1,2,3,2,1,3,1$) -- not, because you can't obtain ($3,1,2$) from it.) The goal is to estimate the length of the shortest universal sequence for given $n$. a) Give an example of the universal sequence of $n2$ members. b) Give an example of the universal sequence of $(n^2 - n + 1)$ members. c) Prove that every universal sequence contains not less than $n(n + 1)/2$ members d) Prove that the shortest universal sequence for $n=4$ contains 12 members e) Find as short universal sequence, as you can. The Organising Committee knows the method for $(n^2 - 2n +4) $ members.

What is the largest number of horses that you can put on a chessboard without there being two horses that can beat each other? a. Describe an arrangement with that maximum number. b. Prove that a larger number is not possible. (A chessboard consists of $8 \times 8$ spaces and a horse jumps from one field to another field according to the line "two squares vertically and one squared horizontally" or "one square vertically and two squares horizontally") [asy] unitsize (0.5 cm); int i, j; for (i = 0; i <= 7; ++i) { for (j = 0; j <= 7; ++j) { if ((i + j) % 2 == 0) { if ((i - 2)^2 + (j - 3)^2 == 5) { fill(shift((i,j))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), red); } else { fill(shift((i,j))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.8)); } } }} for (i = 0; i <= 8; ++i) { draw((i,0)--(i,8)); draw((0,i)--(8,i)); } label("$a$", (0.5,-0.5), fontsize(10)); label("$b$", (1.5,-0.5), fontsize(10)); label("$c$", (2.5,-0.5), fontsize(10)); label("$d$", (3.5,-0.5), fontsize(10)); label("$e$", (4.5,-0.5), fontsize(10)); label("$f$", (5.5,-0.5), fontsize(10)); label("$g$", (6.5,-0.5), fontsize(10)); label("$h$", (7.5,-0.5), fontsize(10)); label("$1$", (-0.5,0.5), fontsize(10)); label("$2$", (-0.5,1.5), fontsize(10)); label("$3$", (-0.5,2.5), fontsize(10)); label("$4$", (-0.5,3.5), fontsize(10)); label("$5$", (-0.5,4.5), fontsize(10)); label("$6$", (-0.5,5.5), fontsize(10)); label("$7$", (-0.5,6.5), fontsize(10)); label("$8$", (-0.5,7.5), fontsize(10)); label("$P$", (2.5,3.5), fontsize(10)); [/asy]

In how many ways can a set of $12$ elements be partitioned into six two-element subsets?

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]D.16 / L.6[/b] Alex has $100$ Bluffy Funnies in some order, which he wants to sort in order of height. They’re already almost in order: each Bluffy Funny is at most $1$ spot off from where it should be. Alex can only swap pairs of adjacent Bluffy Funnies. What is the maximum possible number of swaps necessary for Alex to sort them? [b]D.17[/b] I start with the number $1$ in my pocket. On each round, I flip a coin. If the coin lands heads heads, I double the number in my pocket. If it lands tails, I divide it by two. After five rounds, what is the expected value of the number in my pocket? [b]D.18 / L.12[/b] Point $P$ inside square $ABCD$ is connected to each corner of the square, splitting the square into four triangles. If three of these triangles have area $25$, $25$, and $15$, what are all the possible values for the area of the fourth triangle? [b]D.19[/b] Mr. Stein and Mr. Schwartz are playing a yelling game. The teachers alternate yelling. Each yell is louder than the previous and is also relatively prime to the previous. If any teacher yells at $100$ or more decibels, then they lose the game. Mr. Stein yells first, at $88$ decibels. What volume, in decibels, should Mr. Schwartz yell at to guarantee that he will win? [b]D.20 / L.15[/b] A semicircle of radius $1$ has line $\ell$ along its base and is tangent to line $m$. Let $r$ be the radius of the largest circle tangent to $\ell$, $m$, and the semicircle. As the point of tangency on the semicircle varies, the range of possible values of $r$ is the interval $[a, b]$. Find $b - a$. [u]Set 5[/u] [b]D.21 / L.14[/b] Hungryman starts at the tile labeled “$S$”. On each move, he moves $1$ unit horizontally or vertically and eats the tile he arrives at. He cannot move to a tile he already ate, and he stops when the sum of the numbers on all eaten tiles is a multiple of nine. Find the minimum number of tiles that Hungryman eats. [img]https://cdn.artofproblemsolving.com/attachments/e/7/c2ecc2a872af6c4a07907613c412d3b86cd7bc.png [/img] [b]D.22 / L.11[/b] How many triples of nonnegative integers $(x, y, z)$ satisfy the equation $6x + 10y +15z = 300$? [b]D.23 / L.16[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]D.24 / L.13[/b] Tse and Cho are playing a game. Cho chooses a number $x \in [0, 1]$ uniformly at random, and Tse guesses the value of $x(1 - x)$. Tse wins if his guess is at most $\frac{1}{50}$ away from the correct value. Given that Tse plays optimally, what is the probability that Tse wins? [b]D.25 / L.20[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019}) = 2019^{x^{2019}+1}.$$ [u]Set 6[/u] [i]This round is an estimation round. No one is expected to get an exact answer to any of these questions, but unlike other rounds, you will get points for being close. In the interest of transparency, the formulas for determining the number of points you will receive are located on the answer sheet, but they aren’t very important when solving these problems.[/i] [b]D.26 / L.26[/b] What is the sum over all MBMT volunteers of the number of times that volunteer has attended MBMT (as a contestant or as a volunteer, including this year)? Last year there were $47$ volunteers; this is the fifth MBMT. [b]D.27 / L.27[/b] William is sharing a chocolate bar with Naveen and Kevin. He first randomly picks a point along the bar and splits the bar at that point. He then takes the smaller piece, randomly picks a point along it, splits the piece at that point, and gives the smaller resulting piece to Kevin. Estimate the probability that Kevin gets less than $10\%$ of the entire chocolate bar. [b]D.28 / L.28[/b] Let $x$ be the positive solution to the equation $x^{x^{x^x}}= 1.1$. Estimate $\frac{1}{x-1}$. [b]D.29 / L.29[/b] Estimate the number of dots in the following box: [img]https://cdn.artofproblemsolving.com/attachments/8/6/416ba6379d7dfe0b6302b42eff7de61b3ec0f1.png[/img] It may be useful to know that this image was produced by plotting $(4\sqrt{x}, y)$ some number of times, where x, y are random numbers chosen uniformly randomly and independently from the interval $[0, 1]$. [b]D.30 / L.30[/b] For a positive integer $n$, let $f(n)$ be the smallest prime greater than or equal to $n$. Estimate $$(f(1) - 1) + (f(2) - 2) + (f(3) - 3) + ...+ (f(10000) - 10000).$$ For $26 \le i \le 30$, let $E_i$ be your team’s answer to problem $i$ and let $A_i$ be the actual answer to problem $i$. Your score $S_i$ for problem $i$ is given by $S_{26} = \max(0, 12 - |E_{26} - A_{26}|/5)$ $S_{27} = \max(0, 12 - 100|E_{27} - A_{27}|)$ $S_{28} = \max(0, 12 - 5|E_{28} - A_{28}|))$ $S_{29} = 12 \max \left(0, 1 - 3 \frac{|E_{29} - A_{29}|}{A_{29}} \right)$ $S_{30} = \max (0, 12 - |E_{30} - A_{30}|/2000)$ PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and L10,16-30 [url=https://artofproblemsolving.com/community/c3h2790825p24541816]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A $9\times9$ chess board has two squares from opposite corners and its central square removed. Is it possible to cover the remaining squares using dominoes, where each domino covers two adjacent squares? Justify your answer.

Consider the $5$ by $5$ equilateral triangular grid as shown: [img]https://cdn.artofproblemsolving.com/attachments/1/2/cac43ae24fd4464682a7992e62c99af4acaf8f.png[/img] How many equilateral triangles are there with sides along the gridlines?

Let $k$ be a positive integer and $M_k$ the set of all the integers that are between $2 \cdot k^2 + k$ and $2 \cdot k^2 + 3 \cdot k,$ both included. Is it possible to partition $M_k$ into 2 subsets $A$ and $B$ such that \[ \sum_{x \in A} x^2 = \sum_{x \in B} x^2. \]

A group of $n{}$ $(n>1)$ people each visited $k{}$ $(k>1)$ citites. Each person makes a list of these $k$ cities in the order they want to visit them. A permutation $(a_1,a_2,\ldots,a_k)$ is called $m-prefered$ $(m\in\mathbb{N})$, if for every $i=1,2,\ldots,k$ there are at least $m$ people that would prefer to visit the city $a_i$ before the city $a_{i+1}$, $(a_{k+1}=a_1)$. Prove that there exists an m-prefered permutation if and only if $km\leq n(k-1)$.

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

A point $O$ inside a convex $n$-gon $A_1A_2 . . .A_n$ is connected with segments to its vertices. The sides of this $n$-gon are numbered $1$ to $n$ (distinct sides have distinct numbers). The segments $OA_1,OA_2, . . . ,OA_n$ are similarly numbered. a) For $n = 9$ find a numeration such that the sum of the sides’ numbers is the same for all triangles $A_1OA_2, A_2OA_3, . . . , A_nOA_1$. b) Prove that for $n = 10$ there is no such numeration.