The four faces of a tetrahedral die are labelled $0, 1, 2,$ and $3,$ and the die has the property that, when it is rolled, the die promptly vanishes, and a number of copies of itself appear equal to the number on the face the die landed on. For example, if it lands on the face labelled $0,$ it disappears. If it lands on the face labelled $1,$ nothing happens. If it lands on the face labelled $2$ or $3,$ there will then be $2$ or $3$ copies of the die, respectively (including the original). Suppose the die and all its copies are continually rolled, and let $p$ be the probability that they will all eventually disappear. Find $\left\lfloor \frac{10}{p} \right\rfloor$.

Find the number of all 6-digits numbers having exactly three odd and three even digits.

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In an island shaped like a regular polygon of $n$ sides, there are airports at each vertex of the island. The island would like to add $k$ new airports into the interior of the island, but it must follow the following rules:\\ $1$. It must be in the interior of the island (none on borders).\\ $2$. No two airports can be at the exact same location.\\ $3$. Every triple of $1$ new and $2$ old airports must form an isoceles triangle.\\ $4$. No three airports can be collinear.\\ Find the maximum value of $k$ for each $n$ [hide=Harder Version]Replace $1$ new and $2$ old with $1$ old and $2$ new.[/hide]

[u]Round 9[/u] [b]p25.[/b] Define a hilly number to be a number with distinct digits such that when its digits are read from left to right, they strictly increase, then strictly decrease. For example, $483$ and $1230$ are both hilly numbers, but $123$ and $1212$ are not. How many $5$-digit hilly numbers are there? [b]p26.[/b] Triangle ABC has $AB = 4$ and $AC = 6$. Let the intersection of the angle bisector of $\angle BAC$ and $\overline{BC}$ be $D$ and the foot of the perpendicular from C to the angle bisector of $\angle BAC$ be $E$. What is the value of $AD/AE$? [b]p27.[/b] Given that $(7+ 4\sqrt3)^x+ (7-4\sqrt3)^x = 10$, find all possible values of $(7+ 4\sqrt3)^x-(7-4\sqrt3)^x$. [u]Round 10[/u] Note: In this set, the answers for each problem rely on answers to the other problems. [b]p28.[/b] Let X be the answer to question $29$. If $5A + 5B = 5X - 8$ and $A^2 + AB - 2B^2 = 0$, find the sum of all possible values of $A$. [b]p29.[/b] Let $W$ be the answer to question $28$. In isosceles trapezoid $ABCD$ with $\overline{AB} \parallel \overline{CD}$, line segments $ \overline{AC}$ and $ \overline{BD}$ split each other in the ratio $2 : 1$. Given that the length of $BC$ is $W$, what is the greatest possible length of $\overline{AB}$ for which there is only one trapezoid $ABCD$ satisfying the given conditions? [b]p30.[/b] Let $W$ be the answer to question $28$ and $X$ be the answer to question $29$. For what value of $Z$ is $ |Z - X| + |Z - W| - |W + X - Z|$ at a minimum? [u]Round 11[/u] [b]p31.[/b] Peijin wants to draw the horizon of Yellowstone Park, but he forgot what it looked like. He remembers that the horizon was a string of $10$ segments, each one either increasing with slope $1$, remaining flat, or decreasing with slope $1$. Given that the horizon never dipped more than $1$ unit below or rose more than $1$ unit above the starting point and that it returned to the starting elevation, how many possible pictures can Peijin draw? [b]p32.[/b] DNA sequences are long strings of $A, T, C$, and $G$, called base pairs. (e.g. AATGCA is a DNA sequence of 6 base pairs). A DNA sequence is called stunningly nondescript if it contains each of A, T, C, G, in some order, in 4 consecutive base pairs somewhere in the sequence. Find the number of stunningly nondescript DNA sequences of 6 base pairs (the example above is to be included in this count). [b]p33.[/b] Given variables s, t that satisfy $(3 + 2s + 3t)^2 + (7 - 2t)^2 + (5 - 2s - t)^2 = 83$, find the minimum possible value of $(-5 + 2s + 3t) ^2 + (3 - 2t)^2 + (2 - 2s - t)^2$. [u]Round 12[/u] [b]p34.[/b] Let $f(n)$ be the number of powers of 2 with n digits. For how many values of n from $1$ to $2013$ inclusive does $f(n) = 3$? If your answer is N and the actual answer is $C$, then the score you will receive on this problem is $max\{15 - \frac{|N-C|}{26039} , 0\}$, rounded to the nearest integer. [b]p35.[/b] How many total characters are there in the source files for the LMT $2013$ problems? If your answer is $N$ and the actual answer is $C$, then the score you receive on this problem is $max\{15 - \frac{|N - C|}{1337}, 0\}$, rounded to the nearest integer. [b]p36.[/b] Write down two distinct integers between $0$ and $300$, inclusive. Let $S$ be the collection of everyone’s guesses. Let x be the smallest nonnegative difference between one of your guesses and another guess in $S$ (possibly your other guess). Your team will be awarded $min(15, x)$ points. PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134546p28406927]here [/url] and 6-8 [url=https://artofproblemsolving.com/community/c3h3136014p28427163]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are coins worth $1, 2, \ldots , b$ rubles, blue bills with worth $a{}$ rubles and red bills worth $a + b$ rubles. Ilya wants to exchange a certain amount into coins and blue bills, and use no more than $a-1$ coins. Pasha wants to exchange the same amount in coins and red bills, but use no more than $a{}$ coins. Prove that they have equally many ways of doing so.

We have a board of $ 2011 \times 2011$, divided by lines parallel to the edges into $1 \times 1$ squares. Manuel, Reinaldo and Jorge (at that time order) play to form squares with vertices at the vertices of the grid. The one who forms the last possible square wins, so that its sides do not cut the sides of any unit square. Who can be sure that he will win?

Show that the length of a cycle that contains every edge of a connected graph is at most the sum between the vertices and nodes of the graph, minus $ 1. $

In a group of $n$ people $A_1,A_2… A_n$ each one has a different height. On each turn we can choose any three of them and figure out which one of them is the highest and which one is the shortest. What’s the least number of turns one has to make in order to arrange these people by height, if: a) $n=5$; b) $n=6$; c) $n=7$?

