There are $15$ people, including Petruk, Gareng, and Bagong, which will be partitioned into $6$ groups, randomly, that consists of $3, 3, 3, 2, 2$, and $2$ people (orders are ignored). Determine the probability that Petruk, Gareng, and Bagong are in a group.

An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.

All the species of plants existing in Russia are catalogued (numbered by integers from $2$ to $2000$ ; one after another, without omissions or repetitions). For any pair of species the gcd of their catalogue numbers was calculated and recorded but the catalogue numbers themselves were lost. Is it possible to restore the catalogue numbers from the data in hand?

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?

Write $2017$ following numbers on the blackboard: $-\frac{1008}{1008}, -\frac{1007}{1008}, ..., -\frac{1}{1008}, 0,\frac{1}{1008},\frac{2}{1008}, ... ,\frac{1007}{1008},\frac{1008}{1008}$ . One processes some steps as: erase two arbitrary numbers $x, y$ on the blackboard and then write on it the number $x + 7xy + y$. After $2016$ steps, there is only one number. The last one on the blackboard is (A): $-\frac{1}{1008}$ (B): $0$ (C): $\frac{1}{1008}$ (D): $-\frac{144}{1008}$ (E): None of the above

Determine whether it's possible to cover a $K_{2012}$ with a) 1000 $K_{1006}$'s; b) 1000 $K_{1006,1006}$'s. [i]David Yang.[/i]

Define $K(n,0)=\varnothing $ and, for all nonnegative integers m and n, $K(n,m+1)=\left\{ \left. k \right|\text{ }1\le k\le n\text{ and }K(k,m)\cap K(n-k,m)=\varnothing \right\}$. Find the number of elements of $K(2004,2004)$.

Let's call it a [i] staircase of height [/i]$n$, a figure consisting from all square cells $n\times n$ lying no higher diagonals (the figure shows a [i]staircase of height [/i] $4$ ). In how many different ways can a [i]staircase of height[/i] $n$ can be divided into several rectangles whose sides go along the grid lines, but the areas are different in pairs? [img]https://cdn.artofproblemsolving.com/attachments/f/0/f66d7e9ada0978e8403fbbd8989dc1b201f2cd.png[/img]

There is a pile with 2022 rocks. Ana y Beto play by turns to the following game, starting with Ana: in each turn, if there are $n$ rocks in the pile, the player can remove $S(n)$ rocks or $n-S(n)$ rocks, where $S(n)$ is the sum of the the digits of $n$. The person who removes the last rock wins. Determine which of the two players has a winning strategy and describe it.

In a deck of cards, there are $kn$ cards numbered from $1$ to $n$ and there are $k$ cards of each number. Now, divide this deck into $k$ sub-decks with equal sizes. Prove that if $\gcd(k,n)=1$, then one could always pick $n$ cards, one from each sub-deck, such that the sum of those cards is divisible by $n$.

There are $2022$ equally spaced points on a circular track $\gamma$ of circumference $2022$. The points are labeled $A_1, A_2, \ldots, A_{2022}$ in some order, each label used once. Initially, Bunbun the Bunny begins at $A_1$. She hops along $\gamma$ from $A_1$ to $A_2$, then from $A_2$ to $A_3$, until she reaches $A_{2022}$, after which she hops back to $A_1$. When hopping from $P$ to $Q$, she always hops along the shorter of the two arcs $\widehat{PQ}$ of $\gamma$; if $\overline{PQ}$ is a diameter of $\gamma$, she moves along either semicircle. Determine the maximal possible sum of the lengths of the $2022$ arcs which Bunbun traveled, over all possible labellings of the $2022$ points. [i]Kevin Cong[/i]

There are 20 towns on the bay of a circular island. Each town has 20 teams for a mathematical duel. No two of these teams are of equal strength. When two teams meet in a duel, the stronger one wins. For a given number $n\in \mathbb{N}$ one town $A$ can be called [i]“n-stronger”[/i] than $B$, if there exist $n$ different duels between a team from $A$ and team from $B$, for which the team from $A$ wins. Find the maximum value of $n$, for which it is possible for each town to be [i]n-stronger[/i] by its neighboring one clockwise.

