MTRPia in $2044$ is highly advanced and a lot of the work is done by disc-shaped robots, each of radius $1$ unit. In order to not collide with each other, there robots have a smaller $360$-degree camera mounted on top, as shown in the figure (robot $r_1$ 'sees' robot $r_2$). Each of there cameras themselves are smaller discs of radius $c$. Suppose there are three robots $r_1, r_2, r_3$ placed 'consecutively' such that $r_2$ is roughly in the middle. The angle between the lines joining the centres of $r_1, r_2$ and $r_2, r_3$ is given to be $\theta$. The distance between the centres of $r_1,r_2 = $ distance between centres of $r_2,r_3 = d$. Show (with the aid of clear diagrams) that $r_1$ and $r_3$ can see each other iff $\sin{\theta} > \frac{1-c}{d}$. As a bonus, try to show that in a longer 'chain' of such robots (same $d$, $\theta$), if $\sin{\theta} > \frac{1-c}{d}$ then all robots can see each other.

Let $n$ be a positive integer, $k\in \mathbb{C}$ and $A\in \mathcal{M}_n(\mathbb{C})$ such that $\text{Tr } A\neq 0$ and $$\text{rank } A +\text{rank } ((\text{Tr } A) \cdot I_n - kA) =n.$$ Find $\text{rank } A$.

Let $x,y$, and $z$ be positive real numbers such that $xy+yz+zx=3xyz$. Prove that $$x^2y+y^2z+z^2x \geq 2(x+y+z)-3.$$ In which cases do we have equality?

There are $100$ points of general position marked on the plane (i.e. no three lie on the same straight line). Prove that it is possible to select three marked points $A, B, C$ so that for any point $D$ of the remaining $97$ marked points, the lines $AD$ and $CD$ would not contain points lying inside the triangle $ABC$.

Evaluate the product \[\left(1 + \frac{2}{3}\right)\left(1 + \frac{2}{4}\right)\left(1 + \frac{2}{5}\right) \cdots \left(1 + \frac{2}{98}\right).\]

Farmer John owns 2013 cows. Some cows are enemies of each other, and Farmer John wishes to divide them into as few groups as possible such that each cow has at most 3 enemies in her group. Each cow has at most 61 enemies. Compute the smallest integer $G$ such that, no matter which enemies they have, the cows can always be divided into at most $G$ such groups?

Find the sum of all positive integers n with the property that the digits of n add up to 2015−n.

Which positive integers cannot be represented as a sum of (two or more) consecutive integers?

The $n^\text{th}$ term of a sequence is $a_n=(-1)^n(4n+3)$. Compute the sum \[a_1+a_2+a_3+\cdots+a_{2008}.\]

In triangle $ABC$, medians $AA'$, $BB'$, $CC'$ are extended until they intersect with the circumcircle at points $A_0$, $B_0$, $C_0$, respectively. It is known that the intersection point M of the medians of triangle $ABC$ divides the segment $AA_0$ in half. Prove that the triangle $A_0B_0C_0$ is isosceles.

Ada and Charles play the following game:at the beginning, an integer n>1 is written on the blackboard.In turn, Ada and Charles remove the number k that they find on the blackboard.In turn Ad and Charles remove the number k that they find on the blackboard and they replace it : 1 -either with a positive divisor k different from 1 and k 2- or with k+1 At the beginning each players have a thousand points each.When a player choses move 1, he/she gains one point;when a player choses move 2, he/she loses one point.The game ends when one of the tho players is left with zero points and this player loses the game.Ada moves first.For what values Chares has a winning strategy?

Problems 14, 15 and 16 involve Mrs. Reed's English assignment. A Novel Assignment The students in Mrs. Reed's English class are reading the same 760-page novel. Three friends, Alice, Bob and Chandra, are in the class. Alice reads a page in 20 seconds, Bob reads a page in 45 seconds and Chandra reads a page in 30 seconds. If Bob and Chandra both read the whole book, Bob will spend how many more seconds reading than Chandra? $ \textbf{(A)}\ 7,600 \qquad \textbf{(B)}\ 11,400 \qquad \textbf{(C)}\ 12,500 \qquad \textbf{(D)}\ 15,200 \qquad \textbf{(E)}\ 22,800$

Determine if there exist pairwise distinct positive integers $a_1,a_2,\ldots,a_{101}$, $b_1$, $b_2$, \ldots, $b_{101}$ satisfying the following property: for each non-empty subset $S$ of $\{1,2,\ldots,101\}$ the sum $\sum\limits_{i\in S}a_i$ divides $\left( 100!+\sum\limits_{i\in S}b_i \right)$.

Find all quadruples $(x,y,z,w)$ of integers satisfying the sys­tem of equations $$x + y + z + w = xy + yz + zx + w^2 - w = xyz - w^3 = - 1$$

