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?

On a large chessboard $2n$ of its $1 \times 1$ squares have been marked such thar the rook (which moves only horizontally or vertically) can visit all the marked squares without jumpin over any unmarked ones. Prove that the figure consisting of all the marked squares can be cut into rectangles. (A Shapovalov)

There are $n$ matches on the table ($n > 1$). Two players take turns shooting them from the table. On the first move, the player removes any number of matches from the table from $1$ to $n - 1$, and then each time you can take no more matches from the table, than the partner took with the previous move. The one who took the last match wins.. Find all $n$ for which the first player can provide win for yourself.

Let $S$ be a set with six elements. Let $P$ be the set of all subsets of $S.$ Subsets $A$ and $B$ of $S$, not necessarily distinct, are chosen independently and at random from $P$. the probability that $B$ is contained in at least one of $A$ or $S-A$ is $\frac{m}{n^{r}},$ where $m$, $n$, and $r$ are positive integers, $n$ is prime, and $m$ and $n$ are relatively prime. Find $m+n+r.$ (The set $S-A$ is the set of all elements of $S$ which are not in $A.$)

For a positive integer $n$, $n$ vertices which have $10000$ written on them exist on a plane. For $3$ vertices that are collinear and are written positive numbers on them, denote procedure $P$ as subtracting $1$ from the outer vertices and adding $2023$ to the inner vertical. Show that procedure $P$ cannot be repeated infinitely.

In the nation of Onewaynia, certain pairs of cities are connected by roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges). Some roads have a traffic capacity of 1 unit and other roads have a traffic capacity of 2 units. However, on every road, traffic is only allowed to travel in one direction. It is known that for every city, the sum of the capacities of the roads connected to it is always odd. The transportation minister needs to assign a direction to every road. Prove that he can do it in such a way that for every city, the difference between the sum of the capacities of roads entering the city and the sum of the capacities of roads leaving the city is always exactly one. [i]Proposed by Zuming Feng and Yufei Zhao[/i]

In a matrix $2n \times 2n$, $n \in N$, are $4n^2$ real numbers with a sum equal zero. The absolute value of each of these numbers is not greater than $1$. Prove that the absolute value of a sum of all the numbers from one column or a row doesn't exceed $n$.

We consider an integer $n \ge 3,$ the set $S=\{1,2,3,\ldots,n\}$ and the set $\mathcal{F}$ of the functions from $S$ to $S.$ We say that $\mathcal{G} \subset \mathcal{F}$ is a generating set for $\mathcal{H} \subset \mathcal{F}$ if any function in $\mathcal{H}$ can be represented as a composition of functions from $\mathcal{G}.$ a) Let the functions $a:S \to S,$ $a(n-1)=n,$ $a(n)=n-1$ and $a(k)=k$ for $k \in S \setminus \{n-1,n\}$ and $b:S \to S,$ $b(n)=1$ and $b(k)=k+1$ for $k \in S \setminus \{n\}.$ Prove that $\{a,b\}$ is a generating set for the set $\mathcal{B}$ of bijective functions of $\mathcal{F}.$ b) Prove that the smallest number of elements that a generating set of $\mathcal{F}$ has is $3.$

There are only two letters in the Mumu tribe alphabet: M and $U$. The word in the Mumu language is any sequence of letters $M$ and $U$, in which next to each letter $M$ there is a letter $U$ (for example, $UUU$ and $UMMUM$ are words and $MMU$ is not). Let $f(m,u)$ denote the number of words in the Mumu language which have $m$ times the letter $M$ and $u$ times the letter $U$. Prove that $f (m, u) - f (2u - m + 1, u) = f (m, u - 1) - f (2u - m + 1, u - 1)$ for any $u \ge 2,3 \le m \le 2u$.

Given a $4 \times 4$ grid board with each square painted a different color, you want to cut it into two pieces of equal area by making a single cut along the grid lines. In how many ways can it be done?

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

