A finite set $M$ of real numbers has the following properties: $M$ has at least $4$ elements, and there exists a bijective function $f:M\to M$, different from the identity, such that $ab\leq f(a)f(b)$ for all $a\neq b\in M.$ Prove that the sum of the elements of $M$ is $0.$

A sequence of integers $x_1, x_2, ...$ is [i]double-dipped[/i] if $x_{n+2} = ax_{n+1} + bx_n$ for all $n \ge 1$ and some fixed integers $a, b$. Ri begins to form a sequence by randomly picking three integers from the set $\{1, 2, ..., 12\}$, with replacement. It is known that if Ri adds a term by picking anotherelement at random from $\{1, 2, ..., 12\}$, there is at least a $\frac13$ chance that his resulting four-term sequence forms the beginning of a double-dipped sequence. Given this, how many distinct three-term sequences could Ri have picked to begin with?

There is house with $2^n$ rooms and every room has one light bulb and light switch. But wiring was connected wrong, so light switch can turn on light in some another room. Master want to find what switch connected to every light bulb. He use next practice: he send some workers in the some rooms, then they turn on switches in same time, then they go to master and tell him, in what rooms light bulb was turned on. a) Prove that $2n$ moves is enough to find, how switches are connected to bulbs. b) Is $2n-1$ moves always enough ?

Let $ A$ be the subset of the set of positive integers, having the following $ 2$ properties: 1) If $ a$ belong to $ A$,than all of the divisors of $ a$ also belong to $ A$; 2) If $ a$ and $ b$, $ 1 < a < b$, belong to $ A$, than $ 1 \plus{} ab$ is also in $ A$; Prove that if $ A$ contains at least $ 3$ positive integers, than $ A$ contains all positive integers.

Find all the pairs of integers $ (a,b)$ satisfying $ ab(a \minus{} b)\not \equal{} 0$ such that there exists a subset $ Z_{0}$ of set of integers $ Z,$ for any integer $ n$, exactly one among three integers $ n,n \plus{} a,n \plus{} b$ belongs to $ Z_{0}$.

A game is played by two contestants A and B, each one having ten chips numbered from 1 to 10. The board of game consists of two numbered rows, from 1 to 1492 on the first row and from 1 to 1989 on the second. At the $n$-th turn, $n=1,2,\ldots,10$, A puts his chip numbered $n$ in any empty cell, and B puts his chip numbered $n$ in any empty cell on the row not containing the chip numbered $n$ from A. B wins the game if, after the 10th turn, both rows show the numbers of the chips in the same relative order. Otherwise, A wins. [list=a] [*] Which player has a winning strategy? [*] Suppose now both players has $k$ chips numbered 1 to $k$. Which player has a winning strategy? [*] Suppose further the rows are the set $\mathbb{Q}$ of rationals and the set $\mathbb{Z}$ of integers. Which player has a winning strategy? [/list]

[b]p1.[/b] Sherry starts with a three-digit positive integer. She subtracts $7$ from it, then multiplies the result by $7$, and then adds $7$ to that. If she ends up with $2023$, what number did she start with? [b]p2.[/b] Square $ABCD$ has side length $1$. Point $X$ lies on $\overline{AB}$ such that $\frac{AX}{XB} = 2$, and point $Y$ lies on $\overline{DX}$ such that $\frac{DY}{YX} = 3$. Compute the area of triangle $DAY$ . [b]p3.[/b] A fair six-sided die is labeled $1-6$ such that opposite faces sum to $7$. The die is rolled, but before you can look at the outcome, the die gets tipped over to an adjacent face. If the new face shows a $4$, what is the probability the original roll was a $1$? PS. You should use hide for answers.

Suppose $n$ coins are available that their mass is unknown. We have a pair of balances and every time we can choose an even number of coins and put half of them on one side of the balance and put another half on the other side, therefore a [i]comparison[/i] will be done. Our aim is determining that the mass of all coins is equal or not. Show that at least $n-1$ [i]comparisons[/i] are required.

A finite set of points $P$ in the plane has the following property: Every line through two points in $P$ contains at least one more point belonging to $P$. Prove that all points in $P$ lie on a straight line. [hide="Remark."]This may be a well known theorem called "Sylvester Gallai", but I didn't find this problem (I mean, exactly this one) using search function. So please discuss about the problem here, in this topic. Thanks :) [/hide]

Minivan and Megavan play a game. For a positive integer $n$, Minivan selects a sequence of integers $a_1,a_2,\ldots,a_n$. An operation on $a_1,a_2,\ldots,a_n$ means selecting an $a_i$ and increasing it by $1$. Minivan and Megavan take turns, with Minivan going first. On Minivan's turn, he performs at most $2025$ operations, and he may choose the same integer repeatedly. On Megavan's turn, he performs exactly $1$ operation instead. Megavan wins if at any point in the game, including in the middle of Minivan's operations, two numbers in the sequence are equal. [i](Proposed by Ho Janson)[/i]

Two players, Agon and Besa, choose a number from the set $\{1,2,3,4,5,6,7,8\}$, in turns, until no number is left. Then, each player sums all the numbers that he has chosen. We say that a player wins if the sum of his chosen numbers is a prime and the sum of the numbers that his opponent has chosen is composite. In the contrary, the game ends in a draw. Agon starts first. Does there exist a winning strategy for any of the players?

