For a given number $ n $, let us denote by $ p_n $ the probability that when randomly selecting a pair of integers $ k, m $ satisfying the conditions $ 0 \leq k \leq m \leq 2^n $ (the selection of each pair is equally probable) the number $\binom{m}{k}$ will be even. Calculate $ \lim_{n\to \infty} p_n $.

Kobar and Borah are playing on a whiteboard with the following rules: They start with two distinct positive integers on the board. On each step, beginning with Kobar, each player takes turns changing the numbers on the board, either from $P$ and $Q$ to $2P-Q$ and $2Q-P$, or from $P$ and $Q$ to $5P-4Q$ and $5Q-4P$. The game ends if a player writes an integer that is not positive. That player is declared to lose, and the opponent is declared the winner. At the beginning of the game, the two numbers on the board are $2024$ and $A$. If it is known that Kobar does not lose on his first move, determine the largest possible value of $A$ so that Borah can win this game.

There are $12$ seats at a round table in a restaurant. A group of five women and seven men arrives at the table. How many ways are there for choosing the sitting order, provided that every woman ought to be surrounded by two men and two orders are regarded as different, if at least one person has a different neighbour on one's right side.

Two players in turn put two or three coins into their own hats (before the game starts, the hats are empty). Each time, after both players made five moves, they exchange hats.The player wins, if after his move his hat contains one hundred or more coins. Which player has a winning strategy?

Let $G$ be a $2n-$vertices simple graph such that in any partition of the set of vertices of $G$ into two $n-$vertices sets $V_1$ and $V_2$, the number of edges from a vertex in $V_1$ to another vertex in $V_1$ is equal to the number of edges from a vertex in $V_2$ to another vertex in $V_2$. Prove that all the vertices have equal degrees.

One test is a multiple choice test with $5$ questions, each with $4$ options, $2000$ candidates, each choosing only one answer for each item.Find the smallest possible integer $n$ that gives a student's answer sheet the following properties: In the student's answer sheet $n$, there are four sheets in it. Any two of the four tiles have exactly the same three answers. [i](tatari/nightmare)[/i]

A convex hexagon is called [i]pretty[/i] if it has four diagonals of length 1, such that their endpoints are all the vertex of the hexagon. ($a$) Given any real number $k$ with $0<k<1$ find a [i]pretty[/i] hexagon with area equal to $k$ ($b$) Show that the area of any [i]pretty[/i] hexagon is less than 1.

Let $p$ be a prime. Prove that any complete graph with $1000p$ vertices, whose edges are labelled with integers, has a cycle whose sum of labels is divisible by $p$.

Arnaldo and Bernaldo play the following game: given a fixed finite set of positive integers $A$ known by both players, Arnaldo picks a number $a \in A$ but doesn't tell it to anyone. Bernaldo thens pick an arbitrary positive integer $b$ (not necessarily in $A$). Then Arnaldo tells the number of divisors of $ab$. Show that Bernaldo can choose $b$ in a way that he can find out the number $a$ chosen by Arnaldo.

A set of $n\ge 9$ points is given on the plane. For any 9 it points can be selected from all circles so that all these points end up on selected circles. Prove that all n points lie on two circles

