In the figure, the rectangle is formed by $4$ smaller equal rectangles. If we count the total number of rectangles in the figure we find $10$. How many rectangles in total will there be in a rectangle that is formed by $n$ smaller equal rectangles?

In each square of the table below, we must write a different integer from $1$ to $17$, such that the sum of the numbers in each of the eight columns is the same, and the sum of the numbers in the top row is twice the sum of the numbers in the bottom row. Which number from $1$ to $17$ can be omitted? [img]https://wiki-images.artofproblemsolving.com//2/2b/Zrzut_ekranu_2023-05-22_o_10.28.33.png[/img]

Let $n$ and $k$ be positive integers such that $k\leq 2^n$. Banana and Corona are playing the following variant of the guessing game. First, Banana secretly picks an integer $x$ such that $1\leq x\leq n$. Corona will attempt to determine $x$ by asking some questions, which are described as follows. In each turn, Corona chooses $k$ distinct subsets of $\{1, 2, \ldots, n\}$ and, for each chosen set $S$, asks the question "Is $x$ in the set $S$?''. Banana picks one of these $k$ questions and tells both the question and its answer to Corona, who can then start another turn. Find all pairs $(n,k)$ such that, regardless of Banana's actions, Corona could determine $x$ in finitely many turns with absolute certainty. [i]Pitchayut Saengrungkongka, Thailand[/i]

Given an integer number $n \geq 3$, consider $n$ distinct points on a circle, labelled $1$ through $n$. Determine the maximum number of closed chords $[ij]$, $i \neq j$, having pairwise non-empty intersections. [i]János Pach[/i]

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

Let $n$ be a positive integer. Two players, Alice and Bob, are playing the following game: - Alice chooses $n$ real numbers; not necessarily distinct. - Alice writes all pairwise sums on a sheet of paper and gives it to Bob. (There are $\frac{n(n-1)}{2}$ such sums; not necessarily distinct.) - Bob wins if he finds correctly the initial $n$ numbers chosen by Alice with only one guess. Can Bob be sure to win for the following cases? a. $n=5$ b. $n=6$ c. $n=8$ Justify your answer(s). [For example, when $n=4$, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]

Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths. (Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.) [i]Fedor Petrov, Russia[/i]

Let $x_1,\dots ,x_n$ be real numbers. We look at all the $2^{n-1}$ possible sums between some of the numbers. If the number of different sums is at least $1.8^n$, prove that the number of sums equal to $2022$ is no more than $1.67^n$.

We have triangulated a convex $(n+1)$-gon $P_0P_1\dots P_n$ (i.e., divided it into $n-1$ triangles with $n-2$ non-intersecting diagonals). Prove that the resulting triangles can be labelled with the numbers $1,2,\dots,n-1$ such that for any $i\in\{1,2,\dots,n-1\}$, $P_i$ is a vertex of the triangle with label $i$.

Find all numbers $n \in \mathbb{N}^*$ for which there exists a finite set of natural numbers $A=(a_1, a_2,...a_n)$ so that for any $k$ $(1\leq k \leq n)$ the number $a_k$ is the number of all multiples of $k$ in set $A$.

Given a finite graph $G$, let $f(G)$ be the number of triangles in graph $G$, $g(G)$ be the number of edges in graph $G$, find the minimum constant $c$, so that for each graph $G$, there is $f^ 2(G)\le c \cdot g^3(G)$.

Consider the set $ M = \{1,2, \ldots ,2008\}$. Paint every number in the set $ M$ with one of the three colors blue, yellow, red such that each color is utilized to paint at least one number. Define two sets: $ S_1=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have the same color and }2008 | (x + y + z)\}$; $ S_2=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have three pairwisely different colors and }2008 | (x + y + z)\}$. Prove that $ 2|S_1| > |S_2|$ (where $ |X|$ denotes the number of elements in a set $ X$).

Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

On a table there are $100$ red and $k$ white buckets for which all of them are initially empty. In each move, a red and a white bucket is selected and an equal amount of water is added to both of them. After some number of moves, there is no empty bucket and for every pair of buckets that are selected together at least once during the moves, the amount of water in these buckets is the same. Find all the possible values of $k$.

