Find the number of sets with $10$ distinct positive integers such that the average of its elements is less than 6.

Integers $1,2, ...,2n$ are arbitrarily assigned to boxes labeled with numbers $1, 2,..., 2n$. Now, we add the number assigned to the box to the number on the box label. Show that two such sums give the same remainder modulo $2n$.

For a positive integer $n$, ($n\ge 2$), find the number of sets with $2n + 1$ points $P_0, P_1,..., P_{2n}$ in the coordinate plane satisfying the following as its elements: - $P_0 = (0, 0),P_{2n}= (n, n)$ - For all $i = 1,2,..., 2n - 1$, line $P_iP_{i+1}$ is parallel to $x$-axis or $y$-axis and its length is $1$. - Out of $2n$ lines$P_0P_1, P_1P_2,..., P_{2n-1}P_{2n}$, there are exactly $4$ lines that are enclosed in the domain $y \le x$.

In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?

Let be four positive integers $m, n, p, q$, with $p < m$ given and $q < n$. Take four points $A(0; 0), B(p; 0), C (m; q)$ and $D(m; n)$ in the coordinate plane. Consider the paths $f$ from $A$ to $D$ and the paths $g$ from $B$ to $C$ such that when going along $f$ or $g$, one goes only in the positive directions of coordinates and one can only change directions (from the positive direction of one axe coordinate into the the positive direction of the other axe coordinate) at the points with integral coordinates. Let $S$ be the number of couples $(f, g)$ such that $f$ and $g$ have no common points. Prove that \[S = \binom{n}{m+n} \cdot \binom{q}{m+q-p} - \binom{q}{m+q} \cdot \binom{n}{m+n-p}.\]

In the creation of the world there is a lonely island inhabited by dragons, snakes and crocodiles. Every inhabitant eats once a day: every snake eats one dragon for breakfast, every dragon eats one crocodile for lunch and every crocodile eats a snake for dinner. Find the total number of dragons, snakes and crocodiles on the island immediately after the creation of the world (at the beginning of the first day), when, at the end of the sixth day, there is only one inhabitant alive on the island, only one crocodile and during these six days none of the inhabitants of the island considered any to give up their meals due to lack of food.

A not necessary nonplanar polygon in $\mathbb{R}^3$ is called [b]Grid Polygon[/b] if each of it's edges are parallel to one of the axes. (a) There's a right angle between each two neighbour sides of the grid polygon, the plane containing this angle could be parallel to either $xy$ plane, $yz$ plane, or $xz$ plane. Prove that parity of the number of the angles that the plane containing each of them is parallel to $xy$ plane is equal to parity of the number of the angles that the plane containing each of them is parallel to $yz$ plane and parity of the number of the angles that the plane containing each of them is parallel to $zx$ plane. (b) A grid polygon is called [b]Inscribed[/b] if there's a point in the space that has an equal distance from all of the vertices of the polygon. Prove that any nonplanar grid hexagon is inscribed. (c) Does there exist a grid 2014-gon without repeated vertices such that there exists a plane that intersects all of it's edges? (d) If $a,b,c \in \mathbb{N}-\{1\}$, prove that $a,b,c$ are sidelengths of a triangle iff there exists a grid polygon in which the number of it's edges that are parallel to $x$ axis is $a$, the number of it's edges that are parallel to $y$ axis is $b$ and the number of it's edges that are parallel to $z$ axis is $c$. Time allowed for this exam was 1 hour.

The Judgment of the Council of Sages proceeds as follows: the king arranges the sages in a line and places either a white hat or a black hat on each sage's head. Each sage can see the color of the hats of the sages in front of him, but not of his own hat or of the hats of the sages behind him. Then one by one (in an order of their choosing), each sage guesses a color. Afterward, the king executes those sages who did not correctly guess the color of their own hat. The day before, the Council meets and decides to minimize the number of executions. What is the smallest number of sages guaranteed to survive in this case? See also [url]http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=530553[/url]

Determine all integers $k\geqslant 1$ with the following property: given $k$ different colours, if each integer is coloured in one of these $k$ colours, then there must exist integers $a_1<a_2<\cdots<a_{2023}$ of the same colour such that the differences $a_2-a_1,a_3-a_2,\dots,a_{2023}-a_{2022}$ are all powers of $2$.

Midori and Momoi are arguing over chores. Each of $5$ chores may either be done by Midori, done by Momoi, or put off for tomorrow. Today, each of them must complete at least one chore, and more than half of the chores must be completed. How many ways can they assign chores for today? (The order in which chores are completed does not matter.)

Define a string to be doubly palindromic if it can be split into two (non-empty) parts that are read the same both backwards and forwards. For example hannahhuh is doubly palindromic as it can be split into hannah and huh. How many doubly palindromic strings of length 9 using only the letters $\{a, b, c, d\}$ are there?