[u]Round 5[/u] [b]p13.[/b] The expression $\sqrt2 \times \sqrt[3]{3} \times \sqrt[6]{6}$ can be expressed as a single radical in the form $\sqrt[n]{m}$, where $m$ and $n$ are integers, and $n$ is as small as possible. What is the value of $m + n$? [b]p14.[/b] Bertie Bott also produces Bertie Bott’s Every Flavor Pez. Each package contains $6$ peppermint-, $2$ kumquat-, $3$ chili pepper-, and $5$ garlic-flavored candies in a random order. Harold opens a package and slips it into his Dumbledore-shaped Pez dispenser. What is the probability that of the first four candies, at least three are garlic-flavored? [b]p15.[/b] Quadrilateral $ABCD$ with $AB = BC = 1$ and $CD = DA = 2$ is circumscribed around and inscribed in two different circles. What is the area of the region between these circles? [u] Round 6[/u] [b]p16.[/b] Find all values of x that satisfy $\sqrt[3]{x^7} + \sqrt[3]{x^4} = \sqrt[3]{x}$. [b]p17.[/b] An octagon has vertices at $(2, 1)$, $(1, 2)$, $(-1, 2)$, $(-2, 1)$, $(-2, -1)$, $(-1, -2)$, $(1, -2)$, and $(2, -1)$. What is the minimum total area that must be cut off of the octagon so that the remaining figure is a regular octagon? [b]p18.[/b] Ron writes a $4$ digit number with no zeros. He tells Ronny that when he sums up all the two-digit numbers that are made by taking 2 consecutive digits of the number, he gets 99. He also reveals that his number is divisible by 8. What is the smallest possible number Ron could have written? [u]Round 7[/u] [b]p19.[/b] In a certain summer school, 30 kids enjoy geometry, 40 kids enjoy number theory, and 50 kids enjoy algebra. Also, the number of kids who only enjoy geometry is equal to the number of kids who only enjoy number theory and also equal to the number of kids who only enjoy algebra. What is the difference between the maximum and minimum possible numbers of kids who only enjoy geometry and algebra? [b]p20.[/b] A mouse is trying to run from the origin to a piece of cheese, located at $(4, 6)$, by traveling the shortest path possible along the lattice grid. However, on a lattice point within the region $\{0 \le x \le 4, 0 \le y \le 6$, $(x, y) \ne (0, 0),(4, 6)\}$ lies a rock through which the mouse cannot travel. The number of paths from which the mouse can choose depends on where the rock is placed. What is the difference between the maximum possible number of paths and the minimum possible number of paths available to the mouse? [b]p21.[/b] The nine points $(x, y)$ with $x, y \in \{-1, 0, 1\}$ are connected with horizontal and vertical segments to their nearest neighbors. Vikas starts at $(0, 1)$ and must travel to $(1, 0)$, $(0, -1)$, and $(-1, 0)$ in any order before returning to $(0, 1)$. However, he cannot travel to the origin $4$ times. If he wishes to travel the least distance possible throughout his journey, then how many possible paths can he take? [u]Round 8[/u] [b]p22.[/b] Let $g(x) = x^3 - x^2- 5x + 2$. If a, b, and c are the roots of g(x), then find the value of $((a + b)(b + c)(c + a))^3$. [b]p23.[/b] A regular octahedron composed of equilateral triangles of side length $1$ is contained within a larger tetrahedron such that the four faces of the tetrahedron coincide with four of the octahedron’s faces, none of which share an edge. What is the ratio of the volume of the octahedron to the volume of the tetrahedron? [b]p24.[/b] You are the lone soul at the south-west corner of a square within Elysium. Every turn, you have a $\frac13$ chance of remaining at your corner and a $\frac13$ chance of moving to each of the two closest corners. What is the probability that after four turns, you will have visited every corner at least once? PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134177p28401527]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134489p28406583]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A physicist encounters $2015$ atoms called usamons. Each usamon either has one electron or zero electrons, and the physicist can't tell the difference. The physicist's only tool is a diode. The physicist may connect the diode from any usamon $A$ to any other usamon $B$. (This connection is directed.) When she does so, if usamon $A$ has an electron and usamon $B$ does not, then the electron jumps from $A$ to $B$. In any other case, nothing happens. In addition, the physicist cannot tell whether an electron jumps during any given step. The physicist's goal is to isolate two usamons that she is sure are currently in the same state. Is there any series of diode usage that makes this possible? [i]Proposed by Linus Hamilton[/i]

There are $ n$ football teams in a round-robin competition where every 2 teams meet once. The winner of each match receives 3 points while the loser receives 0 points. In the case of a draw, both teams receive 1 point each. Let $ k$ be as follows: $ 2 \leq k \leq n \minus{} 1$. At least how many points must a certain team get in the competition so as to ensure that there are at most $ k \minus{} 1$ teams whose scores are not less than that particular team's score?