suppose that $\mathcal F\subseteq X^{(k)}$ and $|X|=n$. we know that for every three distinct elements of $\mathcal F$ like $A,B,C$, at most one of $A\cap B$,$B\cap C$ and $C\cap A$ is $\phi$. for $k\le \frac{n}{2}$ prove that: a) $|\mathcal F|\le max(1,4-\frac{n}{k})\times \dbinom{n-1}{k-1}$.(15 points) b) find all cases of equality in a) for $k\le \frac{n}{3}$.(5 points)

How many numbers of $ n $ digits formed only with $ 1,9,8 $ and $ 6 $ divide themselves by $ 3 $ ?

There are 1000 towns $A_{1},A_{2},\ldots ,A_{1000}$ with airports in a country and some of them are connected via flights. It's known that the $i$-th town is connected with $d_{i}$ other towns where $d_{1}\leq d_{2}\leq \ldots \leq d_{1000}$ and $d_{j}\geq j+1$ for every $j=1,2,\ldots 999-d_{999}$. Prove that if the airport of any town $A_{k}$ is closed, then we'd still be able to get from any town $A_{i}$ to any $A_{j}$ for $i,j\neq k$ (possibly by more than one flight).

Assume that the number of offspring for every man can be $0,1,\ldots, n$ with with probabilities $p_0,p_1,\ldots,p_n$ independently from each other, where $p_0+p_1+\cdots+p_n=1$ and $p_n\neq 0$. (This is the so-called Galton-Watson process.) Which positive integer $n$ and probabilities $p_0,p_1,\ldots,p_n$ will maximize the probability that the offspring of a given man go extinct in exactly the tenth generation?

Let $n \in N$ and $k$ be such that $1 \le k \le n$. Find the number of ordered $k$-tuples $(a_1, a_2,...,a_k)$ of integers such the $1 \le a_j \le n$, for $1 \le j \le k$ and [u]either [/u] there exist $l,m \in \{1, 2,..., k\}$ such that $l < m$ but $a_l > a_m$ [u]or [/u] there exists $l \in \{1, 2,..., k\}$ such that $a_l - l$ is an odd number.

