There are $n$ children in a room. Each child has at least one piece of candy. In Round $1$, Round $2$, etc., additional pieces of candy are distributed among the children according to the following rule: In Round $k$, each child whose number of pieces of candy is relatively prime to $k$ receives an additional piece. Show that after a sufficient number of rounds the children in the room have at most two different numbers of pieces of candy. [i](Proposed by Theresia Eisenkölbl)[/i]

(a) In this drawing, there are three squares on each side of the square. Place a natural number in each of the boxes so that the sum of the numbers of two adjacent boxes is always odd. [img]https://cdn.artofproblemsolving.com/attachments/e/6/75517b7d49857abd3f8f0430a70ae5b0eb1554.gif[/img] (b) In this drawing, there are now four squares on each side of the triangle. Justify why a natural number cannot be placed in each box so that the sum of the numbers in two adjacent boxes is always odd. [img] https://cdn.artofproblemsolving.com/attachments/c/8/061895b9c1cdcb132f7d37087873b7de3fb5f3.gif[/img] (c) If you now draw a polygon with$ 51$ sides and on each side you place $50$ boxes, taking care that there is a box at each vertex. Can you place a natural number in each box so that the sum of the numbers in two adjacent boxes is always odd? Why?

Fix positive integers $n,j,k$.How many integer sequences are there of the form $1\le a_1<a_2<\ldots<a_k\le n$,where $a_{i+1}-a_i\ge j$ for all $1\le i\le k-1$.

There is a circle which is 1 meter in circumference and a point marked on it. Two cockroaches start running in the same direction from the marked point with different speeds. Whenever the fast one would catch up with the slow one, the slow one would instantly turn around and start running in tho other direction with the same speed. Whenever they would meet face-to-face, the fast one would instantly turn around and start running in tho other direction with the same speed. How far from the marked point could their 100th meeting be?

An open half-plane is the set of all points lying to one side of a line, but excluding the points on the line itself. If four open half-planes cover the plane, show that one can select three of them which still cover the plane.

Let be given $ n \ge 2$ lines on a plane, not all concurrent and no two parallel. Prove that there is a point which belongs to exactly two of the given lines.

Ana, Beto, Carlos, Diana, Elena and Fabian are in a circle, located in that order. Ana, Beto, Carlos, Diana, Elena and Fabian each have a piece of paper, where are written the real numbers $a,b,c,d,e,f$ respectively. At the end of each minute, all the people simultaneously replace the number on their paper by the sum of three numbers; the number that was at the beginning of the minute on his paper and on the papers of his two neighbors. At the end of the minute $2022, 2022$ replacements have been made and each person have in his paper it´s initial number. Find all the posible values of $abc+def$. $\textbf{Note:}$ [i]If at the beginning of the minute $N$ Ana, Beto, Carlos have the numbers $x,y,z$, respectively, then at the end of the minute $N$, Beto is going to have the number $x+y+z$[/i].

Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$

Nair has puzzle pieces shaped like an equilateral triangle. She has pieces of two sizes: large and small. [img]https://cdn.artofproblemsolving.com/attachments/a/1/aedfbfb2cb17bf816aa7daeb0d35f46a79b6e9.jpg[/img] Nair build triangular figures by following these rules: $\bullet$ Figure $1$ is made up of $4$ small pieces, Figure $2$ is made up of $2$ large pieces and $8$ small, Figure $3$ by $6$ large and $12$ small, and so on. $\bullet$ The central column must be made up exclusively of small parts. $\bullet$ Outside the central column, only large pieces can be placed. [img]https://cdn.artofproblemsolving.com/attachments/5/7/e7f6340de0e04d5b5979e72edd3f453f2ac8a5.jpg[/img] Following the pattern, how many pieces will Nair use to build Figure $20$?

Elmo and Elmo's clone are playing a game. Initially, $n\geq 3$ points are given on a circle. On a player's turn, that player must draw a triangle using three unused points as vertices, without creating any crossing edges. The first player who cannot move loses. If Elmo's clone goes first and players alternate turns, who wins? (Your answer may be in terms of $n$.) [i]Proposed by Milan Haiman[/i]

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img] Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were on each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ + & & & d & e \\ \hline & f & a & g & c \\ x & b & b & h & \\ \hline f & f & e & g & c \\ \end{tabular}$ [b]p4.[/b] Is it possible to find a rectangle of perimeter $10$ m and cut it in rectangles (as many as you want) so that the sum of the perimeters is $500$ m? [b]p5.[/b] The picture shows a maze with chambers (shown as circles) and passageways (shown as segments). A cat located in chamber $C$ tries to catch a mouse that was originally in the chamber $M$. The cat makes the first move, moving from chamber $C$ to one of the neighboring chambers. Then the mouse moves, then the cat, and so forth. At each step, the cat and the mouse can move to any neighboring chamber or not move at all. The cat catches the mouse by moving into the chamber currently occupied by the mouse. Can the cat get the mouse? [img]https://cdn.artofproblemsolving.com/attachments/9/9/25f61e1499ff1cfeea591cb436d33eb2cdd682.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We call a permutation $ \left(a_1, a_2, ..., a_n\right)$ of $ \left(1, 2, ..., n\right)$ [i]quadratic[/i] if there exists at least a perfect square among the numbers $ a_1$, $ a_1 \plus{} a_2$, $ ...$, $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n$. Find all natural numbers $ n$ such that all permutations in $ S_n$ are quadratic. [i]Remark.[/i] $ S_{n}$ denotes the $ n$-th symmetric group, the group of permutations on $ n$ elements.