Given a regular 103-sided polygon. 79 vertices are colored red and the remaining vertices are colored blue. Let $A$ be the number of pairs of adjacent red vertices and $B$ be the number of pairs of adjacent blue vertices. a) Find all possible values of pair $(A,B).$ b) Determine the number of pairwise non-similar colorings of the polygon satisfying $B=14.$ 2 colorings are called similar if they can be obtained from each other by rotating the circumcircle of the polygon.

Numbers $m$ and $n$ are given positive integers. There are $mn$ people in a party, standing in the shape of an $m\times n$ grid. Some of these people are police officers and the rest are the guests. Some of the guests may be criminals. The goal is to determine whether there is a criminal between the guests or not.\\ Two people are considered \textit{adjacent} if they have a common side. Any police officer can see their adjacent people and for every one of them, know that they're criminal or not. On the other hand, any criminal will threaten exactly one of their adjacent people (which is likely an officer!) to murder. A threatened officer will be too scared, that they deny the existence of any criminal between their adjacent people.\\ Find the least possible number of officers such that they can take position in the party, in a way that the goal is achievable. (Note that the number of criminals is unknown and it is possible to have zero criminals.) [i]Proposed by Abolfazl Asadi[/i]

Determine whether there exist $100$ disks $D_2,D_3,\ldots ,D_{101}$ in the plane such that the following conditions hold for all pairs $(a,b)$ of indices satisfying $2\le a< b\le 101$: [list] [*] If $a|b$ then $D_a$ is contained in $D_b$. [*] If $\gcd (a,b)=1$ then $D_a$ and $D_b$ are disjoint. [/list] (A disk $D(O,r)$ is a set of points in the plane whose distance to a given point $O$ is at most a given positive real number $r$.)

There are$n$ balls numbered $1,2,\cdots,n$, respectively. They are painted with $4$ colours, red, yellow, blue, and green, according to the following rules: First, randomly line them on a circle. Then let any three clockwise consecutive balls numbered $i, j, k$, in order. 1) If $i>j>k$, then the ball $j$ is painted in red; 2) If $i<j<k$, then the ball $j$ is painted in yellow; 3) If $i<j, k<j$, then the ball $j$ is painted in blue; 4) If $i>j, k>j$, then the ball $j$ is painted in green. And now each permutation of the balls determine a painting method. We call two painting methods distinct, if there exists a ball, which is painted with two different colours in that two methods. Find out the number of all distinct painting methods.

Find all integers $ n $ $(n\geq2)$ with the property: for every $ n $ distinct disks in a plane with at least a common point one of the disks contains the center of another disk.

A teacher creates a fraction using numbers from $1$ to $12$ (including $12$). He writes some of the numbers on the numerator, and writes $\times$ (multiplication) between each number. Then he writes the rest of the numbers in the denominator and also writes $\times$ between each number. There is at least one number both in numerator and denominator. The teacher ensures that the fraction is equal to the smallest possible integer possible. What is this positive integer, which is also the value of the fraction?

Fredy starts at the origin of the Euclidean plane. Each minute, Fredy may jump a positive integer distance to another lattice point, provided the jump is not parallel to either axis. Can Fredy reach any given lattice point in 2023 jumps or less? [i]Proposed by Tony Wang[/i]

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

In the diagram below $a, b, c, d, e, f, g, h, i, j$ are distinct positive integers and each (except $a, e, h$ and $j$) is the sum of the two numbers to the left and above. For example, $b = a + e, f = e + h, i = h + j$. What is the smallest possible value of $d$? j h i e f g a b c d

A [i]magic[/i] octagon is an octagon whose sides follow the lines of the checkerboard's checkers and the side lengths are $1, 2, 3, 4, 5, 6, 7, 8$ (in any order). What is the largest possible area of the magic octagon? [hide=original wording]Burvju astoņstūris ar astoņstūris, kura malas iet pa rūtiņu lapas rūtiņu līnijām un malu garumi ir 1, 2,3, 4, 5, 6, 7, 8 (jebkādā secībā). Kāds ir lielākais iespējamais burvju astoņstūra laukums?[/hide]

Initially, the number $1$ is written on the blackboard. At each step, the number on the blackboard is erased and another is written, which is obtained by applying any of the following operations: Operation A: Multiply the number on the board with $\frac12$. Operation B: Subtract the number on the board from $1$. For example, if the number $\frac38$ is on the board, it can be replaced by $\frac12 \frac38=\frac{3}{16}$ or by $1-\frac38=\frac58$ . Give a sequence of steps after which the number on the board is $\frac{2009}{2^{20009}}$ .