Three faces of a regular tetrahedron are painted in white and the remaining one in black. Initially, the tetrahedron is positioned on a plane with the black face down. It is then tilted several times over its edges. After a while it returns to its original position. Can it now have a white face down?

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.

Let $\{a, b, c, d, e, f, g, h\}$ be a permutation of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. What is the probability that $\overline{abc} +\overline{def}$ is even?

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

On a circle there are $2n+1$ points, dividing it into equal arcs ($n\ge 2$). Two players take turns to erase one point. If after one player's turn, it turned out that all the triangles formed by the remaining points on the circle were obtuse, then the player wins and the game ends. Who has a winning strategy: the starting player or his opponent?

Lines parallel to the sides of an equilateral triangle are drawn so that they cut each of the sides into n equal segments and the triangle into n congruent triangles. Each of these n triangles is called a “cell”. Also lines parallel to each of the sides of the original triangle are drawn through each of the vertices of the original triangle. The cells between any two adjacent parallel lines form a “stripe”. (a) If $n =10$, what is the maximum number of cells that can be chosen so that no two chosen cells belong to one stripe? (b)The same question for $n = 9$. (R Zhenodarov)

Sofia places the dice on a table as shown in the figure, matching faces that have the same number on each die. She circles the table without touching the dice. What is the sum of the numbers of all the faces that she cannot see? $Note$. In all given the numbers on the opposite faces add up to 7.

Bob proposes the following game to Johanna. The board in the figure is an equilateral triangle subdivided in turn into $256$ small equilateral triangles, one of which is painted in black. Bob chooses any point inside the board and places a small token. Johanna can make three types of plays. Each of them consists of choosing any of the $3$ vertices of the board and move the token to the midpoint between the current position of the tile and the chosen vertex. In the second figure we see an example of a move in which Johana chose vertex $A$. Johanna wins if she manages to place her piece inside the triangle black. Prove that Johanna can always win in at most $4$ moves. [asy] unitsize(8 cm); pair A, B, C; int i; A = dir(60); C = (0,0); B = (1,0); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); [/asy] [asy] unitsize(8 cm); pair A, B, C, X, Y, Z; int i; A = dir(60); C = (0,0); B = (1,0); X = 9.2/16*(1,0) + 3.3/16*dir(60); Y = (A + X)/2; Z = rotate(60,X)*(Y); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } draw(A--X, dotted); draw(arc(Z,abs(X - Y),-12,40), Arrow(6)); label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); dot(A); dot(X); dot(Y); [/asy]

Let $N \geqslant 3$ be an integer. In the country of Sibyl, there are $N^2$ towns arranged as the vertices of an $N \times N$ grid, with each pair of towns corresponding to an adjacent pair of vertices on the grid connected by a road. Several automated drones are given the instruction to traverse a rectangular path starting and ending at the same town, following the roads of the country. It turned out that each road was traversed at least once by some drone. Determine the minimum number of drones that must be operating. [i]Proposed by Sutanay Bhattacharya and Anant Mudgal[/i]

Let $C$ be the set of all 100-digit numbers consisting of only the digits $1$ and $2$. Given a number in $C$, we may transform the number by considering any $10$ consecutive digits $x_0x_1x_2 \dots x_9$ and transform it into $x_5x_6\dots x_9x_0x_1\dots x_4$. We say that two numbers in $C$ are similar if one of them can be reached from the other by performing finitely many such transformations. Let $D$ be a subset of $C$ such that any two numbers in $D$ are not similar. Determine the maximum possible size of $D$.

Is it possible to write the numbers from $1$ to $100$ in the cells of a of a $10 \times 10$ square so that: 1. Each cell contains exactly one number; 2. Each number is written exactly once; 3. For any two cells that are symmetrical with respect to any of the perpendicular bisectors of sides of the original $10 \times 10$ square, the numbers in them must have the same parity. The figure below shows examples of such pairs of cells, in which the numbers must have the same parity. [img]https://i.ibb.co/b3P8t36/Kyiv-MO-2024-7-2.png[/img] [i]Proposed by Mykhailo Shtandenko[/i]