In the land of Binary , the unit of currency is called Ben and currency notes are available in denominations $1,2,2^2,2^3,..$ Bens. The rules of the Government of Binary stipulate that one can not use more than two notes of any one denomination in any transaction. For example, one can give change for $2$ Bens in two ways : $2$ one Ben notes or $1$ two Ben note. For $5$ Ben one can given $1$ one Ben and $1$ four Ben note or $1$ Ben note and $2$ two Ben notes. Using $5$ one Ben notes or $3$ one Ben notes and $1$ two Ben notes for a $5$ Ben transaction is prohibited. Find the number of ways in which one can give a change $100$ Bens following the rules of the Government.

In the interior of a circle centred at $O$ consider the $1200$ points $A_1,A_2,\ldots ,A_{1200}$, where for every $i,j$ with $1\le i\le j\le 1200$, the points $O,A_i$ and $A_j$ are not collinear. Prove that there exist the points $M$ and $N$ on the circle, with $\angle MON=30^{\circ}$, such that in the interior of the angle $\angle MON$ lie exactly $100$ points.

In an $m\times n$ rectangular chessboard,there is a stone in the lower leftmost square. Two persons A,B move the stone alternately. In each step one can move the stone upward or rightward any number of squares. The one who moves it into the upper rightmost square wins. Find all $(m,n)$ such that the first person has a winning strategy.

Given a simple number $p>3$. Consider the set $M$ of the pairs $(x,y)$ with the integer coordinates in the plane such that $0 \le x < p, 0 \le y < p$. Prove that it is possible to mark $p$ points of $M$ such that not a triple of marked points will belong to one line and there will be no parallelogram with the vertices in the marked points.

Define a positive integer $n$ to be a fake square if either $n = 1$ or $n$ can be written as a product of an even number of not necessarily distinct primes. Prove that for any even integer $k \geqslant 2$, there exist distinct positive integers $a_1$, $a_2, \cdots, a_k$ such that the polynomial $(x+a_1)(x+a_2) \cdots (x+a_k)$ takes ‘fake square’ values for all $x = 1,2,\cdots,2023$. [i]Proposed by Prof. Aditya Karnataki[/i]

There is a regular $2021$-gon. We put a coin with heads up on every vertex of it. Every time, you can choose one vertex, and flip the coin on the vertices adjacent to it. Can you make all the coin tails up?

Find all positive integers $ n $ with the following property: It is possible to fill a $ n \times n $ chessboard with one of arrows $ \uparrow, \downarrow, \leftarrow, \rightarrow $ such that 1. Start from any grid, if we follows the arrows, then we will eventually go back to the start point. 2. For every row, except the first and the last, the number of $ \uparrow $ and the number of $ \downarrow $ are the same. 3. For every column, except the first and the last, the number of $ \leftarrow $ and the number of $ \rightarrow $ are the same.

In the country of Muilejistan, there exists a network of roads connecting all its cities. The network has the particular property that for any two cities, there is a unique path without backtracking (i.e., a path where the traveler never returns along the same road). The longest possible path between two cities is 600 kilometers. For instance, the path from the city of Mlar to the city of Nlar is 600 kilometers. Similarly, the path from the city of Klar to the city of Glar is also 600 kilometers. 1. If Jalim departs from Mlar towards Nlar at noon and Kalim departs from Klar towards Glar also at noon, both traveling at the same speed, prove that they meet at some point on their journey. 2. If the distance in kilometers between any two cities is an integer, prove that the distance from Glar to Mlar is even.

A regular $n{}$-gon and a regular $m$-gon with distinct vertices are inscribed in the same circle. The vertices of these polygons divide the circle into $n+m$ arcs. Is it always possible to inscribe a regular $(n+m)$-gon in the same circle so that exactly one of its vertices is on each of these arcs?