Mazo performs the following operation on triplets of non-negative integers: If at least one of them is positive, it chooses one positive number, decreases it by one, and replaces the digits in the units place with the other two numbers. It starts with the triple $x$, $y$, $z$. Find a triple of positive integers $x$, $y$, $z$ such that $xy + yz + zx = 1000$ (*) and the number of operations that Mazo can subsequently perform with the triple $x, y, z$ is (a) maximal (i.e. there is no triple of positive integers satisfying (*) that would allow him to do more operations); (b) minimal (i.e. every triple of positive integers satisfying (*) allows him to perform at least so many operations).

Some cells of a $10\times10$ board are marked so that each cell has an even number of neighboring (i.e. sharing a side) marked cells. Find the maximum possible number of marked cells.

Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that \[xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y))\] for all $x, y \in \mathbb{Z}$ with $x \neq 0$.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [u]Set 1[/u] [b]D.1 / L.1[/b] Find the units digit of $3^{1^{3^{3^7}}}$. [b]D.2[/b] Find the positive solution to the equation $x^3 - x^2 = x - 1$. [b]D.3[/b] Points $A$ and $B$ lie on a unit circle centered at O and are distance $1$ apart. What is the degree measure of $\angle AOB$? [b]D.4[/b] A number is a perfect square if it is equal to an integer multiplied by itself. How many perfect squares are there between $1$ and $2019$, inclusive? [b]D.5[/b] Ted has four children of ages $10$, $12$, $15$, and $17$. In fifteen years, the sum of the ages of his children will be twice Ted’s age in fifteen years. How old is Ted now? [u]Set 2[/u] [b]D.6[/b] Mr. Schwartz is on the show Wipeout, and is standing on the first of $5$ balls, all in a row. To reach the finish, he has to jump onto each of the balls and collect the prize on the final ball. The probability that he makes a jump from a ball to the next is $1/2$, and if he doesn’t make the jump he will wipe out and no longer be able to finish. Find the probability that he will finish. [b]D.7 / L. 5[/b] Kevin has written $5$ MBMT questions. The shortest question is $5$ words long, and every other question has exactly twice as many words as a different question. Given that no two questions have the same number of words, how many words long is the longest question? [b]D.8 / L. 3[/b] Square $ABCD$ with side length $1$ is rolled into a cylinder by attaching side $AD$ to side $BC$. What is the volume of that cylinder? [b]D.9 / L.4[/b] Haydn is selling pies to Grace. He has $4$ pumpkin pies, $3$ apple pies, and $1$ blueberry pie. If Grace wants $3$ pies, how many different pie orders can she have? [b]D.10[/b] Daniel has enough dough to make $8$ $12$-inch pizzas and $12$ $8$-inch pizzas. However, he only wants to make $10$-inch pizzas. At most how many $10$-inch pizzas can he make? [u]Set 3[/u] [b]D.11 / L.2[/b] A standard deck of cards contains $13$ cards of each suit (clubs, diamonds, hearts, and spades). After drawing $51$ cards from a randomly ordered deck, what is the probability that you have drawn an odd number of clubs? [b]D.12 / L. 7[/b] Let $s(n)$ be the sum of the digits of $n$. Let $g(n)$ be the number of times s must be applied to n until it has only $1$ digit. Find the smallest n greater than $2019$ such that $g(n) \ne g(n + 1)$. [b]D.13 / L. 8[/b] In the Montgomery Blair Meterology Tournament, individuals are ranked (without ties) in ten categories. Their overall score is their average rank, and the person with the lowest overall score wins. Alice, one of the $2019$ contestants, is secretly told that her score is $S$. Based on this information, she deduces that she has won first place, without tying with anyone. What is the maximum possible value of $S$? [b]D.14 / L. 9[/b] Let $A$ and $B$ be opposite vertices on a cube with side length $1$, and let $X$ be a point on that cube. Given that the distance along the surface of the cube from $A$ to $X$ is $1$, find the maximum possible distance along the surface of the cube from $B$ to $X$. [b]D.15[/b] A function $f$ with $f(2) > 0$ satisfies the identity $f(ab) = f(a) + f(b)$ for all $a, b > 0$. Compute $\frac{f(2^{2019})}{f(23)}$. PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and L10,16-30 [url=https://artofproblemsolving.com/community/c3h2790825p24541816]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Zoli wants to fill the given $4 \times 4$ table with the digits $1$, $2$, $3$ and $4$, such that in every row and column, and also in the diagonal going from the top left cell to the bottom right, each digit appears exactly once. What is the highest possible value of the sum of the digits in the six grey cells? [img]https://cdn.artofproblemsolving.com/attachments/7/0/498e652cd7ce556d8a638f3d51b65b13154ee5.png[/img]

A "domino" is made up of two small squares: [asy] unitsize(12); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); draw((1,1)--(2,1)--(2,0)--(1,0)); [/asy] Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes? [asy] unitsize(12); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); fill((1,1)--(1,2)--(2,2)--(2,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle,black); fill((0,2)--(1,2)--(1,3)--(0,3)--cycle,black); fill((2,2)--(2,3)--(3,3)--(3,2)--cycle,black); draw((0,0)--(0,3)--(4,3)--(4,0)--cycle); draw((6,0)--(11,0)--(11,3)--(6,3)--cycle); fill((6,0)--(7,0)--(7,1)--(6,1)--cycle,black); fill((8,0)--(9,0)--(9,1)--(8,1)--cycle,black); fill((10,0)--(11,0)--(11,1)--(10,1)--cycle,black); fill((7,1)--(7,2)--(8,2)--(8,1)--cycle,black); fill((9,1)--(9,2)--(10,2)--(10,1)--cycle,black); fill((6,2)--(6,3)--(7,3)--(7,2)--cycle,black); fill((8,2)--(8,3)--(9,3)--(9,2)--cycle,black); fill((10,2)--(10,3)--(11,3)--(11,2)--cycle,black); draw((13,-1)--(13,3)--(17,3)--(17,-1)--cycle); fill((13,3)--(14,3)--(14,2)--(13,2)--cycle,black); fill((15,3)--(16,3)--(16,2)--(15,2)--cycle,black); fill((14,2)--(15,2)--(15,1)--(14,1)--cycle,black); fill((16,2)--(17,2)--(17,1)--(16,1)--cycle,black); fill((13,1)--(14,1)--(14,0)--(13,0)--cycle,black); fill((15,1)--(16,1)--(16,0)--(15,0)--cycle,black); fill((14,0)--(15,0)--(15,-1)--(14,-1)--cycle,black); fill((16,0)--(17,0)--(17,-1)--(16,-1)--cycle,black); draw((19,3)--(24,3)--(24,-1)--(19,-1)--cycle,black); fill((19,3)--(20,3)--(20,2)--(19,2)--cycle,black); fill((21,3)--(22,3)--(22,2)--(21,2)--cycle,black); fill((23,3)--(24,3)--(24,2)--(23,2)--cycle,black); fill((20,2)--(21,2)--(21,1)--(20,1)--cycle,black); fill((22,2)--(23,2)--(23,1)--(22,1)--cycle,black); fill((19,1)--(20,1)--(20,0)--(19,0)--cycle,black); fill((21,1)--(22,1)--(22,0)--(21,0)--cycle,black); fill((23,1)--(24,1)--(24,0)--(23,0)--cycle,black); fill((20,0)--(21,0)--(21,-1)--(20,-1)--cycle,black); fill((22,0)--(23,0)--(23,-1)--(22,-1)--cycle,black); draw((26,3)--(29,3)--(29,-3)--(26,-3)--cycle); fill((26,3)--(27,3)--(27,2)--(26,2)--cycle,black); fill((28,3)--(29,3)--(29,2)--(28,2)--cycle,black); fill((27,2)--(28,2)--(28,1)--(27,1)--cycle,black); fill((26,1)--(27,1)--(27,0)--(26,0)--cycle,black); fill((28,1)--(29,1)--(29,0)--(28,0)--cycle,black); fill((27,0)--(28,0)--(28,-1)--(27,-1)--cycle,black); fill((26,-1)--(27,-1)--(27,-2)--(26,-2)--cycle,black); fill((28,-1)--(29,-1)--(29,-2)--(28,-2)--cycle,black); fill((27,-2)--(28,-2)--(28,-3)--(27,-3)--cycle,black); [/asy] $\text{(A)}\ 3\times 4 \qquad \text{(B)}\ 3\times 5 \qquad \text{(C)}\ 4\times 4 \qquad \text{(D)}\ 4\times 5 \qquad \text{(E)}\ 6\times 3$

Let $\mathbb Z_{\ge 0}$ be the set of non-negative integers, and let $f:\mathbb Z_{\ge 0}\times \mathbb Z_{\ge 0} \to \mathbb Z_{\ge 0}$ be a bijection such that whenever $f(x_1,y_1) > f(x_2, y_2)$, we have $f(x_1+1, y_1) > f(x_2 + 1, y_2)$ and $f(x_1, y_1+1) > f(x_2, y_2+1)$. Let $N$ be the number of pairs of integers $(x,y)$ with $0\le x,y<100$, such that $f(x,y)$ is odd. Find the smallest and largest possible values of $N$.

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]

Some cells of a $10 \times 10$ are colored blue. A set of six cells is called [i]gremista[/i] when the cells are the intersection of three rows and two columns, or two rows and three columns, and are painted blue. Determine the greatest value of $n$ for which it is possible to color $n$ chessboard cells blue such that there is not a [i]gremista[/i] set.

The unit of a screw is listed as $0.2$ cents. When a group of screws is sold to a customer, the total cost of the screws is computed with the listed price and then rounded to the nearest cent. If Al has $50$ cents and wishes to only make one purchase, what is the maximum possible number of screws he can buy?

16 cities attend a football match. Each city has two teams: A and B. According to the rule, each team can compete with any other team of other cities at most once. After a few days, we find that except team A of city 1, the number of matches they've played are different. Then, how many matches have team A of city 1 played?