A positive integer $n < 2017$ is given. Exactly $n$ vertices of a regular 2017-gon are colored red, and the remaining vertices are colored blue. Prove that the number of isosceles triangles whose vertices are monochromatic does not depend on the chosen coloring (but does depend on $n$.)

(a) The numbers $1 , 2, 4, 8, 1 6 , 32, 64, 1 28$ are written on a blackboard. We are allowed to erase any two numbers and write their difference instead (this is always a non-negative number). After this procedure has been repeated seven times, only a single number will remain. Could this number be $97$? (b) The numbers $1 , 2, 22, 23 , . . . , 210$ are written on a blackboard. We are allowed to erase any two numbers and write their difference instead (this is always a non-negative number) . After this procedure has been repeated ten times, only a single number will remain. What values could this number have? (A.Shapovalov)

In a chess tournament, every participant played with each other exactly once, receiving $1$ point for a win, $1/2$ for a draw and $0$ for a loss. [list][b](a)[/b] Is it possible that for every player $P$, the sum of points of the players who were beaten by P is greater than the sum of points of the players who beat $P$? [b](b)[/b] Is it possible that for every player $P$, the first sum is less than the second one?[/list]

Find the numbers of ordered array $(x_1,...,x_{100})$ that satisfies the following conditions: ($i$)$x_1,...,x_{100}\in\{1,2,..,2017\}$; ($ii$)$2017|x_1+...+x_{100}$; ($iii$)$2017|x_1^2+...+x_{100}^2$.

Straight rod of 2 meter length is cut into $N$ sticks. The length of each piece is an integer number of centimeters. For which smallest $N$ can one guarantee that it is possible to form the contour of some rectangle, while using all sticks and not breaking them further? (Author: A. Magazinov)

A square is cut into $100$ rectangles by $9$ straight lines parallel to one of the sides and $9$ lines parallel to another. If exactly $9$ of the rectangles are actually squares, prove that at least two of these $9$ squares are of the same size . (V Proizvolov)

Several teams from Littletown and Bigtown took part on a tournament. There were nine more teams from Bigtown than those from Littletown. Any two teams played exactly one match, and the winner and loser got 1 and 0 points respectively (no ties). The teams from Bigtown in total gained nine times more points than those from Littletown. What is the maximum possible number of wins of the best team from Littletown?

Given a $m\times n$ grid rectangle with $m,n \ge 4$ and a closed path $P$ that is not self intersecting from inner points of the grid, let $A$ be the number of points on $P$ such that $P$ does not turn in them and let $B$ be the number of squares that $P$ goes through two non-adjacent sides of them furthermore let $C$ be the number of squares with no side in $P$. Prove that $$A=B-C+m+n-1.$$

In a country, there are ${}N{}$ cities and $N(N-1)$ one-way roads: one road from $X{}$ to $Y{}$ for each ordered pair of cities $X \neq Y$. Every road has a maintenance cost. For each $k = 1,\ldots, N$ let's consider all the ways to select $k{}$ cities and $N - k{}$ roads so that from each city it is possible to get to some selected city, using only selected roads. We call such a system of cities and roads with the lowest total maintenance cost $k{}$[i]-optimal[/i]. Prove that cities can be numbered from $1{}$ to $N{}$ so that for each $k = 1,\ldots, N$ there is a $k{}$-optimal system of roads with the selected cities numbered $1,\ldots, k$. [i]Proposed by V. Buslov[/i]

A grid measuring $10 \times 11$ is given. How many "crosses" covering five unit squares can be placed on the grid? (pictured right) so that no two of them cover the same square? [img]https://cdn.artofproblemsolving.com/attachments/a/7/8a5944233785d960f6670e34ca7c90080f0bd6.png[/img]

A whole number is written on each square of a $3\times 2021$ board. If the number written in each square is greater than or equal to at least two of the numbers written in the neighboring squares, how many different numbers written on the board can there be at most? Note: Two squares are neighbors when they have a common side.

Let $ABCDEFG$ be a regular heptagon. We'll call the sides $AB$, $BC$, $CD$, $DE$, $EF$, $FG$ and $GA$ opposite to the vertices $E$, $F$, $G$, $A$, $B$, $C$ and $D$ respectively. If $M$ is a point inside the heptagon, we'll say that the line through $M$ and a vertex of the heptagon intersects a side of it (without the vertices) at a $\textit{perfect}$ point, if this side is opposite the vertex. Prove that for every choice of $M$, the number of $\textit{perfect}$ points is always odd.

On the blackboard were six figures: a circle, a triangle, a square, a trapezoid, a pentagon and a hexagon, painted in six colors: blue, white, red, yellow, green and brown. Each figure had only one color and all the figures were of different colors. The next day he wondered what color each figure was. Paul replied: “The circle was red, the triangle was blue, the square was white, the trapezoid was green, the pentagon was brown, and the hexagon was yellow. Sofía answered: “The circle was yellow, the triangle was green, the square was red, the trapezoid was blue, the pentagon was brown, and the hexagon was white.” Pablo was wrong three times and Sofia twice, and it is known that the pentagon was brown. Determine if it is possible to know with certainty what the color of each of the figures was.

If the integers $1,2,\dots,n$ can be divided into two sets such that each of the two sets does not contain the arithmetic mean of its any two elements, what is the largest possible value of $n$? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ \text{None of the preceding} $