Natural numbers are placed in an infinite grid. Such that the number in each cell is equal to the number of its adjacent cells having the same number. Find the most distinct numbers this infinite grid can have. (Two cells of the grid are adjacent if they have a common vertex)

We have a $4 \times 4$ squared board. We define the [i]separation [/i] between two squares as the least number of moves that a chess knight must take to go from one square to the other (using moves of the knight). Three boxes $A, B, C$ form a good trio if the three separations between $A$ and $B$, between $A$ and $C$ and between $B$ and $C$ are equal. Determines the number of good trios that are formed on the board. Clarification: In each move the knight moves $2$ squares in the horizontal direction plus one square in the vertical direction or moves $2$ squares in the vertical direction plus one square in the horizontal direction.

The number $2022$ is written on the white board. Ivan and Peter play a game, Ivan starts and they alternate. On a move, Ivan erases the number $b$, written on the board, throws a dice which shows some number $a$, and writes the residue of $(a+b) ^2$ modulo $5$. Similarly, Peter throws a dice which shows some number $a$, and changes the previously written number $b$ to the residue of $a+b$ modulo $3$. The first player to write a $0$ wins. What is the probability of Ivan winning the game?

$27$ students are given a number from $1$ to $27.$ How many ways are there to divide $27$ students into $9$ groups of $3$ with the following condition? (i) The sum of students number in each group is $1\pmod{3}$ (ii) There are no such two students where their numbering differs by $3.$

In a classroom there are $m$ students. During the month of July each of them visited the library at least once but none of them visited the library twice in the same day. It turned out that during the month of July each student visited the library a different number of times, furthermore for any two students $A$ and $B$ there was a day in which $A$ visited the library and $B$ did not and there was also a day when $B$ visited the library and $A$ did not do so. Determine the largest possible value of $m$.

There are 100 positive integers written on a board. At each step, Alex composes 50 fractions using each number written on the board exactly once, brings these fractions to their irreducible form, and then replaces the 100 numbers on the board with the new numerators and denominators to create 100 new numbers. Find the smallest positive integer $n{}$ such that regardless of the values of the initial 100 numbers, after $n{}$ steps Alex can arrange to have on the board only pairwise coprime numbers.

Let $\mathcal{S}$ be a regular 18-gon, and for two vertices in $\mathcal{S}$ define the $\textit{distance}$ between them to be the length of the shortest path along the edges of $\mathcal{S}$ between them (e.g. adjacent vertices have distance 1). Find the number of ways to choose three distinct vertices from $\mathcal{S}$ such that no two of them have distance 1, 8, or 9.

In a group of $2n$ students, each student has exactly $3$ friends within the group. The friendships are mutual and for each two students $A$ and $B$ which are not friends, there is a sequence $C_1, C_2, ..., C_r$ of students such that $A$ is a friend of $C_1$, $C_1$ is a friend of $C_2$, et cetera, and $C_r$ is a friend of $B$. Every student was asked to assess each of his three friendships with: "acquaintance", "friend" and "BFF". It turned out that each student either gave the same assessment to all of his friends or gave every assessment exactly once. We say that a pair of students is in conflict if they gave each other different assessments. Let $D$ be the set of all possible values of the total number of conflicts. Prove that $|D| \geq 3n$ with equality if and only if the group can be partitioned into two subsets such that each student is separated from all of his friends.

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8 \times 8$ chessboard there is a rook (castle). The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second layer is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] Find the smallest positive whole number that ends with $17$, is divisible by $17$, and the sum of its digits is $17$. [b]p3.[/b] Three consecutive $2$-digit numbers are written next to each other. It turns out that the resulting $6$-digit number is divisible by $17$. Find all such numbers. [b]p4.[/b] Let $ABCD$ be a convex quadrilateral (a quadrilateral $ABCD$ is called convex if the diagonals $AC$ and $BD$ intersect). Suppose that $\angle CBD = \angle CAB$ and $\angle ACD = \angle BDA$ . Prove that $\angle ABC = \angle ADC$. [b]p5.[/b] A circle of radius $1$ is cut into four equal arcs, which are then arranged to make the shape shown on the picture. What is its area? [img]https://cdn.artofproblemsolving.com/attachments/f/3/49c3fe8b218ab0a5378ecc635b797a912723f9.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ H(n)$ be the number of simply connected subsets with $ n$ hexagons in an infinite hexagonal network. Also let $ P(n)$ be the number of paths starting from a fixed vertex (that do not connect itself) with lentgh $ n$ in this hexagonal network. a) Prove that the limits \[ \alpha: \equal{}\lim_{n\rightarrow\infty}H(n)^{\frac1n}, \beta: \equal{}\lim_{n\rightarrow\infty}P(n)^{\frac1n}\]exist. b) Prove the following inequalities: $ \sqrt2\leq\beta\leq2$ $ \alpha\leq 12.5$ $ \alpha\geq3.5$ $ \alpha\leq\beta^4$