[b]p1.[/b] What is $20\times 19 + 20 \div (2 - 7)$? [b]p2.[/b] Will has three spinners. The first has three equally sized sections numbered $1$, $2$, $3$; the second has four equally sized sections numbered $1$, $2$, $3$, $4$; and the third has five equally sized sections numbered $1$, $2$, $3$, $4$, $5$. When Will spins all three spinners, the probability that the same number appears on all three spinners is $p$. Compute $\frac{1}{p}$. [b]p3.[/b] Three girls and five boys are seated randomly in a row of eight desks. Let $p$ be the probability that the students at the ends of the row are both boys. If $p$ can be expressed in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p4.[/b] Jaron either hits a home run or strikes out every time he bats. Last week, his batting average was $.300$. (Jaron's batting average is the number of home runs he has hit divided by the number of times he has batted.) After hitting $10$ home runs and striking out zero times in the last week, Jaron has now raised his batting average to $.310$. How many home runs has Jaron now hit? [b]p5.[/b] Suppose that the sum $$\frac{1}{1 \cdot 4} +\frac{1}{4 \cdot 7}+ ...+\frac{1}{97 \cdot 100}$$ is expressible as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p6.[/b] Let $ABCD$ be a unit square with center $O$, and $\vartriangle OEF$ be an equilateral triangle with center $A$. Suppose that $M$ is the area of the region inside the square but outside the triangle and $N$ is the area of the region inside the triangle but outside the square, and let $x = |M -N|$ be the positive difference between $M$ and $N$. If $$x =\frac1 8(p -\sqrt{q})$$ for positive integers $p$ and $q$, find $p + q$. [b]p7.[/b] Find the number of seven-digit numbers such that the sum of any two consecutive digits is divisible by $3$. For example, the number $1212121$ satisfies this property. [b]p8.[/b] There is a unique positive integer $x$ such that $x^x$ has $703$ positive factors. What is $x$? [b]p9.[/b] Let $x$ be the number of digits in $2^{2019}$ and let $y$ be the number of digits in $5^{2019}$. Compute $x + y$. [b]p10.[/b] Let $ABC$ be an isosceles triangle with $AB = AC = 13$ and $BC = 10$. Consider the set of all points $D$ in three-dimensional space such that $BCD$ is an equilateral triangle. This set of points forms a circle $\omega$. Let $E$ and $F$ be points on $\omega$ such that $AE$ and $AF$ are tangent to $\omega$. If $EF^2$ can be expressed in the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers, determine $m + n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k$ and $N$ be positive real numbers which satisfy $k\leq N$. For $1\leq i \leq k$, there are subsets $A_i$ of $\{1,2,3,\ldots,N\}$ that satisfy the following property. For arbitrary subset of $\{ i_1, i_2, \ldots , i_s \} \subset \{ 1, 2, 3, \ldots, k \} $, $A_{i_1} \triangle A_{i_2} \triangle ... \triangle A_{i_s}$ is not an empty set. Show that a subset $\{ j_1, j_2, .. ,j_t \} \subset \{ 1, 2, ... ,k \} $ exist that satisfies $n(A_{j_1} \triangle A_{j_2} \triangle \cdots \triangle A_{j_t}) \geq k$. ($A \triangle B=A \cup B-A \cap B$)

The water city of Platense consists of many platforms and bridges between them. Each bridge connects two platforms and there is not two bridges connecting the same two platforms. The mayor wants to switch some bridges by a series of moves in the following way: if there are three platforms $A,B,C$ and bridges $AB$ and $AC$ ([b]no[/b] bridge $BC$), he can switch bridge $AB$ to a bridge $BC$. A configuration of bridges is [i]good[/i] if it is possible to go to any platfom from any platform using only bridges. Starting in a good configuration, prove that the mayor can reach any other good configuration, whose the quantity of bridges is the same, using the allowed moves.

A square of $3 \times 3$ is subdivided into 9 small squares of $1 \times 1$. It is desired to distribute the nine digits $1, 2, . . . , 9$ in each small square of $1 \times 1$, a number in each small square. Find the number of different distributions that can be formed in such a way that the difference of the digits in cells that share a side in common is less than or equal to three. Two distributions are distinct even if they differ by rotation and/or reflection.

Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \). Answer the following questions: 1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph. 2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.