In a room, there are $2005$ boxes, each of them containing one or several sorts of fruits, and of course an integer amount of each fruit. [b]a)[/b] Show that we can find $669$ boxes, which altogether contain at least a third of all apples and at least a third of all bananas. [b]b)[/b] Can we always find $669$ boxes, which altogether contain at least a third of all apples, at least a third of all bananas and at least a third of all pears?

To celebrate the 20th Thailand Mathematical Olympiad (TMO), Ratchasima Witthayalai School put up flags around the Thao Suranari Monument so that [list=i] [*] Each flag is painted in exactly one color, and at least $2$ distinct colors are used. [*] The number of flags are odd. [*] Every flags are on a regular polygon such that each vertex has one flag. [*] Every flags with the same color are on a regular polygon. [/list] Prove that there are at least $3$ colors with the same amount of flags.

There are $n$ lamps and $k$ switches in a room. Initially, each lamp is either turned on or turned off. Each lamp is connected by a wire with $2020$ switches. Switching a switch changes the state of a lamp, that is connected to it, to the opposite state. It is known that one can switch the switches so that all lamps will be turned on. Prove, that it is possible to achieve the same result by switching the switches no more than $ \left \lfloor \dfrac{k}{2} \right \rfloor$ times. [i]Proposed by T. Zimanov[/i]

A square of side $5$ is divided into $25$ unit squares. Let $A$ be the set of the $16$ interior points of the initial square which are vertices of the unit squares. What is the largest number of points of $A$ no three of which form an isosceles right triangle?

Can we put intengers $1,2,\cdots,12$ on a circle, number them $a_1,a_2,\cdots,a_{12}$ in order. For any $1\leq i<j\leq12$, $|a_i-a_j|\neq|i-j|$?

$N$ in natural. There are natural numbers from $N^3$ to $N^3+N$ on the board. $a$ numbers was colored in red, $b$ numbers was colored in blue. Sum of red numbers in divisible by sum of blue numbers. Prove, that $b|a$

Let $S$ be a set of points in the plane satisfying the following conditions: (a) there are seven points in $S$ that form a convex heptagon; and (b) for any five points in $S$, if they form a convex pentagon, then there is point in $S$ lies in the interior of the pentagon. Determine the minimum value of the number of elements in $S$.

Initially, Igna distributes $1000$ balls into $30$ boxes. Then, Igna and Mica alternate turns, starting with Igna. Each player, on their turn, chooses a box and removes one ball. When a player removes the last ball from a box, they earn a coin. Find the maximum integer $k$ such that, regardless of how Mica plays, Igna can earn at least $k$ coins.

Can you make $2015$ positive integers $1,2, \ldots , 2015$ to be a certain permutation which can be ordered in the circle such that the sum of any two adjacent numbers is a multiple of $4$ or a multiple of $7$?

Let $n\geq 2$ be an integer. Determine the number of terms in the polynomial $$\prod_{1\leq i< j\leq n}(x_i+x_j)$$ whose coefficients are odd integers.

Rakesh is flipping a fair coin repeatedly. If $T$ denotes the event where the coin lands on tails and $H$ denotes the event where the coin lands on heads, what is the probability Rakesh flips the sequence $HHH$ before the sequence $THH$?

Find the maximum possible number of kings on a $12\times 12$ chess table so that each king attacks exactly one of the other kings (a king attacks only the squares that have a common point with the square he sits on).

Sabine has a very large collection of shells. She decides to give part of her collection to her sister. On the first day, she lines up all her shells. She takes the shells that are in a position that is a perfect square (the first, fourth, ninth, sixteenth, etc. shell), and gives them to her sister. On the second day, she lines up her remaining shells. Again, she takes the shells that are in a position that is a perfect square, and gives them to her sister. She repeats this process every day. The $27$th day is the first day that she ends up with fewer than $1000$ shells. The $28$th day she ends up with a number of shells that is a perfect square for the tenth time. What are the possible numbers of shells that Sabine could have had in the very beginning?

There are $2n$ distinct points on a circle. The numbers $1$ through $2n$ are randomly assigned to this one points distributed. Each point is connected to exactly one other point, so that no of the resulting connecting routes intersect. If a segment connects the numbers $a$ and $b$, so we assign the value $ |a - b|$ to the segment . Show that we can choose the routes such that the sum of these values ​​results $n^2$.