Let $n,k$ be given natural numbers. Find the smallest possible cardinality of a set $A$ with the following property: There exist subsets $A_1,A_2,\ldots,A_n$ of $A$ such that the union of any $k$ of them is $A$, but the union of any $k-1$ of them is never $A$.

A football league has $n$ teams. Each team plays one game with every other team. Each win is awarded $2$ points, each tie $1$ point, and each loss $0$ points. After the league is over, the following statement is true: for every subset $S$ of teams in the league, there is a team (which may or may not be in $S$) such that the total points the team obtained by playing all the teams in $S$ is odd. Prove that $n$ is even.

The vertices of a $50\text{-gon}$ divide a circumference into $50$ arcs, whose lengths are $1,2,\ldots 50$ in some order. It is known that any two opposite arcs (corresponding to opposite sides) differ by $25$. Prove that the polygon has two parallel sides.

A graph $G$ has $n + k$ vertices. Let $A$ be a subset of $n$ vertices of the graph $G$, and $B$ be a subset of other $k$ vertices. Each vertex of $A$ is joined to at least $k - p$ vertices of $B$. Prove that if $np < k$ then there is a vertex in $B$ that can be joined to all vertices of $A$.

Find all integers $n \ge 3$ with the following property: it is possible to assign pairwise different positive integers to the vertices of an $n$-gonal prism in such a way that vertices with labels $a$ and $b$ are connected by an edge if and only if $a | b$ or $b | a$. Poland

p1. A set of cards contains $100$ cards, each of which is written with a number from $1$ up to $100$. On each of the two sides of the card the same number is written, side one is red and the other is green. First of all Leny arranges all the cards with red writing face up. Then Leny did the following three steps: I. Turn over all cards whose numbers are divisible by $2$ II. Turn over all the cards whose numbers are divisible by $3$ III. Turning over all the cards whose numbers are divisible by $5$, but didn't turn over all cards whose numbers are divisible by $5$ and $2$. Find the number of Leny cards now numbered in red and face up, p2. Find the area of ​​three intersecting semicircles as shown in the following image. [img]https://cdn.artofproblemsolving.com/attachments/f/b/470c4d2b84435843975a0664fad5fee4a088d5.png[/img] p3. It is known that $x+\frac{1}{x}=7$ . Determine the value of $A$ so that $\frac{Ax}{x^4+x^2+1}=\frac56$. p4. There are $13$ different gifts that will all be distributed to Ami, Ima, Mai,and Mia. If Ami gets at least $4$ gifts, Ima and Mai respectively got at least $3$ gifts, and Mia got at least $2$ gifts, how many possible gift arrangements are there? p5. A natural number is called a [i]quaprimal [/i] number if it satisfies all four following conditions: i. Does not contain zeros. ii. The digits compiling the number are different. iii. The first number and the last number are prime numbers or squares of an integer. iv. Each pair of consecutive numbers forms a prime number or square of an integer. For example, we check the number $971643$. (i) $971643$ does not contain zeros. (ii) The digits who compile $971643$ are different. (iii) One first number and one last number of $971643$, namely $9$ and $3$ is a prime number or a square of an integer. (iv) Each pair of consecutive numbers, namely $97, 71, 16, 64$, and $43$ form prime number or square of an integer. So $971643$ is a quadratic number. Find the largest $6$-digit quaprimal number. Find the smallest $6$-digit quaprimal number. Which digit is never contained in any arbitrary quaprimal number? Explain.

