Let $A_{1}A_{2}\ldots A_{9}$ be a regular $9-$gon. Let $\{A_{1},A_{2},\ldots,A_{9}\}=S_{1}\cup S_{2}\cup S_{3}$ such that $|S_{1}|=|S_{2}|=|S_{3}|=3$. Prove that there exists $A,B\in S_{1}$, $C,D\in S_{2}$, $E,F\in S_{3}$ such that $AB=CD=EF$ and $A \neq B$, $C\neq D$, $E\neq F$.

Given a set $S=\{1,2,3,\ldots,3n\},(n\in N^*)$, let $T$ be a subset of $S$, such that for any $x, y, z\in T$ (not necessarily distinct) we have $x+y+z\not \in T$. Find the maximum number of elements $T$ can have.

Each of the natural numbers from $1$ to $n$ is colored either red or blue, with each color being used at least once. It turns out that: – every red number is a sum of two distinct blue numbers; and – every blue number is a difference between two red numbers. Determine the smallest possible value of $n$ for which such a coloring exists.

A fighting game club has $2024$ members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly $3$ other members. Each match has a winner and a loser. A member will be [i]happy[/i] if they won in at least $2$ of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?

Two players in turn put two or three coins into their own hats (before the game starts, the hats are empty). Each time, after the second player duplicated the move of the first player, they exchange hats. The player wins, if after his move his hat contains one hundred or more coins. Which player has a winning strategy?

Prove that every partition of $3$-dimensional space into three disjoint subsets has the following property: One of these subsets contains all possible distances; i.e., for every $a \in \mathbb R^+$, there are points $M$ and $N$ inside that subset such that distance between $M$ and $N$ is exactly $a.$

We make groups of numbers. Each group consists of [i]five[/i] distinct numbers. A number may occur in multiple groups. For any two groups, there are exactly four numbers that occur in both groups. (a) Determine whether it is possible to make $2015$ groups. (b) If all groups together must contain exactly [i]six [/i] distinct numbers, what is the greatest number of groups that you can make? (c) If all groups together must contain exactly [i]seven [/i] distinct numbers, what is the greatest number of groups that you can make?

Exactly $4n$ numbers in set $A= \{ 1,2,3,...,6n \} $ of natural numbers painted in red, all other in blue. Proved that exist $3n$ consecutive natural numbers from $A$, exactly $2n$ of which numbers is red.

Find the minimal number of cells on a $5\times 7$ board that must be painted so that any cell which is not painted has exactly one neighboring (having a common side) painted cell.