On a planet there are $3\times2005!$ aliens and $2005$ languages. Each pair of aliens communicates with each other in exactly one language. Show that there are $3$ aliens who communicate with each other in one common language.

In each square of an $n \times n$ board with $n\ge 2$, an integer is written not null. Said board is called [i]Inca [/i] if for each square, the number written on it is equal to the difference of the numbers written on two of its neighboring squares (with a common side). For what values of $n$, can you get [i]Inca[/i] boards ?

Let $A$ be an infinite set of positive integers such that every $n \in A$ is the product of at most $1987$ prime numbers. Prove that there is an infinite set $B \subset A$ and a number $p$ such that the greatest common divisor of any two distinct numbers in $B$ is $p.$

The writer Arthur has $n \ge1$ co-authors who write books with him. Each book has a list of authors including Arthur himself. No two books have the same set of authors. At a party with all his co-author, each co-author writes on a note how many books they remember having written with Arthur. Inspecting the numbers on the notes, they discover that the numbers written down are the first $n$ Fibonacci numbers (defined by $F_1 = F_2 = 1$ and $F_{k+2}= F_{k+1} + F_k$). For which $n$ is it possible that none of the co-authors had a lapse of memory?

We consider tilings of a rectangular $m \times n$-board with $1\times2$-tiles. The tiles can be placed either horizontally, or vertically, but they aren't allowed to overlap and to be placed partially outside of the board. All squares on theboard must be covered by a tile. (a) Prove that for every tiling of a $4 \times 2010$-board with $1\times2$-tiles there is a straight line cutting the board into two pieces such that every tile completely lies within one of the pieces. (b) Prove that there exists a tiling of a $5 \times  2010$-board with $1\times 2$-tiles such that there is no straight line cutting the board into two pieces such that every tile completely lies within one of the pieces.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]D1.[/b] What is the solution to the equation $3 \cdot x \cdot 5 = 4 \cdot 5 \cdot 6$? [b]D2.[/b] Mr. Rose is making Platonic solids! If there are five different types of Platonic solids, and each Platonic solid can be one of three colors, how many different colored Platonic solids can Mr. Rose make? [b]D3.[/b] What fraction of the multiples of $5$ between $1$ and $100$ inclusive are also multiples of $20$? [b]D4.[/b] What is the maximum number of times a circle can intersect a triangle? [b]D5 / L1.[/b] At an interesting supermarket, the nth apple you purchase costs $n$ dollars, while pears are $3$ dollars each. Given that Layla has exactly enough money to purchase either $k$ apples or $2k$ pears for $k > 0$, how much money does Layla have? [b]D6 / L3.[/b] For how many positive integers $1 \le n \le 10$ does there exist a prime $p$ such that the sum of the digits of $p$ is $n$? [b]D7 / L2.[/b] Real numbers $a, b, c$ are selected uniformly and independently at random between $0$ and $1$. What is the probability that $a \ge b \le c$? [b]D8.[/b] How many ordered pairs of positive integers $(x, y)$ satisfy $lcm(x, y) = 500$? [b]D9 / L4.[/b] There are $50$ dogs in the local animal shelter. Each dog is enemies with at least $2$ other dogs. Steven wants to adopt as many dogs as possible, but he doesn’t want to adopt any pair of enemies, since they will cause a ruckus. Considering all possible enemy networks among the dogs, find the maximum number of dogs that Steven can possibly adopt. [b]D10 / L7.[/b] Unit circles $a, b, c$ satisfy $d(a, b) = 1$, $d(b, c) = 2$, and $d(c, a) = 3,$ where $d(x, y)$ is defined to be the minimum distance between any two points on circles $x$ and $y$. Find the radius of the smallest circle entirely containing $a$, $b$, and $c$. [b]D11 / L8.[/b] The numbers $1$ through $5$ are written on a chalkboard. Every second, Sara erases two numbers $a$ and $b$ such that $a \ge b$ and writes $\sqrt{a^2 - b^2}$ on the board. Let M and m be the maximum and minimum possible values on the board when there is only one number left, respectively. Find the ordered pair $(M, m)$. [b]D12 / L9.[/b] $N$ people stand in a line. Bella says, “There exists an assignment of nonnegative numbers to the $N$ people so that the sum of all the numbers is $1$ and the sum of any three consecutive people’s numbers does not exceed $1/2019$.” If Bella is right, find the minimum value of $N$ possible. [b]D13 / L10.[/b] In triangle $\vartriangle ABC$, $D$ is on $AC$ such that $BD$ is an altitude, and $E$ is on $AB$ such that $CE$ is an altitude. Let F be the intersection of $BD$ and $CE$. If $EF = 2FC$, $BF = 8DF$, and $DC = 3$, then find the area of $\vartriangle CDF$. [b]D14 / L11.[/b] Consider nonnegative real numbers $a_1, ..., a_6$ such that $a_1 +... + a_6 = 20$. Find the minimum possible value of $$\sqrt{a^2_1 + 1^2} +\sqrt{a^2_2 + 2^2} +\sqrt{a^2_3 + 3^2} +\sqrt{a^2_4 + 4^2} +\sqrt{a^2_5 + 5^2} +\sqrt{a^2_6 + 6^2}.$$ [b]D15 / L13.[/b] Find an $a < 1000000$ so that both $a$ and $101a$ are triangular numbers. (A triangular number is a number that can be written as $1 + 2 +... + n$ for some $n \ge 1$.) Note: There are multiple possible answers to this problem. You only need to find one. [b]L6.[/b] How many ordered pairs of positive integers $(x, y)$, where $x$ is a perfect square and $y$ is a perfect cube, satisfy $lcm(x, y) = 81000000$? [b]L12.[/b] Given two points $A$ and $B$ in the plane with $AB = 1$, define $f(C)$ to be the incenter of triangle $ABC$, if it exists. Find the area of the region of points $f(f(X))$ where $X$ is arbitrary. [b]L14.[/b] Leptina and Zandar play a game. At the four corners of a square, the numbers $1, 2, 3$, and $4$ are written in clockwise order. On Leptina’s turn, she must swap a pair of adjacent numbers. On Zandar’s turn, he must choose two adjacent numbers $a$ and $b$ with $a \ge b$ and replace $a$ with $ a - b$. Zandar wants to reduce the sum of the numbers at the four corners of the square to $2$ in as few turns as possible, and Leptina wants to delay this as long as possible. If Leptina goes first and both players play optimally, find the minimum number of turns Zandar can take after which Zandar is guaranteed to have reduced the sum of the numbers to $2$. [b]L15.[/b] There exist polynomials $P, Q$ and real numbers $c_0, c_1, c_2, ... , c_{10}$ so that the three polynomials $P, Q$, and $$c_0P^{10} + c_1P^9Q + c_2P^8Q^2 + ... + c_{10}Q^{10}$$ are all polynomials of degree 2019. Suppose that $c_0 = 1$, $c_1 = -7$, $c_2 = 22$. Find all possible values of $c_{10}$. Note: The answer(s) are rational numbers. It suffices to give the prime factorization(s) of the numerator(s) and denominator(s). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There is scales on the teacher's table. There is a set of weighs on the scales, and there are some pupils' names (may be more than one) on the every weigh. A pupil entering the classroom moves all the weight with his name to another side of the scales. Prove that you can let in such a subset of the pupils, that the scales will change its position.

A permutation $ \{x_1, x_2, \ldots, x_{2n}\}$ of the set $ \{1,2, \ldots, 2n\}$ where $ n$ is a positive integer, is said to have property $ T$ if $ |x_i \minus{} x_{i \plus{} 1}| \equal{} n$ for at least one $ i$ in $ \{1,2, \ldots, 2n \minus{} 1\}.$ Show that, for each $ n$, there are more permutations with property $ T$ than without.

A cube is partitioned into finitely many rectangular parallelepipeds with the edges parallel to the edges of the cube. Prove that if the sum of the volumes of the circumspheres of these parallelepipeds equals the volume of the circumscribed sphere of the cube, then all the parallelepipeds are cubes.

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares. $(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard? $(b)$ When it is possible, find the minimum number of trominoes needed.

We call a finite plane set $S$ consisting of points with integer coefficients a two-neighbour set, if for each point $(p, q)$ of $S$ exactly two of the points $(p +1, q), (p, q +1), (p-1, q), (p, q-1)$ belong to $S$. For which integers $n$ there exists a two-neighbour set which contains exactly $n$ points?