Let $n$ be the answer to this problem. Find the number of distinct (i.e. non-congruent), non-degenerate triangles with integer side lengths and perimeter $n$.

There are $2008$ participants in a programming competition. In every round, all programmers are divided into two equal-sized teams. Find the minimal number of rounds after which there can be a situation in which every two programmers have been in different teams at least once.

You have an $n\times n$ grid and want to remove all edges of the grid by the sequence of the following moves. In each move, you can select a cell and remove exactly three edges surrounding that cell; in particular, that cell must have at least three remaining edges for the operation to be valid. For which positive integers $n$ is this possible?

The box contains a complete set of dominoes. Two players take turns choosing one dice from the box and placing them on the table, applying them to the already laid out chain on either of the two sides according to the rules of domino. The one who cannot make his next move loses. Who will win if they both played correctly?

$2019$ circles split a plane into a number of parts whose boundaries are arcs of those circles. How many colors are needed to color this geographic map if any two neighboring parts must be coloured with different colours?

Let $n \ge 4$ and $k$ be positive integers. We consider $n$ lines in the plane between which there are not two parallel nor three concurrent. In each of the $\frac{n(n-1)}{2}$ points of intersection of these lines, $k$ coins are placed. Ana and Beto play the following game in turns: each player, in turn, chooses one of those points that does not share one of the $n$ lines with the point chosen immediately before by the other player, and removes a coin from that point. Ana starts and can choose any point. The player who cannot make his move loses. Determine based on $n$ and $k$ who has a winning strategy.

Kid and Karlsson play a game. Initially they have a square piece of chocolate $2019\times 2019$ grid with $1\times 1$ cells . On every turn Kid divides an arbitrary piece of chololate into three rectanglular pieces by cells, and then Karlsson chooses one of them and eats it. The game finishes when it's impossible to make a legal move. Kid wins if there was made an even number of moves, Karlsson wins if there was made an odd number of moves. Who has the winning strategy? [i] (Д. Ширяев)[/i] [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

A square grid on the Euclidean plane consists of all points $(m,n)$, where $m$ and $n$ are integers. Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least $5$?

Jeff has a deck of $12$ cards: $4$ $L$s, $4$ $M$s, and $4$ $T$s. Armaan randomly draws three cards without replacement. The probability that he takes $3$ $L$s can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m +n$.

[u]Round 6[/u] 16. If you roll four fair $6$-sided dice, what is the probability that at least three of them will show the same value. 17. In a tetrahedron with volume $1$, four congruent speres are placed each tangent to three walls and three other spheres. What is the radii of each of the spheres. 18. let $f(x)$ be twice the number of letters in $x$. What is the sum of the unique $x,y$ such that $x \ne y$ and $f(x)=y$ and $f(y)=x$. [u]Round 7[/u] [b]p19.[/b] How many $4$ digit numbers with distinct digits $ABCD$ with $A$ not equal to $0$ are divisible by $11$? [b]p20.[/b] How many ($2$-dimensional) faces does a $2014$-dimensional hypercube have? [b]p21.[/b] How many subsets of the numbers $1,2,3,4...2^{2014}$ have a sum of $2014$ mod $2^{2014}$? [u]Round 8[/u] [b]p22.[/b] Two diagonals of a dodecagon measure $1$ unit and $2$ units. What is the area of this dodecagon? [b]p23.[/b] Square $ABCD$ has point $X$ on AB and $Y$ on $BC$ such that angle $ADX = 15$ degrees and angle $CDY = 30$ degrees. what is the degree measure of angle $DXY$? [b]p24.[/b] A $4\times 4$ grid has the numbers $1$ through $16$ placed in it, $1$ per cell, such that no adjacent boxes have cells adding to a number divisible by $3$. In how many ways is this possible? [u]Round 9[/u] [b]p25.[/b] Let $B$ and $C$ be the answers to $26$ and $27$ respectively.If $S(x)$ is the sum of the digits in $x$, what is the unique integer $A$ such that $S(A), S(B), S(C) \subset A,B,C$. [b]p26.[/b] Let $A$ and $C$ be the answers to $25$ and $27$ respectively. What is the third angle of a triangle with two of its angles equal to $A$ and $C$ degrees. [b]p27.[/b] Let $A$ and $B$ be the answers to $25$ and $26$ respectively. How many ways are there to put $A$ people in a line, with exactly $B$ places where a girl and a boy are next to each other. [u]Round 10[/u] [b]p28.[/b] What is the sum of all the squares of the digits to answers to problems on the individual, team, and theme rounds of this years LMT? If the correct answer is $N$ and you submit $M$, you will recieve $\lfloor 15 - 10  \times \log (M - N) \rfloor $. [b]p29.[/b] How many primes have all distinct digits, like $2$ or $109$ for example, but not $101$. If the correct answer is $N$ and you submit $M$, you will recieve $\left\lfloor 15 \min \left( \frac{M}{N} , \frac{N}{M} \right)\right\rfloor $. [b]p30.[/b] For this problem, you can use any $10$ mathematical symbols that you want, to try to achieve the highest possible finite number. (So "Twenty-one", " $\frac{12}{100} +843$" and "$\sum^{10}_{i=0} i^2 +1$" are all valid submissions.) If your team has the $N$th highest number, you will recieve $\max (16 - N, 0)$. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3156859p28695035]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $50$ exact watches lying on a table. Prove that there exist a certain moment, when the sum of the distances from the centre of the table to the ends of the minute hands is more than the sum of the distances from the centre of the table to the centres of the watches.

Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord. Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.

