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]

Pupils of a school are divided into $112$ groups, of $11$ members each. Any two groups have exactly one common pupil. Prove that: a) there is a pupil that belongs to at least $12$ groups. b) there is a pupil that belongs to all the groups.

Given any four distinct points in the plane, show that the ratio of the largest to the smallest distance between two of them is at least $\sqrt2$.

Alina and Bogdan play the following game. They have a heap and $330$ stones in it. They take turns. In one turn it is allowed to take from the heap exactly $1$, exactly $n$ or exactly $m$ stones. The player who takes the last stone wins. Before the beginning Alina says the number $n$, ($1 < n < 10$). After that Bogdan says the number $m$, ($m \ne n, 1 < m < 10$). Alina goes first. Which of the two players has a winning strategy? What if initially there are 2018 stones in the heap? adapted from a Belarus Olympiad problem

We say the set $ \{1,2,\ldots,3k\}$ has property $ D$ if it can be partitioned into disjoint triples so that in each of them a number equals the sum of the other two. (a) Prove that $ \{1,2,\ldots,3324\}$ has property $ D$. (b) Prove that $ \{1,2,\ldots,3309\}$ hasn't property $ D$.

Initially, on the board, all integers from $1$ to $400$ are written. Two players play a game alternating their moves. In one move it is allowed to erase from the board any 3 integers, which form a triangle. The player, who can not perform a move loses. Who has a winning strategy?

On a cellular plane with a cell side equal to $1$, arbitrarily $100 \times 100$ napkin is thrown. It covers some nodes (the node lying on the border of a napkin, is also considered covered). What is the smallest number of lines (going not necessarily along grid lines) you can certainly cover all these nodes?

