If $A=\{1,2,...,4s-1,4s\}$ and $S \subseteq A$ such that $\mid S \mid =2s+2$, prove that in $S$ we can find three distinct numbers $x$, $y$ and $z$ such that $x+y=2z$

The sides of an equilateral triangle are divided into n equal parts by $n-1$ points on each side. Through these points one draws parallel lines to the sides of the triangle. Thus, the initial triangle is divides into $n^2$ equal equilateral triangles. In every vertex of such a triangle there is a beetle. The beetles start crawling simultaneously, with equal speed, along the sides of the small triangles. When they reach a vertex, the beetles change the direction of their movement by $60^{\circ}$ or by $120^{\circ}$ . a) Prove that, if $n \geq 7$, the beetles can move indefinitely on the sides of the small triangles without two beetles ever meeting in a vertex of a small triangle. b) Determine all the values of $n \geq 1$ for which the beetles can move along the sides of the small triangles without meeting in their vertices.

At the bottom-left corner of a $2014\times 2014$ chessboard, there are some green worms and at the top-left corner of the same chessboard, there are some brown worms. Green worms can move only to right and up, and brown worms can move only to right and down. After a while, the worms make some moves and all of the unit squares of the chessboard become occupied at least once throughout this process. Find the minimum total number of the worms.

$ n$ people decide to play a game. There are $ n\minus{}1$ ropes and each of its two ends are in hand of one of the players, in such a way that ropes and players form a tree. (Each person can hold more than rope end.) At each step a player gives one of the rope ends he is holding to another player. The goal is to make a path of length $ n\minus{}1$ at the end. But the game regulations change before game starts. Everybody has to give one of his rope ends only two one of his neighbors. Let $ a$ and $ b$ be minimum steps for reaching to goal in these two games. Prove that $ a\equal{}b$ if and only if by removing all players with one rope end (leaves of the tree) the remaining people are on a path. (the remaining graph is a path.) [img]http://i37.tinypic.com/2l9h1tv.png[/img]

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

[b]p1.[/b] Let $f(x) = \frac{3x^3+7x^2-12x+2}{x^2+2x-3}$ . Find all integers $n$ such that $f(n)$ is an integer. [b]p2.[/b] How many ways are there to arrange $10$ trees in a line where every tree is either a yew or an oak and no two oak trees are adjacent? [b]p3.[/b] $20$ students sit in a circle in a math class. The teacher randomly selects three students to give a presentation. What is the probability that none of these three students sit next to each other? [b]p4.[/b] Let $f_0(x) = x + |x - 10| - |x + 10|$, and for $n \ge 1$, let $f_n(x) = |f_{n-1}(x)| - 1$. For how many values of $x$ is $f_{10}(x) = 0$? [b]p5.[/b] $2$ red balls, $2$ blue balls, and $6$ yellow balls are in a jar. Zion picks $4$ balls from the jar at random. What is the probability that Zion picks at least $1$ red ball and$ 1$ blue ball? [b]p6.[/b] Let $\vartriangle ABC$ be a right-angled triangle with $\angle ABC = 90^o$ and $AB = 4$. Let $D$ on $AB$ such that $AD = 3DB$ and $\sin \angle ACD = \frac35$ . What is the length of $BC$? [b]p7.[/b] Find the value of of $$\dfrac{1}{1 +\dfrac{1}{2+ \dfrac{1}{1+ \dfrac{1}{2+ \dfrac{1}{1+ ...}}}}}$$ [b]p8.[/b] Consider all possible quadrilaterals $ABCD$ that have the following properties; $ABCD$ has integer side lengths with $AB\parallel CD$, the distance between $\overline{AB}$ and $\overline{CD}$ is $20$, and $AB = 18$. What is the maximum area among all these quadrilaterals, minus the minimum area? [b]p9.[/b] How many perfect cubes exist in the set $\{1^{2018},2^{2017}, 3^{2016},.., 2017^2, 2018^1\}$? [b]p10.[/b] Let $n$ be the number of ways you can fill a $2018\times 2018$ array with the digits $1$ through $9$ such that for every $11\times 3$ rectangle (not necessarily for every $3 \times 11$ rectangle), the sum of the $33$ integers in the rectangle is divisible by $9$. Compute $\log_3 n$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m,n\in\mathbb Z_{\ge 0},$ $a_0,a_1,\ldots ,a_m,b_0,b_1,\ldots ,b_n\in\mathbb R_{\ge 0}$ For any integer $0\le k\le m+n,$ define $c_k:=\max_{i+j=k}a_ib_j.$ Proof $$\frac 1{m+n+1}\sum_{k=0}^{m+n}c_k\ge\frac 1{(m+1)(n+1)}\sum_{i=0}^{m}a_i\sum_{j=0}^{n}b_j.$$ [i]Created by Yinghua Ai[/i]