[b]p1.[/b] Velociraptor $A$ is located at $x = 10$ on the number line and runs at $4$ units per second. Velociraptor $B$ is located at $x = -10$ on the number line and runs at $3$ units per second. If the velociraptors run towards each other, at what point do they meet? [b]p2.[/b] Let $n$ be a positive integer. There are $n$ non-overlapping circles in a plane with radii $1, 2, ... , n$. The total area that they enclose is at least $100$. Find the minimum possible value of $n$. [b]p3.[/b] How many integers between $1$ and $50$, inclusive, are divisible by $4$ but not $6$? [b]p4.[/b] Let $a \star b = 1 + \frac{b}{a}$. Evaluate $((((((1 \star 1) \star 1) \star 1) \star 1) \star 1) \star 1) \star 1$. [b]p5.[/b] In acute triangle $ABC$, $D$ and $E$ are points inside triangle $ABC$ such that $DE \parallel BC$, $B$ is closer to $D$ than it is to $E$, $\angle AED = 80^o$ , $\angle ABD = 10^o$ , and $\angle CBD = 40^o$. Find the measure of $\angle BAE$, in degrees. [b]p6. [/b]Al is at $(0, 0)$. He wants to get to $(4, 4)$, but there is a building in the shape of a square with vertices at $(1, 1)$, $(1, 2)$, $(2, 2)$, and $(2, 1)$. Al cannot walk inside the building. If Al is not restricted to staying on grid lines, what is the shortest distance he can walk to get to his destination? [b]p7. [/b]Point $A = (1, 211)$ and point $B = (b, 2011)$ for some integer $b$. For how many values of $b$ is the slope of $AB$ an integer? [b]p8.[/b] A palindrome is a number that reads the same forwards and backwards. For example, $1$, $11$ and $141$ are all palindromes. How many palindromes between $1$ and 1000 are divisible by $11$? [b]p9.[/b] Suppose $x, y, z$ are real numbers that satisfy: $$x + y - z = 5$$ $$y + z - x = 7$$ $$z + x - y = 9$$ Find $x^2 + y^2 + z^2$. [b]p10.[/b] In triangle $ABC$, $AB = 3$ and $AC = 4$. The bisector of angle $A$ meets $BC$ at $D$. The line through $D$ perpendicular to $AD$ intersects lines $AB$ and $AC$ at $F$ and $E$, respectively. Compute $EC - FB$. (See the following diagram.) [img]https://cdn.artofproblemsolving.com/attachments/2/7/e26fbaeb7d1f39cb8d5611c6a466add881ba0d.png[/img] [b]p11.[/b] Bob has a six-sided die with a number written on each face such that the sums of the numbers written on each pair of opposite faces are equal to each other. Suppose that the numbers $109$, $131$, and $135$ are written on three faces which share a corner. Determine the maximum possible sum of the numbers on the three remaining faces, given that all three are positive primes less than $200$. [b]p12.[/b] Let $d$ be a number chosen at random from the set $\{142, 143, ..., 198\}$. What is the probability that the area of a rectangle with perimeter $400$ and diagonal length $d$ is an integer? [b]p13.[/b] There are $3$ congruent circles such that each circle passes through the centers of the other two. Suppose that $A, B$, and $C$ are points on the circles such that each circle has exactly one of $A, B$, or $C$ on it and triangle $ABC$ is equilateral. Find the ratio of the maximum possible area of $ABC$ to the minimum possible area of $ABC$. (See the following diagram.) [img]https://cdn.artofproblemsolving.com/attachments/4/c/162554fcc6aa21ce3df3ce6a446357f0516f5d.png[/img] [b]p14.[/b] Let $k$ and $m$ be constants such that for all triples $(a, b, c)$ of positive real numbers, $$\sqrt{ \frac{4}{a^2}+\frac{36}{b^2}+\frac{9}{c^2}+\frac{k}{ab} }=\left| \frac{2}{a}+\frac{6}{b}+\frac{3}{c}\right|$$ if and only if $am^2 + bm + c = 0$. Find $k$. [b]p15.[/b] A bored student named Abraham is writing $n$ numbers $a_1, a_2, ..., a_n$. The value of each number is either $1, 2$, or $3$; that is, $a_i$ is $1, 2$ or $3$ for $1 \le i \le n$. Abraham notices that the ordered triples $$(a_1, a_2, a_3), (a_2, a_3, a_4), ..., (a_{n-2}, a_{n-1}, a_n), (a_{n-1}, a_n, a_1), (a_n, a_1, a_2)$$ are distinct from each other. What is the maximum possible value of $n$? Give the answer n, along with an example of such a sequence. Write your answer as an ordered pair. (For example, if the answer were $5$, you might write $(5, 12311)$.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

To celebrate the $20$th LMT, the LHSMath Team bakes a cake. Each of the $n$ bakers places $20$ candles on the cake. When they count, they realize that there are $(n -1)!$ total candles on the cake. Find $n$. [i]Proposed by Christopher Cheng[/i]

How many paths from $(0,0)$ to $(n,n)$ of length $2n$ are there with exactly $k$ steps. A step is an occurence of the pair $EN$ in the path

There are $2014$ airports in the faraway land of Artinia. Each pair of airports is connected by a nonstop flight in one or both directions. Show that there is some airport from which it is possible to reach every other airport in at most two flights.

A lantern needs exactly $2$ charged batteries in order to work.We have available $n$ charged batteries and $n$ uncharged batteries,$n\ge 4$(all batteries look the same). A [i]try[/i] consists in introducing two batteries in the lantern and verifying if the lantern works.Prove that we can find a pair of charged batteries in at most $n+2$ [i]tries[/i].

Morteza Has $100$ sets. at each step Mahdi can choose two distinct sets of them and Morteza tells him the intersection and union of those two sets. Find the least steps that Mahdi can find all of the sets. Proposed by Morteza Saghafian

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