[b]p1.[/b] A very large lucky number $N$ consists of eighty-eight $8$s in a row. Find the remainder when this number $N$ is divided by $6$. [b]p2.[/b] If $3$ chickens can lay $9$ eggs in $4$ days, how many chickens does it take to lay $180$ eggs in $ 8$ days? [b]p3.[/b] Find the ordered pair $(x, y)$ of real numbers satisfying the conditions $x > y$, $x+y = 10$, and $xy = -119$. [b]p4.[/b] There is pair of similar triangles. One triangle has side lengths $4, 6$, and $9$. The other triangle has side lengths $ 8$, $12$ and $x$. Find the sum of two possible values of $x$. [b]p5.[/b] If $x^2 +\frac{1}{x^2} = 3$, there are two possible values of $x +\frac{1}{x}$. What is the smaller of the two values? [b]p6.[/b] Three flavors (chocolate strawberry, vanilla) of ice cream are sold at Brian’s ice cream shop. Brian’s friend Zerg gets a coupon for $10$ free scoops of ice cream. If the coupon requires Zerg to choose an even number of scoops of each flavor of ice cream, how many ways can he choose his ice cream scoops? (For example, he could have $6$ scoops of vanilla and $4$ scoops of chocolate. The order in which Zerg eats the scoops does not matter.) [b]p7.[/b] David decides he wants to join the West African Drumming Ensemble, and thus he goes to the store and buys three large cylindrical drums. In order to ensure none of the drums drop on the way home, he ties a rope around all of the drums at their mid sections so that each drum is next to the other two. Suppose that each drum has a diameter of $3.5$ feet. David needs $m$ feet of rope. Given that $m = a\pi + b$, where $a$ and $b$ are rational numbers, find sum $a + b$. [b]p8.[/b] Segment $AB$ is the diameter of a semicircle of radius $24$. A beam of light is shot from a point $12\sqrt3$ from the center of the semicircle, and perpendicular to $AB$. How many times does it reflect off the semicircle before hitting $AB$ again? [b]p9.[/b] A cube is inscribed in a sphere of radius $ 8$. A smaller sphere is inscribed in the same sphere such that it is externally tangent to one face of the cube and internally tangent to the larger sphere. The maximum value of the ratio of the volume of the smaller sphere to the volume of the larger sphere can be written in the form $\frac{a-\sqrt{b}}{36}$ , where $a$ and $b$ are positive integers. Find the product $ab$. [b]p10.[/b] How many ordered pairs $(x, y)$ of integers are there such that $2xy + x + y = 52$? [b]p11.[/b] Three musketeers looted a caravan and walked off with a chest full of coins. During the night, the first musketeer divided the coins into three equal piles, with one coin left over. He threw it into the ocean and took one of the piles for himself, then went back to sleep. The second musketeer woke up an hour later. He divided the remaining coins into three equal piles, and threw out the one coin that was left over. He took one of the piles and went back to sleep. The third musketeer woke up and divided the remaining coins into three equal piles, threw out the extra coin, and took one pile for himself. The next morning, the three musketeers gathered around to divide the coins into three equal piles. Strangely enough, they had one coin left over this time as well. What is the minimum number of coins that were originally in the chest? [b]p12.[/b] The diagram shows a rectangle that has been divided into ten squares of different sizes. The smallest square is $2 \times 2$ (marked with *). What is the area of the rectangle (which looks rather like a square itself)? [img]https://cdn.artofproblemsolving.com/attachments/4/a/7b8ebc1a9e3808096539154f0107f3e23d168b.png[/img] [b]p13.[/b] Let $A = (3, 2)$, $B = (0, 1)$, and $P$ be on the line $x + y = 0$. What is the minimum possible value of $AP + BP$? [b]p14.[/b] Mr. Mustafa the number man got a $6 \times x$ rectangular chess board for his birthday. Because he was bored, he wrote the numbers $1$ to $6x$ starting in the upper left corner and moving across row by row (so the number $x + 1$ is in the $2$nd row, $1$st column). Then, he wrote the same numbers starting in the upper left corner and moving down each column (so the number $7$ appears in the $1$st row, $2$nd column). He then added up the two numbers in each of the cells and found that some of the sums were repeated. Given that $x$ is less than or equal to $100$, how many possibilities are there for $x$? [b]p15.[/b] Six congruent equilateral triangles are arranged in the plane so that every triangle shares at least one whole edge with some other triangle. Find the number of distinct arrangements. (Two arrangements are considered the same if one can be rotated and/or reflected onto another.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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.

Let $P$ be the set of all subsets of ${1, 2, ... , n}$. Show that there are $1^n + 2^n + ... + m^n$ functions $f : P \longmapsto {1, 2, ... , m}$ such that $f(A \cap B) = min( f(A), f(B))$ for all $A, B.$

A set of $n$ dominoes, each colored with one white square and one black square, is used to cover a $2 \times n$ board of squares. For $n = 6$, how many different patterns of colors can the board have? (For $n = 2$, this number is $6$.)

Let $n$ be a positive integer. Determine the number of sequences $a_0, a_1, \ldots, a_n$ with terms in the set $\{0,1,2,3\}$ such that $$n=a_0+2a_1+2^2a_2+\ldots+2^na_n.$$

In a school, \( n \) different languages are taught. It is known that for any subset of these languages (including the empty set), there is exactly one student who knows these and only these languages (there are \( 2^n \) students in total). Each day, the students are divided into pairs and teach each other the languages that only one of them knows. If students are not allowed to be in the same pair twice, what is the minimum number of days the school administration needs to guarantee that all their students know all \( n \) languages? [i]Proposed by Oleksii Masalitin[/i]

Of the vertices of a cube, $7$ of them have assigned the value $0$, and the eighth the value $1$. A [i]move[/i] is selecting an edge and increasing the numbers at its ends by an integer value $k > 0$. Prove that after any finite number of [i]moves[/i], the g.c.d. of the $8$ numbers at vertices is equal to $1$. Russian M.O.