Let $A$ be a set with $1000$ members and $\mathcal F =${$A_1,A_2,\ldots,A_n$} a family of subsets of A such that (a) Each element in $\mathcal F$ consists of 3 members (b) For every five elements in $\mathcal F$, the union of them all will have at least $12$ members Find the largest value of $n$

Consider a coordinate system in the plane, with the origin $O$. We call a lattice point $A{}$ [i]hidden[/i] if the open segment $OA$ contains at least one lattice point. Prove that for any positive integer $n$ there exists a square of side-length $n$ such that any lattice point lying in its interior or on its boundary is hidden.

Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.

Let $n\geq 2$ be a natural number. A unit square is removed from a square $n$ x $n$ and the remaining figure is cut into squares 2 x 2 and 3 x 3. Determine all possible values of $n$.

[u]Round 1[/u] [b]p1.[/b] Alice has a pizza with eight slices. On each slice, she either adds only salt, only pepper, or leaves it plain. Determine how many ways there are for Alice to season her entire pizza. [b]p2.[/b] Call a number almost prime if it has exactly three divisors. Find the number of almost prime numbers less than $100$. [b]p3.[/b] Determine the maximum number of points of intersection between a circle and a regular pentagon. [u]Round 2[/u] [b]p4.[/b] Let $d(n)$ denote the number of positive integer divisors of $n$. Find $d(d(20^{18}))$. [b]p5.[/b] $20$ chubbles are equal to $19$ flubbles. $20$ flubbles are equal to $18$ bubbles. How many bubbles are $1000$ chubbles worth? [b]p6.[/b] Square $ABCD$ and equilateral triangle $EFG$ have equal area. Compute $\frac{AB}{EF}$ . [u]Round 3[/u] [b]p7.[/b] Find the minimumvalue of $y$ such that $y = x^2 -6x -9$ where x is a real number. [b]p8.[/b] I have $2$ pairs of red socks, $5$ pairs of white socks, and $7$ pairs of blue socks. If I randomly pull out one sock at a time without replacement, how many socks do I need to draw to guarantee that I have drawn $3$ pairs of socks of the same color? [b]p9. [/b]There are $23$ paths from my house to the school, $29$ paths from the school to the library, and $3$ paths fromthe library to town center. Additionally, there are $6$ paths directly from my house to the library. If I have to pass through the library to get to town center, howmany ways are there to travel from my house all the way to the town center? [u]Round 4[/u] [b]p10.[/b] A circle of radius $25$ and a circle of radius $4$ are externally tangent. A line is tangent to the circle of radius $25$ at $A$ and the circle of radius $4$ at $B$, where $A \ne B$. Compute the length of $AB$. [b]p11.[/b] A gambler spins two wheels, one numbered $1$ to $4$ and another numbered $1$ to $5$, and the amount of money he wins is the sum of the two numbers he spins in dollars. Determine the expected amount of money he will win. [b]p12.[/b] Find the remainder when $20^{19}$ is divided by $18$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3166012p28809547]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166099p28810427]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a $3\times 3$ grid, we call the remainder of the grid an “[i]angle[/i]” when a $2\times 2$ grid is cut out from the grid. Now we place some [i]angles[/i] on a $10\times 10$ grid such that the borders of those [i]angles[/i] must lie on the grid lines or its borders, moreover there is no overlap among the [i]angles[/i]. Determine the maximal value of $k$, such that no matter how we place $k$ [i]angles[/i] on the grid, we can always place another [i]angle[/i] on the grid.

Find the maximal cardinality $|S|$ of the subset $S \subset A=\{1, 2, 3, \dots, 9\}$ given that no two sums $a+b | a, b \in S, a \neq b$ are equal.

On the table there are $50$ stacks of coins that have $1,2,3,…,50$ coins respectively. Ana and Beto play the following game in turns: First, Ana chooses one of the $50$ piles on the table, and Beto decides if that pile is for Ana or for him. Then, Beto chooses one of the $49$ remaining piles on the table, and Ana decides if that pile is for her or for Beto. They continue playing alternately in this way until one of the players has $25$ batteries. When that happens, the other player takes all the remaining stacks on the table and whoever has the most coins wins. Determine which of the two players has a winning strategy.