Find the largest natural number $ n$ for which there exist different sets $ S_1,S_2,\ldots,S_n$ such that: $ 1^\circ$ $ |S_i\cup S_j|\leq 2004$ for each two $ 1\leq i,j\le n$ and $ 2^\circ$ $ S_i\cup S_j\cup S_k\equal{}\{1,2,\ldots,2008\}$ for each three integers $ 1\le i<j<k\le n$.

A chess piece is placed on one of the squares of an $8\times 8$ chessboard where it begins a tour of the board: it moves from square to square, only moving horizontally or vertically. It visits every square precisely once, and ends up exactly where it started. What is the maximum number of times the piece can change direction along its tour?

Four unit squares form a $2 \times 2$ grid. Each of the $12$ unit line segments forming the sides of the squares is colored either red or blue in such way that each square has $2$ red sides and blue sides. One example is shown below (red is solid, blue is dashed). Find the number of such colorings. [asy] size(4cm); defaultpen(linewidth(1.2)); draw((0, 0) -- (2, 0) -- (2, 1)); draw((0, 1) -- (1, 1) -- (1, 2) -- (2,2)); draw((0, 0) -- (0, 1), dotted); draw((1, 0) -- (1, 1) -- (2, 1) -- (2, 2), dotted); draw((0, 1) -- (0, 2) -- (1, 2), dotted); [/asy]

There is a positive integer $A$. Two operations are allowed: increasing this number by $9$ and deleting a digit equal to $1$ from any position. Is it always possible to obtain $A+1$ by applying these operations several times?

There are arbitrary 7 points in the plane. Circles are drawn through every 4 possible concyclic points. Find the maximum number of circles that can be drawn.

There are $n$ boys and $n$ girls sitting around a circular table, where $n>3$. In every move, we are allowed to swap the places of $2$ adjacent children. The [b]entropy[/b] of a configuration is the minimal number of moves such that at the end of them each child has at least one neighbor of the same gender. Find the maximal possible entropy over the set of all configurations. [i]Authored by Viktor Simjanoski[/i]

You and your friend play a game on a $ 7 \times 7$ grid of buckets. Your friend chooses $5$ “lucky” buckets by marking an “$X$” on the bottom that you cannot see. However, he tells you that they either form a vertical, or horizontal line of length $5$. To clarify, he will select either of the following sets of buckets: either $\{(a, b),(a, b + 1),(a, b + 2),(a, b + 3),(a, b + 4)\}$, or $\{(b, a),(b + 1, a),(b + 2, a),(b + 3, a),(b + 4, a)\}$, with $1\le a \le 7$, and $1 \le b \le 3$. Your friend lets you pick up at most $n$ buckets, and you win if one of the buckets you picked was a “lucky” bucket. What is the minimum possible value of $n$ such that, if you pick your buckets optimally, you can guarantee that at least one is “lucky”?

In how many ways can four married couples sit in a merry-go-round with identical seats such that men and women occupy alternate seats and no husband seats next to his wife?

Given a board with size $25\times 25$. Some $1\times 1$ squares are marked, so that for each $13\times 13$ and $4\times 4$ sub-boards, there are atleast $\frac{1}{2}$ marked parts of the sub-board. Find the least possible amount of marked squares in the entire board.

An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.

The convex quadrilaterals $ABCD$ and $PQRS$ are made respectively from paper and cardboard. We say that they suit each other if the following two conditions are met : ( 1 ) It is possible to put the cardboard quadrilateral on the paper one so that the vertices of the first lie on the sides of the second, one vertex per side, and (2) If, after this, we can fold the four non-covered triangles of the paper quadrilateral on to the cardboard one, covering it exactly. ( a) Prove that if the quadrilaterals suit each other, then the paper one has either a pair of opposite sides parallel or (a pair of) perpendicular diagonals. (b) Prove that if $ABCD$ is a parallelogram, then one can always make a cardboard quadrilateral to suit it. (N. Vasiliev)

Is it true that in any convex $n$-gon with $n > 3$, there exists a vertex and a diagonal passing through this vertex such that the angles of this diagonal with both sides adjacent to this vertex are acute? [i]Proposed by Boris Frenkin - Russia[/i]