On a circle there are $n$ points such that every point has a distinct number. Determine the number of ways of choosing $k$ points such that for any point there are at least 3 points between this point and the nearest point. (clockwise) ($n,k\geq 2$)

The parallelepiped is constructed of the equal cubes. Three parallelepiped faces, having the common vertex are painted. Exactly half of all the cubes have at least one face painted. What is the total number of the cubes?

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

The cells of an $n \times n$ chessboard are coloured in several colours so that no $2\times 2$ square contains four cells of the same colour. A [i]proper path [/i] of length $m$ is a sequence $a_1,a_2,..., a_m$ of distinct cells in which the cells $a_i$ and $a_{i+1}$ have a common side and are coloured in different colours for all $1 \le i < m$. Show that there exists a proper path of length $n$.

Consider in the plane a finite set of segments such that the sum of their lengths is less than $\sqrt{2}$. Prove that there exists an infinite unit square grid covering the plane such that the lines defining the grid do not intersect any of the segments. [i]Vasile Pop[/i]

In the plane, $2022$ points are chosen such that no three points lie on the same line. Each of the points is coloured red or blue such that each triangle formed by three distinct red points contains at least one blue point. What is the largest possible number of red points? [i]Proposed by Art Waeterschoot, Belgium[/i]

[b]p1.[/b] Solve the system of equations $$xy = 2x + 3y$$ $$yz = 2y + 3z$$ $$zx =2z+3x$$ [b]p2.[/b] For any integer $k$ greater than $1$ and any positive integer $n$ , prove that $n^k$ is the sum of $n$ consecutive odd integers. [b]p3.[/b] Determine all pairs of real numbers, $x_1$, $x_2$ with $|x_1|\le 1$ and $|x_2|\le 1$ which satisfy the inequality: $|x^2-1|\le |x-x_1||x-x_2|$ for all $x$ such that $|x| \ge 1$. [b]p4.[/b] Find the smallest positive integer having exactly $100$ different positive divisors. (The number $1$ counts as a divisor). [b]p5.[/b] $ABC$ is an equilateral triangle of side $3$ inches. $DB = AE = 1$ in. and $F$ is the point of intersection of segments $\overline{CD}$ and $\overline{BE}$ . Prove that $\overline{AF} \perp \overline{CD}$. [img]https://cdn.artofproblemsolving.com/attachments/f/a/568732d418f2b1aa8a4e8f53366df9fbc74bdb.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Csongi bought a $12$-sided convex polygon-shaped pizza. The pizza has no interior point with three or more distinct diagonals passing through it. Áron wants to cut the pizza along $3$ diagonals so that exactly $6$ pieces of pizza are created. In how many ways can he do this? Two ways of slicing are different if one of them has a cut line that the other does not have.

There are $40$ identical gas cylinders, gas pressure values in which we are unknown and may be evil. It is allowed to connect any cylinders with each other in an amount not exceeding a given natural number $k$, and then separate them; while the pressure gas in the connected cylinders is set equal to the arithmetic average of the pressures in them before the connection. At what minimum $k$ is there a way to equalize the pressures in all $40$ cylinders, regardless of initial pressure distribution in the cylinders?

Eight pawns are placed on a chessboard, so that there is one in each row and column. Show that an even number of the pawns are on black squares.

There are $30$ men with their $30$ wives sitting at a round table. Show that there always exist two men who are on the same distance from their wives. (The seats are arranged at vertices of a regular polygon.)

Liliana wants to paint a $m\times n$ board. Liliana divides each unit square by one of its diagonals and paint one of the halves of the square with black and the other half with white in such a way that triangles that have a common side haven't the same colour. How many possibilities has Liliana to paint the board?

Let $n$ be a positive integer, let $f_1(x),\ldots,f_n(x)$ be $n$ bounded real functions, and let $a_1,\ldots,a_n$ be $n$ distinct reals. Show that there exists a real number $x$ such that $\sum^n_{i=1}f_i(x)-\sum^n_{i=1}f_i(x-a_i)<1$.

Suppose that an isosceles right-angled triangle is divided into $m$ acute-angled triangles. Find the smallest possible $m$ for which this is possible.

A $2\times 2\times 12$ box fixed in space is to be filled with twenty-four $1 \times 1 \times 2$ bricks. In how many ways can this be done?

* A bus route has $14$ stops (counting the first and the last). A bus cannot carry more than $25$ passengers. We assume that a passenger takes a bus from $A$ to $B$ if (s)he enters the bus at $A$ and gets off at $B$. Prove that for any bus route: a) there are $8$ distinct stops $A_1, B_1, A_2, B_2, A_3, B_3, A_4, B_4$ such that no passenger rides from $A_k$ to $B_k$ for all $k = 1, 2, 3, 4$ (#) b) there might not exist $10$ distinct stops $A_1, B_1, . . . , A_5, B_5$ with property (#).

Two players take turns playing on a $3\times1001$ board whose squares are initially all white. Each player, in his turn, paints two squares located in the same row or column black, not necessarily adjacent. The player who cannot make his move loses the game. Determine which of the two players has a strategy that allows them to win, no matter how well his opponent plays.

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

Given a square $5$ x $7$ board and $35$ pieces, each piece is formed by $3$ squares like below: [size=75][center][img]https://i.ibb.co/hFDhp9p/Screenshot-2023-03-26-061057.png[/img][/center][/size] Can we fill the board with $35$ pieces such that there are exactly $3$ pieces superimpose on every square of the given board? [i][color=#E06666]Note: we can rotate, turn upside down the pieces[/color][/i]

Let $n$ be a positive integer. Each cell of a $2n\times 2n$ square is painted in one of the $4n^2$ colors (with some colors may be missing). We will call any two-cell rectangle a [i]domino[/I], and a domino is called [i]colorful[/I] if its cells have different colors. Let $k$ be the total number of colorful dominoes in our square; $l$ be the maximum integer such that every partition of the square into dominoes contains at least $l$ colorful dominoes. Determine the maximum possible value of $4l-k$ over all possible colourings of the square.

$n$ squares of the infinite cross-lined sheet of paper are painted with black colour (others are white). Every move all the squares of the sheet change their colour simultaneously. The square gets the colour, that had the majority of three ones: the square itself, its neighbour from the right side and its neighbour from the upper side. a) Prove that after the finite number of the moves all the black squares will disappear. b) Prove that it will happen not later than on the $n$-th move

A school organizes optional lectures for 200 students. At least 10 students have signed up for each proposed lecture, and for any two students there is at most one lecture that both of them have signed up for. Prove that it is possible to hold all these lectures over 211 days so that no one has to attend two lectures in one day.

Each point of a plane is colored in one of three colors: red, black and blue. Prove that there exists a rectangle in this plane whose vertices all have the same color.

On the faces of a cube several positive integer numbers are written. On every edge the sum of the numbers of it's two faces is written, and in every vertex the sum of numbers on the three faces that have this vertex. It turned out that all the written numbers are different. Find the smallest possible amount of the sum of all written numbers.