A fighting game club has $2024$ members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly $3$ other members. Each match has a winner and a loser. A member will be [i]happy[/i] if they won in at least $2$ of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?

(a) The vertices of a regular $10$-gon are painted in turn black and white. Two people play the following game . Each in turn draws a diagonal connecting two vertices of the same colour . These diagonals must not intersect . The winner is the player who is able to make the last move. Who will win if both players adopt the best strategy? (b) Answer the same question for the regular $12$-gon . (V.G. Ivanov)

Suppose that $1985$ points are given inside a unit cube. Show that one can always choose $32$ of them in such a way that every (possibly degenerate) closed polygon with these points as vertices has a total length of less than $8 \sqrt 3.$

Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$-staircase. Find the number of ways in which an $n$-stair case can be partitioned into several rectangles, with sides along the grid lines, having mutually distinct areas.

In a badminton tournament, each of $n$ players play all the other $n-1$ players. Each game results in either a win, or a loss. The players then write down the names of those whom they defeated, and also of those who they defeated. For example, if $A$ beats $B$ and $B$ beats $C,$ then $A$ writes the names of both $B$ and $C$. Show that there will be one person, who has written down the names of all the other $n-1$ players. [hide="Clarification"] Consider a game between $A,B,C,D,E,F,G$ where $A$ defeats $B$ and $C$ and $B$ defeats $E,F$, $C$ defeats $E.$ Then $A$'s list will have $(B,C,E,F)$, and will not include $G.$ [/hide]

Jerry has red blocks, yellow blocks, and blue blocks. He builds a tower $5$ blocks high, without any $2$ blocks of the same color touching each other. Also, if the tower is flipped upside-down, it still looks the same. Compute the number of ways Jerry could have built this tower.

Let \( n \geq 4 \) be an integer. Show that at a party of \( n \) people, it is possible for each person to have greeted exactly three other people if and only if \( n \) is even.

A 3-dimensional chess board consists of $ 4 \times 4 \times 4$ unit cubes. A rook can step from any unit cube K to any other unit cube that has a common face with K. A bishop can step from any unit cube K to any other unit cube that has a common edge with K, but does not have a common face. One move of both a rook and a bishop consists of an arbitrary positive number of consecutive steps in the same direction. Find the average number of possible moves for either piece, where the average is taken over all possible starting cubes K.

Let $n > 2$ be an even number. The squares of an $n\times n$ chessboard are coloured with $\frac12 n^2$ colours in such a way that every colour is used for colouring exactly two of the squares. Prove that one can place $n$ rooks on squares of $n$ different colours such that no two of the rooks can take each other.

A number of robots are placed on the squares of a finite, rectangular grid of squares. A square can hold any number of robots. Every edge of each square of the grid is classified as either passable or impassable. All edges on the boundary of the grid are impassable. You can give any of the commands up, down, left, or right. All of the robots then simultaneously try to move in the specified direction. If the edge adjacent to a robot in that direction is passable, the robot moves across the edge and into the next square. Otherwise, the robot remains on its current square. You can then give another command of up, down, left, or right, then another, for as long as you want. Suppose that for any individual robot, and any square on the grid, there is a finite sequence of commands that will move that robot to that square. Prove that you can also give a finite sequence of commands such that all of the robots end up on the same square at the same time.

There are $ n$ students; each student knows exactly $d $ girl students and $d $ boy students ("knowing" is a symmetric relation). Find all pairs $ (n,d) $ of integers .

We have $n\ge3$ points on the plane such that no three are collinear. Prove that it's possible to name them $P_1,P_2,\ldots,P_n$ such that for all $1<i<n$, the angle $\angle P_{i-1}P_iP_{i+1}$ is acute.

Let $n$ be an integer greater than 1. The set $S$ of all diagonals of a $ \left( 4n-1\right) $-gon is partitioned into $k$ sets, $S_{1},S_{2},\ldots ,S_{k},$ so that, for every pair of distinct indices $i$ and $j,$ some diagonal in $S_{i}$ crosses some diagonal in $S_{j};$ that is, the two diagonals share an interior point. Determine the largest possible value of $k $ in terms of $n.$