A permutation $\pi : \{1,2,\ldots,N\} \rightarrow \{1,2, \ldots,N\}$ is [i]very odd[/i] if the smallest positive integer $k$ such that $\pi^k(a) = a$ for all $1 \le a \le N$ is odd, where $\pi^k$ denotes $\pi$ composed with itself $k$ times. Let $X_0 = 1,$ and for $i \ge 1,$ let $X_i$ be the fraction of all permutations of $\{1,2,\ldots,i\}$ that are very odd. Let $S$ denote the set of all ordered $4$-tuples $(A,B,C,D)$ of nonnegative integers such that $A+B +C +D =2023.$ Find the last three digits of the integer $$2023\sum_{(A,B,C,D) \in S} X_AX_BX_CX_D.$$

Let $A$ and $B$ be sets of positive integers with $|A|\ge 2$ and $|B|\ge 2$. Let $S$ be a set consisting of $|A|+|B|-1$ numbers of the form $ab$ where $a\in A$ and $b\in B$. Prove that there exist pairwise distinct $x,y,z\in S$ such that $x$ is a divisor of $yz$.

On a table, there is an empty bag and a chessboard containing exactly one token on each square. Next to the table is a large pile that contains an unlimited supply of tokens. Using only the following types of moves what is the maximum possible number of tokens that can be in the bag? $\bullet$ Type 1: Choose a non-empty square on the chessboard that is not in the rightmost column. Take a token from this square and place it, along with one token from the pile, on the square immediately to its right. $\bullet$ Type 2: Choose a non-empty square on the chessboard that is not in the bottommost row. Take a token from this square and place it, along with one token from the pile, on the square immediately below it. $\bullet$ Type 3: Choose two adjacent non-empty squares. Remove a token from each and put them both into the bag.

On a one-way street, an unending sequence of cars of width $a$, length $b$ passes with velocity $v$. The cars are separated by the distance $c$. A pedestrian crosses the street perpendicularly with velocity $w$, without paying attention to the cars. [b](a)[/b] What is the probability that the pedestrian crosses the street uninjured? [b](b)[/b] Can he improve this probability by crossing the road in a direction other than perpendicular?

Is it possible to tile $2003 \times 2003$ board by $1 \times 2$ dominoes placed horizontally and $1 \times 3$ rectangles placed vertically?

There are $13$ cities in a certain kingdom. Between some pairs of the cities a two-way direct bus, train or plane connections are established. What is the least possible number of connections to be established so that choosing any two means of transportation one can go from any city to any other without using the third kind of vehicle?

A large cube of size \(4 \times 4 \times 4\) is made up of 64 small unit cubes. Exactly 16 of these small cubes must be colored red, subject to the following condition: In each block of \(1 \times 1 \times 4\), \(1 \times 4 \times 1\), and \(4 \times 1 \times 1\) cubes, there must be exactly one red cube. Determine how many different ways it is possible to choose the 16 small cubes to be colored red. Note: Two colorings are considered different even if one can be obtained from the other by rotations or symmetries of the cube.

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.$$

Let $R$ be a set of exactly $6$ elements. A set $F$ of subsets of $R$ is called an $S$-family over $R$ if and only if it satisfies the following three conditions: (i) For no two sets $X, Y$ in $F$ is $X \subseteq Y$ ; (ii) For any three sets $X, Y,Z$ in $F$, $X \cup Y \cup Z \neq R,$ (iii) $\bigcup_{X \in F} X = R$

The first row of this table is filled with the numbers $1$ through $10$, in that order. The second row is filled with the numbers from $1$ to $10$, in any order. In each box of the third row the sum of the two numbers written above is written. Is there a way to fill in the second row so that the ones digits of the numbers in the third row are all different? [img]https://cdn.artofproblemsolving.com/attachments/8/5/41117d105cc880bf452fa46132c20f2167aa5b.png[/img]

Count the number $N$ of all sets $A:=\{x_1,x_2,x_3,x_4\}$ of non-negative integers satisfying $$x_1+x_2+x_3+x_4=36$$ in at least four different ways. [i]Proposed by Eugene J. Ionaşcu[/i]