MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations. (1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.) (2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?

At a competition with $N$ players, the number of players given elite status is equal to \[2^{1+\lfloor\log_2{(N-1)}\rfloor} - N. \] Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$? $ \textbf{(A)}\ 38\qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$

Let $ ABC$ be an acute triangle with the incircle $ C(I,r)$ and the circumcircle $ C(O,R)$ . Denote $ D\in BC$ for which $ AD\perp BC$ and $ AD \equal{} h_a$ . Prove that $ DI^2 \equal{} (2R \minus{} h_a)(h_a \minus{} 2r)$ .

Let $g_0 = 1$, $g_1 = 2$, $g_2 = 3$, and $g_n = g_{n-1} + 2g_{n-2} + 3g_{n-3}$. For how many $0 \le i \le 100$ is it that $g_i$ is divisible by $5$?

Let $P(x)$ be a quadratic polynomial with two distinct real roots. For all real numbers $a$ and $b$ satisfying $|a|,|b| \ge 2017$, we have $P(a^2+b^2) \ge P(2ab)$. Show that at least one of the roots of $P$ is negative.

[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f: \mathbb{Q} \to \mathbb{R}$ such that $f(xy)=f(x)f(y)+f(x+y)-1$ for all rationals $x,y$

There are $n\ge 2$ lamps, each with two states: $\textbf{on}$ or $\textbf{off}$. For each non-empty subset $A$ of the set of these lamps, there is a $\textit{soft-button}$ which operates on the lamps in $A$; that is, upon $\textit{operating}$ this button each of the lamps in $A$ changes its state(on to off and off to on). The buttons are identical and it is not known which button corresponds to which subset of lamps. Suppose all the lamps are off initially. Show that one can always switch all the lamps on by performing at most $2^{n-1}+1$ operations.

In a acute triangle $ABC$, the median, $AM$, is longer than side $AB$. Prove that you can cut triangle $ABC$ into $3$ parts out of which you can construct a rhombus.

If $ x < a < 0$ means that $ x$ and $ a$ are numbers such that $ x$ is less than $ a$ and $ a$ is less than zero, then: $ \textbf{(A)}\ x^2 < ax < 0 \qquad\textbf{(B)}\ x^2 > ax > a^2 \qquad\textbf{(C)}\ x^2 < a^2 < 0$ $ \textbf{(D)}\ x^2 > ax\text{ but }ax < 0 \qquad\textbf{(E)}\ x^2 > a^2\text{ but }a^2 < 0$

For a natural number $n>1$ , consider the $n-1$ points on the unit circle $e^{\frac{2\pi ik}{n}}\ (k=1,2,...,n-1) $ . Show that the product of the distances of these points from $1$ is $n$.

For every n = 2; 3; : : : , we put $$A_n = \left(1 - \frac{1}{1+2}\right) X \left(1 - \frac{1}{1+2+3}\right)X \left(1 - \frac{1}{1+2+3+...+n}\right) $$ Determine all positive integer $ n (n \geq 2)$ such that $\frac{1}{A_n}$ is an integer.

Let $n \geq 4$ be a natural and let $x_1,\ldots,x_n$ be non-negative reals such that $x_1 + \cdots + x_n = 1$. Determine the maximum value of $x_1x_2x_3 + x_2x_3x_4 + \cdots + x_nx_1x_2$.

Four siblings are sitting down to eat some mashed potatoes for lunch: Ethan has 1 ounce of mashed potatoes, Macey has 2 ounces, Liana has 4 ounces, and Samuel has 8 ounces. This is not fair. A blend consists of choosing any two children at random, combining their plates of mashed potatoes, and then giving each of those two children half of the combination. After the children's father performs four blends consecutively, what is the probability that the four children will all have the same amount of mashed potatoes?

What can angle $B$ of triangle $ABC$ be equal to if it is known that the distance between the feet of the altitudes drawn from vertices $A$ and $C$ is equal to half the radius of the circle circumscribed around this triangle?

Let $a, b, c$ be positive real numbers. Prove the inequality $(a^2+ac+c^2) \left( \frac{1}{a+b+c}+\frac{1}{a+c} \right)+b^2 \left( \frac{1}{b+c}+\frac{1}{a+b} \right)>a+b+c$. [i]Proposed by Tajikistan[/i]