a) Prove the existence of two infinite sets $A$ and $B$, not necessarily disjoint, of non-negative integers such that each non-negative integer $n$ is uniquely representable in the form $n=a+b$ with $a\in A,b\in B$. b) Prove that for each such pair $(A,B)$, either $A$ or $B$ contains only multiples of some integer $k>1$.

In a basketball tournament every two teams play two matches. As usual, the winner of a match gets $2$ points, the loser gets $0$, and there are no draws. A single team wins the tournament with $26$ points and exactly two teams share the last position with $20$ points. How many teams participated in the tournament?

$100$ heaps of stones lie on a table. Two players make moves in turn. At each move, a player can remove any non-zero number of stones from the table, so that at least one heap is left untouched. The player that cannot move loses. Determine, for each initial position, which of the players, the first or the second, has a winning strategy. [i]K. Kokhas[/i] [b]EDIT.[/b] It is indeed confirmed by the sender that empty heaps are still heaps, so the third post contains the right guess of an interpretation.

For any positive integer $m$,show that there exist integers $a,b$ satisfying $\left | a \right |\leq m$, $ \left | b \right |\leq m$, $0< a+b\sqrt{2}\leq \frac{1+\sqrt{2}}{m+2}$

Graph $G$ becomes planar when any vertex is removed. Prove that its vertices can be properly colored with 5 colors. (Using the four-color theorem without proof is not allowed!) [i]Proposed by D. Karpov[/i]

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

In a badminton tournament, each of $n$ players play all the other $n-1$ players. Each game results in either a win, or a loss. The players then write down the names of those whom they defeated, and also of those who they defeated. For example, if $A$ beats $B$ and $B$ beats $C,$ then $A$ writes the names of both $B$ and $C$. Show that there will be one person, who has written down the names of all the other $n-1$ players. [hide="Clarification"] Consider a game between $A,B,C,D,E,F,G$ where $A$ defeats $B$ and $C$ and $B$ defeats $E,F$, $C$ defeats $E.$ Then $A$'s list will have $(B,C,E,F)$, and will not include $G.$ [/hide]

a) One has a set of stones with weights $1, 2, \ldots, 20$ grams. Find all $k$ for which it is possible to place $k$ and the rest $20-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. b) One has a set of stones with weights $1, 2, \ldots, 51$ grams. Find all $k$ for which it is possible to place $k$ and the rest $51-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. c) One has a set of stones with weights $1, 2, \ldots, n$ grams ($n\in\mathbb{N}$). Find all $n$ and $k$ for which it is possible to place $k$ and the rest $n-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. [size=75] a) and b) were proposed at the festival, c) is a generalization[/size]

A magic square is a square with side 3 consisting of 9 unit squares, such that the numbers written in the unit squares (one number in each square) satisfy the following property: the sum of the numbers in each row is equal to the sum of the numbers in each column and is equal to the sum of all the numbers written in any of the two diagonals. A rectangle with sides $m\ge3$ and $n\ge3$ consists of $mn$ unit squares. If in each of those unit squares exactly one number is written, such that any square with side $3$ is a magic square, then find the number of most different numbers that can be written in that rectangle.

Two toads named Gamakichi and Gamatatsu are sitting at the points $(0,0)$ and $(2,0)$ respectively. Their goal is to reach $(5,5)$ and $(7,5)$ respectively by making one unit jumps in positive $x$ or $y$ direction at a time. How many ways can they do this while ensuring that there is no point on the plane where both Gamakichi And Gamatatsu land on?

Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. [i]Note:[/i] As an example, if $S=\{1,2,4\}$, there are exactly five such ordered pairs: $(1,1)$, $(1,4)$, $(2,2)$, $(4,1)$, and $(4,4)$. [i]Proposed by Sutanay Bhattacharya[/i]

We call a $5$-tuple of integers [i]arrangeable[/i] if its elements can be labeled $a, b, c, d, e$ in some order so that $a-b+c-d+e=29$. Determine all $2017$-tuples of integers $n_1, n_2, . . . , n_{2017}$ such that if we place them in a circle in clockwise order, then any $5$-tuple of numbers in consecutive positions on the circle is arrangeable. [i]Warut Suksompong, Thailand[/i]

A set contains $ 372$ integers from $ 1,2,...,1200$ . For every element $ a\in S$, the numbers $ a\plus{}4,a\plus{}5,a\plus{}9$ don't belong to $ S$. Prove that $ 600\in S$.

Let $n_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