Let $n,k$, $1\le k\le n$ be fixed integers. Alice has $n$ cards in a row, where the card has position $i$ has the label $i+k$ (or $i+k-n$ if $i+k>n$). Alice starts by colouring each card either red or blue. Afterwards, she is allowed to make several moves, where each move consists of choosing two cards of different colours and swapping them. Find the minimum number of moves she has to make (given that she chooses the colouring optimally) to put the cards in order (i.e. card $i$ is at position $i$). NOTE: edited from original phrasing, which was ambiguous.

There are $n > 1$ distinct points marked in the plane. Prove that there exists a set of circles $\mathcal C$ such that [color=#FFFFFF]___[/color]$\bullet$ Each circle in $\mathcal C$ has unit radius. [color=#FFFFFF]___[/color]$\bullet$ Every marked point lies in the (strict) interior of some circle in $\mathcal C$. [color=#FFFFFF]___[/color]$\bullet$ There are less than $0.3n$ pairs of circles in $\mathcal C$ that intersect in exactly $2$ points. [i]Note: Weaker results with $\it{0.3n}$ replaced by $\it{cn}$ may be awarded points depending on the value of the constant $\it{c > 0.3}$.[/i] [i]Proposed by Siddharth Choppara, Archit Manas, Ananda Bhaduri, Manu Param[/i]

Frankie the Frog starts his morning at the origin in $\mathbb{R}^2$. He decides to go on a leisurely stroll, consisting of $3^1+3^{10}+3^{11}+3^{100}+3^{111}+3^{1000}$ moves, starting with the first move. On the $n$th move, he hops a distance of $$\max\{k\in\mathbb{Z}:3^k|n\}+1,$$ then turns $90^{\circ}$ counterclockwise. What is the square of the distance from his final position to the origin?

Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.

A city has a system of bus routes laid out in such a way that (a) there are exactly $11$ bus stops on each route; (b) it is possible to travel between any two bus stops without changing routes; (c) any two bus routes have exactly one bus stop in common. What is the number of bus routes in the city?

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

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$?

There are exactly $120$ Twitter subscribers from National Science High School. Statistics show that each of $10$ given celebrities has at least $85$ followers from National Science High School. Prove that there must be two students such that each of the $10$ celebrities is being followed in Twitter by at least one of these students.

Determine all integers $m$, for which it is possible to dissect the square $m\times m$ into five rectangles, with the side lengths being the integers $1, 2, … ,10$ in some order.

There are $n$ stone piles each consisting of $2018$ stones. The weight of each stone is equal to one of the numbers $1, 2, 3, ...25$ and the total weights of any two piles are different. It is given that if we choose any two piles and remove the heaviest and lightest stones from each of these piles then the pile which has the heavier one becomes the lighter one. Determine the maximal possible value of $n$.

Let $\pi(n)$ denote the number of primes less than or equal to $n$. A subset of $S=\{1,2,\ldots, n\}$ is called [i]primitive[/i] if there are no two elements in it with one of them dividing the other. Prove that for $n\geq 5$ and $1\leq k\leq \pi(n)/2,$ the number of primitive subsets of $S$ with $k+1$ elements is greater or equal to the number of primitive subsets of $S$ with $k$ elements. [i]Proposed by Cs. Sándor, Budapest[/i]

Integers between $1$ and $7$ are written on a blackboard. It is possible that not all the numbers from 1 to 7 are present, and it is also possible that one, some or all of the numbers are repeated, one or more times. A move consists of choosing one or more numbers on the blackboard, where all distinct, delete them and write different numbers in their place, such that the written numbers together with those deleted form the whole set $\{1, 2, 3, 4, 5, 6 , 7\}$ For example, moves allowed are: • delete a $4$ and a $5$, and write in their place the numbers $1, 2, 3, 6$ and $7$; • deleting a $1$, a $2$, a $3$, a $4$, a $5$, a $6$ and a $7$ and write nothing in their place. Prove that, if it is possible to find a sequence of moves, starting from the initial situation, leading to have on board a single number (written once), then this number does not depend on the sequence of moves used.