On the "battleship" field (a square of $10\times 10$ cells), $10$ "ships" are placed in the following sequence: first one "ship" of size $1\times 4$, then two - of size $1\times 3$, three - of size $1\times 2$, and, finally, four - $1\times 1$. The rules do not allow "ships" to touch each other even with their tops. Can it happen that when part of the "ships" have already been displayed, there is nowhere to place the next one?

12 points are located on a clock with the sme distance , numbers $1,2,3 , ... 12$ are marked on each point in clockwise order . Use 4 kinds of colors (red,yellow,blue,green) to colour the the points , each kind of color has 3 points . N ow , use these 12 points as the vertex of convex quadrilateral to construct $n$ convex quadrilaterals . They satisfies the following conditions: (1). the colours of vertex of every convex quadrilateral are different from each other . (2). for every 3 quadrilaterals among them , there exists a colour such that : the numbers on the 3 points painted into this colour are different from each other . Find the maximum $n$ .

The points $(1,1),(2,3),(4,5)$ and $(999,111)$ are marked in the coordinate system. We continue to mark points in the following way : [list] [*]If points $(a,b)$ are marked then $(b,a)$ and $(a-b,a+b)$ can be marked [*]If points $(a,b)$ and $(c,d)$ are marked then so can be $(ad+bc, 4ac-4bd)$. [/list] Can we, after some finite number of these steps, mark a point belonging to the line $y=2x$.

There are $n$ blocks placed on the unit squares of a $n \times n$ chessboard such that there is exactly one block in each row and each column. Find the maximum value $k$, in terms of $n$, such that however the blocks are arranged, we can place $k$ rooks on the board without any two of them threatening each other. (Two rooks are not threatening each other if there is a block lying between them.)

[b]p1.[/b] Consider a triangular grid: nodes of the grid are painted black and white. At a single step you are allowed to change colors of all nodes situated on any straight line (with the slope $0^o$ ,$60^o$, or $120^o$ ) going through the nodes of the grid. Can you transform the combination in the left picture into the one in the right picture in a finite number of steps? [img]https://cdn.artofproblemsolving.com/attachments/3/a/957b199149269ce1d0f66b91a1ac0737cf3f89.png[/img] [b]p2.[/b] Find $x$ satisfying $\sqrt{x\sqrt{x \sqrt{x ...}}} = \sqrt{2022}$ where it is an infinite expression on the left side. [b]p3.[/b] $179$ glasses are placed upside down on a table. You are allowed to do the following moves. An integer number $k$ is fixed. In one move you are allowed to turn any $k$ glasses . (a) Is it possible in a finite number of moves to turn all $179$ glasses into “bottom-down” positions if $k=3$? (b) Is it possible to do it if $k=4$? [b]p4.[/b] An interval of length $1$ is drawn on a paper. Using a compass and a simple ruler construct an interval of length $\sqrt{93}$. [b]p5.[/b] Show that $5^{2n+1} + 3^{n+2} 2^{n-1} $ is divisible by $19$ for any positive integer $n$. [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=1-z \\ \dfrac{yz}{y+z}=2-x \\ \dfrac{xz}{x+z}=2-y \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$6$ points are selected on the plane, none of which $3$ lie on one straight line, and all pairwise segments connecting these points are plotted. Some of the sections are plotted in red and others in blue. Prove that any three of the given points are the vertices of a triangle with sides of the same color.