In table [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZC9hLzBjNjFlZWFjM2ZlOTQzMTk2YTdkMzQ2MjJiYzYyMWFlN2Y0ZGZlLnBuZw==&rn=dGFibGljYWEucG5n[/img] $10$ numbers are circled, in every row and every column exactly one. Prove that among them, there are at least two equal

A bored student walks down a hallway where there is a row of closed lockers, numbered from $1$ to $1024$. Opens cabinet No. $1$, then skips one cabinet and opens the next, and so on successively. When he reaches the end of the row, he turns around and starts again: he opens the first cabinet it finds closed, he skips the next closed cabinet and so on until the start from the hallway. goes from beginning to end, from end to beginning of the corridor until all the cabinets are left open. What is the number of the last cabinet he opened?

In an election between $\text{A}$ and $\text{B}$, during the counting of the votes, neither candidate was more than $2$ votes ahead, and the vote ended in a tie, $6$ votes to $6$ votes. Two votes for the same candidate are indistinguishable. In how many orders could the votes have been counted? One possibility is $\text{AABBABBABABA}$.

The plane is divided into strips of width $1$ by parallel lines (a strip - the region between two parallel lines). The points from the interior of each strip are coloured with red or white, such that in each strip only one color is used (the points of a strip are coloured with the same color). The points on the lines are not coloured. Show that there is an equilateral triangle of side-length $100$, with all vertices of the same colour.

An integer is given $N> 1$. Arne and Britt play the following game: (1) Arne says a positive integer $A$. (2) Britt says an integer $B> 1$ that is either a divisor of $A$ or a multiple of $A$. ($A$ itself is a possibility.) (3) Arne says a new number $A$ that is either $B - 1, B$ or $B + 1$. The game continues by repeating steps 2 and 3. Britt wins if she is okay with being told the number $N$ before the $50$th has been said. Otherwise, Arne wins. a) Show that Arne has a winning strategy if $N = 10$. b) Show that Britt has a winning strategy if $N = 24$. c) For which $N$ does Britt have a winning strategy?

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

[u]Round 5[/u] [b]p13.[/b] Simplify $\frac11+\frac13+\frac16+\frac{1}{10}+\frac{1}{15}+\frac{1}{21}$. [b]p14.[/b] Given that $x + y = 7$ and $x^2 + y^2 = 29$, what is the sum of the reciprocals of $x$ and $y$? [b]p15.[/b] Consider a rectangle $ABCD$ with side lengths $AB = 3$ and $BC = 4$. If circles are inscribeδ in triangles $ABC$ and $BCD$, how far are the centers of the circles from each other? [u]Round 6[/u] [b]p16.[/b] Evaluate $\frac{2!}{1!} +\frac{3!}{2!} +\frac{4!}{3!} + ... +\frac{99!}{98!}+\frac{100!}{99!}$ . [b]p17.[/b] Let $ABCD$ be a square of side length $2$. A semicircle is drawn with diameter $\overline{AC}$ that passes through point $B$. Find the area of the region inside the semicircle but outside the square. [b]p18.[/b] For how many positive integer values of $k$ is $\frac{37k - 30}{k}$ a positive integer? [u]Round 7[/u] [b]p19.[/b] Two parallel planar slices across a sphere of radius $25$ create cross sections of area $576\pi$ and $225\pi$. What is the maximum possible distance between the two slices? [b]p20.[/b] How many positive integers cannot be expressed in the form $3\ell + 4m + 5t$, where $\ell$, $m$, and $t$ are nonnegative integers? [b]p21.[/b] In April, a fool is someone who is fooled by a classmate. In a class of $30$ students, $14$ people were fooled by someone else and $29$ people fooled someone else. What is the largest positive integer $n$ for which we can guarantee that at least one person was fooled by at least $n$ other people? [u]Round 8[/u] [b]p22.[/b] Let $$S = 4 + \dfrac{12}{4 +\dfrac{ 12}{4 +\dfrac{ 12}{4+ ...}}}.$$ Evaluate $4 +\frac{ 12}{S}.$ [b]p23.[/b] Jonathan is buying bananagram sets for $\$11$ each and flip-flops for $\$17$ each. If he spends $\$227$ on purchases for bananagram sets and flip-flops, what is the total number of bananagram sets and flip-flops he bought? [b]p24.[/b] Alan has a $3 \times 3$ array of squares. He starts removing the squares one at a time such that each time he removes one square, all remaining squares share a side with at least two other remaining squares. What is the maximum number of squares Alan can remove? PS. You should use hide for answers. Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h2952214p26434209]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134133p28400917]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $n$ coins in a row, $n\geq 2$. If one of the coins is head, select an odd number of consecutive coins (or even 1 coin) with the one in head on the leftmost, and then flip all the selected coins upside down simultaneously. This is a $move$. No move is allowed if all $n$ coins are tails. Suppose $m-1$ coins are heads at the initial stage, determine if there is a way to carry out $ \lfloor\frac {2^m}{3}\rfloor $ moves

Andile and Zandre play a game on a $2017 \times 2017$ board. At the beginning, Andile declares some of the squares [i]forbidden[/i], meaning the nothing may be placed on such a square. After that, they take turns to place coins on the board, with Zandre placing the first coin. It is not allowed to place a coin on a forbidden square or in the same row or column where another coin has already been placed. The player who places the last coin wins the game. What is the least number of squares Andile needs to declare as forbidden at the beginning to ensure a win? (Assume that both players use an optimal strategy.)