Let $n$ be a positive integer. A grid of dimensions $n \times n$ is divided in $n^2$ $1 \times 1$ squares. Every segment of length $1$ (side of a square) from this grid is coloured in blue or red. The number of red segments is not greater than $n^2$. Find all positive integers $n$, for which the grid always will cointain at least one $1 \times 1$ square which has at least three blue sides.

[u]Round 5[/u] [b]5.1.[/b] Quadrilateral $ABCD$ is such that $\angle ABC = \angle ADC = 90^o$ , $\angle BAD = 150^o$ , $AD = 3$, and $AB = \sqrt3$. The area of $ABCD$ can be expressed as $p\sqrt{q}$ for positive integers $p, q$ where $q$ is not divisible by the square of any prime. Find $p + q$. [b]5.2.[/b] Neetin wants to gamble, so his friend Akshay describes a game to him. The game will consist of three dice: a $100$-sided one with the numbers $1$ to $100$, a tetrahedral one with the numbers $1$ to $4$, and a normal $6$-sided die. If Neetin rolls numbers with a product that is divisible by $21$, he wins. Otherwise, he pays Akshay $100$ dollars. The number of dollars that Akshay must pay Neetin for a win in order to make this game fair is $a/b$ for relatively prime positive integers $a, b$. Find $a + b$. (Fair means the expected net gain is $0$. ) [b]5.3.[/b] What is the sum of the fourth powers of the roots of the polynomial $P(x) = x^2 + 2x + 3$? [u]Round 6[/u] [b]6.1.[/b] Consider the set $S = \{1, 2, 3, 4,..., 25\}$. How many ordered $n$-tuples $S_1 = (a_1, a_2, a_3,..., a_n)$ of pairwise distinct ai exist such that $a_i \in S$ and $i^2 | a_i$ for all $1 \le i \le n$? [b]6.2.[/b] How many ways are there to place $2$ identical rooks and $ 1$ queen on a $ 4 \times 4$ chessboard such that no piece attacks another piece? (A queen can move diagonally, vertically or horizontally and a rook can move vertically or horizontally) [b]6.3.[/b] Let $L$ be an ordered list $\ell_1$, $\ell_2$, $...$, $\ell_{36}$ of consecutive positive integers who all have the sum of their digits not divisible by $11$. It is given that $\ell_1$ is the least element of $L$. Find the least possible value of $\ell_1$. [u]Round 7[/u] [b]7.1.[/b] Spencer, Candice, and Heather love to play cards, but they especially love the highest cards in the deck - the face cards (jacks, queens, and kings). They also each have a unique favorite suit: Spencer’s favorite suit is spades, Candice’s favorite suit is clubs, and Heather’s favorite suit is hearts. A dealer pulls out the $9$ face cards from every suit except the diamonds and wants to deal them out to the $3$ friends. How many ways can he do this so that none of the $3$ friends will see a single card that is part of their favorite suit? [b]7.2.[/b] Suppose a sequence of integers satisfies the recurrence $a_{n+3} = 7a_{n+2} - 14a_{n+1} + 8a_n$. If $a_0 = 4$, $a_1 = 9$, and $a_2 = 25$, find $a_{16}$. Your answer will be in the form $2^a + 2^b + c$, where $2^a < a_{16} < 2^{a+1}$ and $b$ is as large as possible. Find $a + b + c$. [b]7.3.[/b] Parallel lines $\ell_1$ and $\ell_2$ are $1$ unit apart. Unit square $WXYZ$ lies in the same plane with vertex $W$ on $\ell_1$. Line $\ell_2$ intersects segments $YX$ and $YZ$ at points $U$ and $O$, respectively. Given $UO =\frac{9}{10}$, the inradius of $\vartriangle YOU$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. Find $m + n$. [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of contestants who participated in at least one of the three rounds of the 2020 ABMC April contest. Let $B$ be the number of times the letter b appears in the Accuracy Round. Let $M$ be the number of people who submitted both the speed and accuracy rounds before 2:00 PM EST. Further, let $C$ be the number of times the letter c appears in the Speed Round. Estimate $$A \cdot B + M \cdot C.$$Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2766239p24226402]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].