[b]p1.[/b] There are $2024$ apples in a very large basket. First, Julie takes away half of the apples in the basket; then, Diane takes away $202$ apples from the remaining bunch. How many apples remain in the basket? [b]p2.[/b] The set of all permutations (different arrangements) of the letters in ”ABMC” are listed in alphabetical order. The first item on the list is numbered $1$, the second item is numbered $2$, and in general, the kth item on the list is numbered $k$. What number is given to ”ABMC”? [b]p3.[/b] Daniel has a water bottle that is three-quarters full. After drinking $3$ ounces of water, the water bottle is three-fifths full. The density of water is $1$ gram per milliliter, and there are around $28$ grams per ounce. How many milliliters of water could the bottle fit at full capacity? [b]p4.[/b] How many ways can four distinct $2$-by-$1$ rectangles fit on a $2$-by-$4$ board such that each rectangle is fully on the board? [b]p5.[/b] Iris and Ivy start reading a $240$ page textbook with $120$ left-hand pages and $120$ right-hand pages. Iris takes $4$ minutes to read each page, while Ivy takes $5$ minutes to read a left-hand page and $3$ minutes to read a right-hand page. Iris and Ivy move onto the next page only when both sisters have completed reading. If a sister finishes reading a page first, the other sister will start reading three times as fast until she completes the page. How many minutes after they start reading will both sisters finish the textbook? [b]p6.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length $24$. Then, let $M$ be the midpoint of $BC$. Define $P$ to be the set of all points $P$ such that $2PM = BC$. The minimum value of $AP$ can be expressed as $\sqrt{a}- b$, where $a$ and $b$ are positive integers. Find $a + b$. [b]p7.[/b] Jonathan has $10$ songs in his playlist: $4$ rap songs and $6$ pop songs. He will select three unique songs to listen to while he studies. Let $p$ be the probability that at least two songs are rap, and let $q$ be the probability that none of them are rap. Find $\frac{p}{q}$ . [b]p8.[/b] A number $K$ is called $6,8$-similar if $K$ written in base $6$ and $K$ written in base $8$ have the same number of digits. Find the number of $6,8$-similar values between $1$ and $1000$, inclusive. [b]p9.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD^2$. [b]p10.[/b] Bob, Eric, and Raymond are playing a game. Each player rolls a fair $6$-sided die, and whoever has the highest roll wins. If players are tied for the highest roll, the ones that are tied reroll until one wins. At the start, Bob rolls a $4$. The probability that Eric wins the game can be expressed as $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p11.[/b] Define the following infinite sequence $s$: $$s = \left\{\frac92,\frac{99}{2^2},\frac{999}{2^3} , ... , \overbrace{\frac{999...999}{2^k}}^{k\,\,nines}, ...\right\}$$ The sum of the first $2024$ terms in $s$, denoted $S$, can be expressed as $$S =\frac{5^a - b}{4}+\frac{1}{2^c},$$ where $a, b$, and $c$ are positive integers. Find $a + b + c$. [b]p12.[/b] Andy is adding numbers in base $5$. However, he accidentally forgets to write the units digit of each number. If he writes all the consecutive integers starting at $0$ and ending at $50$ (base $10$) and adds them together, what is the difference between Andy’s sum and the correct sum? (Express your answer in base-$10$.) [b]p13.[/b] Let $n$ be the positive real number such that the system of equations $$y =\frac{1}{\sqrt{2024 - x^2}}$$ $$y =\sqrt{x^2 - n}$$ has exactly two real solutions for $(x, y)$: $(a, b)$ and $(-a, b)$. Then, $|a|$ can be expressed as $j\sqrt{k}$, where $j$ and $k$ are integers such that $k$ is not divisible by any perfect square other than $1$. Find $j · k$. [b]p14.[/b] Nakio is playing a game with three fair $4$-sided dice. But being the cheater he is, he has secretly replaced one of the three die with his own $4$-sided die, such that there is a $1/2$ chance of rolling a $4$, and a $1/6$ chance to roll each number from $1$ to $3$. To play, a random die is chosen with equal probability and rolled. If Nakio guesses the number that is on the die, he wins. Unfortunately for him, Nakio’s friends have an anti-cheating mechanism in place: when the die is picked, they will roll it three times. If each roll lands on the same number, that die is thrown out and one of the two unused dice is chosen instead with equal probability. If Nakio always guesses $4$, the probability that he wins the game can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime. Find $m + n$. [b]p15.[/b] A particle starts in the center of a $2$m-by-$2$m square. It moves in a random direction such that the angle between its direction and a side of the square is a multiple of $30^o$. It travels in that direction at $1$ m/s, bouncing off of the walls of the square. After a minute, the position of the particle is recorded. The expected distance from this point to the start point can be written as $$\frac{1}{a}\left(b - c\sqrt{d}\right),$$ where $a$ and $b$ are relatively prime, and d is not divisible by any perfect square. Find $a + b + c + d$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A school has 2021 students, each of which knows at least 45 of the other students (where "knowing" is mutual). Show that there are four students who can be seated at a round table such that each of them knows both of her neighbours.

On the grid plane all possible broken lines with the following properties are constructed: each of them starts at the point $(0, 0)$, has all its vertices at integer points, each linear segment goes either up or to the right along the grid lines. For each such broken line consider the corresponding [i]worm[/i], the subset of the plane consisting of all the cells that share at least one point with the broken line. Prove that the number of worms that can be divided into dominoes (rectangles $2\times 1$ and $1\times 2$) in exactly $n > 2$ different ways, is equal to the number of positive integers that are less than n and relatively prime to $n$. (Ilke Chanakchi, Ralf Schiffler)

Given a $n \times n$ square table. Exactly one beetle sits in each cell of the table. At $12.00$ all beetles creeps to some neighbouring cell (two cells are neighbouring if they have the common side). Find the greatest number of cells which can become empty (i.e. without beetles) if a) $n=8$ b) $n=9$ Problem Committee of BMO 2011