Some $k{}$ vertices of a regular $n{}$-gon are colored red. We will call a coloring [i]uniform[/i] if for any $m$ the number of red vertices in any two sets of $m$ consecutive vertices of the $n{}$-gon coincide or differ by 1. Prove that a uniform coloring exists for any $k<n$ and is unique, up to rotations of the $n{}$-gon. [i]Proposed by M. Kontsevich[/i]

A regular polygon with $1000$ sides has the vertices colored in red, yellow or blue. A move consists in choosing to adjiacent vertices colored differently and coloring them in the third color. Prove that there is a sequence of moves after which all the vertices of the polygon will have the same color. Marius Ghergu

We want to draw a number of straight lines such that for each square of a chessboard, at least one of the lines passes through an interior point of the square. What is the smallest number of lines needed for a (a) $3\times 3$; (b) $4\times 4$ chessboard? Use a picture to show that this many lines are enough, and prove that no smaller number would do. (M Vyalyi)

Let $a,b$ be integers with $0<a<b$. A set $\{x,y,z\}$ of non-negative integers is [i]olympic[/i] if $x<y<z$ and if $\{z-y,y-x\}=\{a,b\}$. Show that the set of all non-negative integers is the union of pairwise disjoint olympic sets.

Fifty teams participate in a round robin competition over 50 days. Moreover, all the teams (at least two) that show up in any day must play against each other. Prove that on every pair of consecutive days, there is a team that has to play on those two days.

William is thinking of an integer between 1 and 50, inclusive. Victor can choose a positive integer $m$ and ask William: "does $m$ divide your number?", to which William must answer truthfully. Victor continues asking these questions until he determines William's number. What is the minimum number of questions that Victor needs to guarantee this?

There is an integer in each cell of a $2m\times 2n$ table. We define the following operation: choose three cells forming an L-tromino (namely, a cell $C$ and two other cells sharing a side with $C$, one being horizontal and the other being vertical) and sum $1$ to each integer in the three chosen cells. Find a necessary and sufficient condition, in terms of $m$, $n$ and the initial numbers on the table, for which there exists a sequence of operations that makes all the numbers on the table equal.

[b]p1.[/b] Each point in the interior and on the boundary of a square of side $2$ inches is colored either red or blue. Prove that there exists at least one pair of points of the same color whose distance apart is not less than $-\sqrt5$ inches. [b]p2.[/b] $ABC$ is an equilateral triangle of altitude $h$. A circle with center $0$ and radius $h$ is tangent to side $AB$ at $Z$ and intersects side $AC$ in point $X$ and side $BC$ in point $Y$. Prove that the circular arc $XZY$ has measure $60^o$. [img]https://cdn.artofproblemsolving.com/attachments/b/e/ac70942f7a14cd0759ac682c3af3551687dd69.png[/img] [b]p3.[/b] Find all of the real and complex solutions (if any exist) of the equation $x^7 + 7^7 = (x + 7)^7$ [b]p4.[/b] The four points $A, B, C$, and $D$ are not in the same plane. Given that the three angles, angle $ABC$, angle $BCD$, and angle $CDA$, are all right angles, prove that the fourth angle, angle $DAB$, of this skew quadrilateral is acute. [b]p5.[/b] $A, B, C$ and $D$ are four positive whole numbers with the following properties: (i) each is less than the sum of the other three, and (ii) each is a factor of the sum of the other three. Prove that at least two of the numbers must be equal. (An example of four such numbers: $A = 4$, $B = 4$, $C = 2$, $D = 2$.) [b]p6.[/b] $S$ is a set of six points and $L$ is a set of straight line segments connecting certain pairs of points in $S$ so that each point of $S$ is connected with at least four of the other points. Let $A$ and $B$ denote two arbitrary points of $S$. Show that among the triangles having sides in $L$ and vertices in $S$ there are two with the properties: (i) The two triangles have no common vertex. (ii) $A$ is a vertex of one of the triangles, and $B$ is a vertex of the other. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let us call a 1×3 rectangle a tromino. Alice and Bob go to different rooms, and each divides a 20 × 21 board into trominos. Then they compare the results, compute how many trominos are the same in both splittings, and Alice pays Bob that number of dollars. What is the maximal amount Bob may guarantee to himself no matter how Alice plays?

A unit square is given. Evan places a series of squares inside this unit square according to the following rules: $\bullet$ The $n$th square he places has side length $\frac{1}{n+1}.$ $\bullet$ At any point, no two placed squares can overlap. Can he place squares indefinitely? [i]Proposed by Evan Chang (squareman), USA[/i]