[b]p1.[/b] How many primes $p < 100$ satisfy $p = a^2 + b^2$ for some positive integers $a$ and $b$? [b]p2. [/b] For $a < b < c$, there exists exactly one Pythagorean triple such that $a + b + c = 2000$. Find $a + c - b$. [b]p3.[/b] Five points lie on the surface of a sphere of radius $ 1$ such that the distance between any two points is at least $\sqrt2$. Find the maximum volume enclosed by these five points. [b]p4.[/b] $ABCDEF$ is a convex hexagon with $AB = BC = CD = DE = EF = FA = 5$ and $AC = CE = EA = 6$. Find the area of $ABCDEF$. [b]p5.[/b] Joe and Wanda are playing a game of chance. Each player rolls a fair $11$-sided die, whose sides are labeled with numbers $1, 2, ... , 11$. Let the result of the Joe’s roll be $X$, and the result of Wanda’s roll be $Y$ . Joe wins if $XY$ has remainder $ 1$ when divided by $11$, and Wanda wins otherwise. What is the probability that Joe wins? [b]p6.[/b] Vivek picks a number and then plays a game. At each step of the game, he takes the current number and replaces it with a new number according to the following rule: if the current number $n$ is divisible by $3$, he replaces $n$ with $\frac{n}{3} + 2$, and otherwise he replaces $n$ with $\lfloor 3 \log_3 n \rfloor$. If he starts with the number $3^{2011}$, what number will he have after $2011$ steps? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Define a sequence an of positive real numbers with a$_1 = 1$, and $$a_{n+1} =\frac{4a^2_n - 1}{-2 + \frac{4a^2_n -1}{-2+ \frac{4a^2_n -1}{-2+...}}}.$$ What is $a_{2011}$? [b]p8.[/b] A set $S$ of positive integers is called good if for any $x, y \in S$ either $x = y$ or $|x - y| \ge 3$. How many subsets of $\{1, 2, 3, ..., 13\}$ are good? Include the empty set in your count. [b]p9.[/b] Find all pairs of positive integers $(a, b)$ with $a \le b$ such that $10 \cdot lcm \, (a, b) = a^2 + b^2$. Note that $lcm \,(m, n)$ denotes the least common multiple of $m$ and $n$. [b]p10.[/b] For a natural number $n$, $g(n)$ denotes the largest odd divisor of $n$. Find $$g(1) + g(2) + g(3) + ... + g(2^{2011})$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each of the $8$ vertices of a given cube is given a value $1$ or $-1$. Each of the $6$ faces is given the value of product of its four vertices. Let $A$ be the sum of all the $14$ values. Which are the possible values of $A$?

Let $G$ be an arbitrarily chosen finite simple graph. We write non-negative integers on the vertices of the graph such that for each vertex $v$ in $G,$ the number written on $v$ is equal to the number of vertices adjacent to $v$ where an even number is written. Prove that the number of ways to achieve this is a power of $2$.

A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time: [list] [*] Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged. [/list] Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user. [i]Proposed by Adrian Beker, Croatia[/i]

Determine all integer $n \ge 2$ such that it is possible to construct an $n * n$ array where each entry is either $-1, 0, 1$ so that the sums of elements in every row and every column are distinct

We have $1000$ balls in $40$ different colours, $25$ balls of each colour. Determine the smallest $n$ for which the following holds: if you place the $1000$ balls in a circle, in any arbitrary way, then there are always $n$ adjacent balls which have at least $20$ different colours.

We are given a map divided into $13\times 13$ fields. It is also known that at one of the fields a tank of the enemy is stationed, which we must destroy. To achieve this we need to hit it twice with shots aimed at the centre of some field. When the tank gets hit it gets moved to a neighbouring field out of precaution. At least how many shots must we fire, so that the tank gets destroyed certainly? [i]We can neither see the tank, nor get any other feedback regarding its position.[/i]

Let $a_1,a_2,\cdots,a_n$ be integers such that $1=a_1\le a_2\le \cdots\le a_{2019}=99$. Find the minimum $f_0$ of the expression $$f=(a_1^2+a_2^2+\cdots+a_{2019}^2)-(a_1a_3+a_2a_4+\cdots+a_{2017}a_{2019}),$$ and determine the number of sequences $(a_1,a_2,\cdots,a_n)$ such that $f=f_0$.

At the beginning of a two-player game, the number $2004!$ is written on the blackboard. The players move alternately. In each move, a positive integer smaller than the number on the blackboard and divisible by at most $20$ different prime numbers is chosen. This is subtracted from the number on the blackboard, which is erased and replaced by the difference. The winner is the player who obtains $0$. Does the player who goes first or the one who goes second have a guaranteed win, and how should that be achieved?