[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p, q$ be real numbers with $0 < p < q$ and let $t_1, t_2, \cdots, t_n$ be real numbers in the interval $[p, q]$. Denote by $A$ and $B$ the arithmetic means of $t_1, t_2, \cdots, t_n$ and of $t_1^2, t_2^2,\cdots , t_n^2$, respectively. Prove that \[\frac{A^2}{B}\ge\frac{4pq}{(p + q)^2}.\]

Let $n$ be a positive integer. $2n+1$ tokens are in a row, each being black or white. A token is said to be [i]balanced[/i] if the number of white tokens on its left plus the number of black tokens on its right is $n$. Determine whether the number of [i]balanced[/i] tokens is even or odd.

Let $ K$ be a point inside the triangle $ ABC$. Let $ M$ and $ N$ be points such that $ M$ and $ K$ are on opposite sides of the line $ AB$, and $ N$ and $ K$ are on opposite sides of the line $ BC$. Assume that $ \angle MAB \equal{} \angle MBA \equal{} \angle NBC \equal{} \angle NCB \equal{} \angle KAC \equal{} \angle KCA$. Show that $ MBNK$ is a parallelogram.

Let $ABCD$ be a quadrilateral inscribed in a circle $k$. $AC$ and $BD$ meet at $E$. The rays $\overrightarrow{CB}, \overrightarrow{DA}$ meet at $F$. Prove that the line through the incenters of $\triangle ABE\,,\, \triangle ABF$ and the line through the incenters of $\triangle CDE\,,\, \triangle CDF$ meet at a point lying on the circle $k$. [i]Proposed by N. Beluhov[/i]

Regular hexagon $P_1P_2P_3P_4P_5P_6$ has side length $2$. For $1 \le i \le 6$, let $C_i$ be a unit circle centered at $P_i$ and $\ell_i$ be one of the internal common tangents of $C_i$ and $C_{i+2}$, where $C_7 = C_1$ and $C_8 = C_2$. Assume that the lines $\{\ell_1, \ell_2, \ell_3, \ell_4, \ell_5,\ell_6\}$ bound a regular hexagon. The area of this hexagon can be expressed as $\sqrt{\frac{a}{b}}$, where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$.

Let $D$ be a point on the side $[AB]$ of the isosceles triangle $ABC$ such that $|AB|=|AC|$. The parallel line to $BC$ passing through $D$ intersects $AC$ at $E$. If $m(\widehat A) = 20^\circ$, $|DE|=1$, $|BC|=a$, and $|BE|=a+1$, then which of the followings is equal to $|AB|$? $ \textbf{(A)}\ 2a \qquad\textbf{(B)}\ a^2-a \qquad\textbf{(C)}\ a^2+1 \qquad\textbf{(D)}\ (a+1)^2 \qquad\textbf{(E)}\ a^2+a $

$x_1,x_2$ are two real roots of the equation $x^2-(k-2)x+(k^2+3k+5)=0$.What's the maximum value of $x_1^2+x_2^2$? $\text{(A)}19\qquad\text{(B)}18\qquad\text{(C)}5\frac{5}{9}\qquad\text{(D)}$Not exist

Let $P,Q,R$ be polynomials and let $S(x) = P(x^3) + xQ(x^3) + x^2R(x^3)$ be a polynomial of degree $n$ whose roots $x_1,\ldots, x_n$ are distinct. Construct with the aid of the polynomials $P,Q,R$ a polynomial $T$ of degree $n$ that has the roots $x_1^3 , x_2^3 , \ldots, x_n^3.$

A 3 × 3 grid of blocks is labeled from 1 through 9. Cindy paints each block orange or lime with equal probability and gives the grid to her friend Sophia. Sophia then plays with the grid of blocks. She can take the top row of blocks and move it to the bottom, as shown. 1 2 3 4 5 6 7 8 9 4 5 6 7 8 9 1 2 3 Grid A Grid A0 She can also take the leftmost column of blocks and move it to the right end, as shown. 1 2 3 4 5 6 7 8 9 2 3 1 5 6 4 8 9 7 Grid B Grid B0 Sophia calls the grid of blocks citrus if it is impossible for her to use a sequence of the moves described above to obtain another grid with the same coloring but a different numbering scheme. For example, Grid B is citrus, but Grid A is not citrus because moving the top row of blocks to the bottom results in a grid with a different numbering but the same coloring as Grid A. What is the probability that Sophia receives a citrus grid of blocks?

Let the real numbers $a,b,c,d$ satisfy the relations $a+b+c+d=6$ and $a^2+b^2+c^2+d^2=12.$ Prove that \[36 \leq 4 \left(a^3+b^3+c^3+d^3\right) - \left(a^4+b^4+c^4+d^4 \right) \leq 48.\] [i]Proposed by Nazar Serdyuk, Ukraine[/i]

The ruler of Laputa will set up a train network between cities in the state, which satisfies the following conditions: - [i]Uniformity[/i]: From one city to another, by train, possibly through exchanges. - [i]Prohibition N[/i]: There exist no four cities $A, B, C, D$ such that there are direct routes between $A$ and $B, B$ and $C$, and $C$ and $D$, but taking a shortcut is not possible, that is, there are no direct rout between $A$ and $C, B$ and $D$, or $A$ and $D$. In addition, a direct airliner connection will be established exactly between their city pairs, with no direct train connection. Prove that the airline network is not connected when there is more than one city.

Let $P_0=(a_0,b_0),P_1=(a_1,b_1),P_2=(a_2,b_2)$ be points on the plane such that $P_0P_1P_2\Delta$ contains the origin $O$. Show that the areas of triangles $P_0OP_1,P_0OP_2,P_1OP_2$ form a geometric sequence in that order if and only if there exists a real number $x$, such that $$ a_0x^2+a_1x+a_2=b_0x^2+b_1x+b_2=0 $$

Let $n>1$ be an integer. Given a simple graph $G$ on $n$ vertices $v_1, v_2, \dots, v_n$ we let $k(G)$ be the minimal value of $k$ for which there exist $n$ $k$-dimensional rectangular boxes $R_1, R_2, \dots, R_n$ in a $k$-dimensional coordinate system with edges parallel to the axes, so that for each $1\leq i<j\leq n$, $R_i$ and $R_j$ intersect if and only if there is an edge between $v_i$ and $v_j$ in $G$. Define $M$ to be the maximal value of $k(G)$ over all graphs on $n$ vertices. Calculate $M$ as a function of $n$.

Fix positive integers $n$ and $k\ge 2$. A list of $n$ integers is written in a row on a blackboard. You can choose a contiguous block of integers, and I will either add $1$ to all of them or subtract $1$ from all of them. You can repeat this step as often as you like, possibly adapting your selections based on what I do. Prove that after a finite number of steps, you can reach a state where at least $n-k+2$ of the numbers on the blackboard are all simultaneously divisible by $k$.

Find $f_n(x)$ such that $f_1(x)=x,\ f_n(x)=\int_0^x tf_{n-1}(x-t)dt\ (n=2,\ 3,\ \cdots).$

A singles tournament had six players. Each player played every other player only once, with no ties. If Helen won 4 games, Ines won 3 games, Janet won 2 games, Kendra won 2 games and Lara won 2 games, how many games did Monica win? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

The lateral surface of a cylinder of revolution is divided by $n-1$ planes parallel to the base and $m$ parallel generators into $mn$ cases $( n\ge 1,m\ge 3)$. Two cases will be called neighbouring cases if they have a common side. Prove that it is possible to write a real number in each case such that each number is equal to the sum of the numbers of the neighbouring cases and not all the numbers are zero if and only if there exist integers $k,l$ such that $n+1$ does not divide $k$ and \[ \cos \frac{2l\pi}{m}+\cos\frac{k\pi}{n+1}=\frac{1}{2}\] [i]Ciprian Manolescu[/i]

Let $\Gamma$ and $\Gamma'$ be two concentric circles. Let $ABC$ and $A'B'C'$ be any two equilateral triangles inscribed in $\Gamma$ and $\Gamma'$ respectively. If $P$ and $P'$ are any two points on $\Gamma$ and $\Gamma'$ respectively, show that \[ P'A^2 + P'B^2 + P'C^2 = A'P^2 + B'P^2 + C'P^2. \]

Let $f:[0,1] \to [0,1]$ a increasing continuous function, diferentiable in $(0,1)$ and with derivative smaller than 1 in every point. The sequence of sets $A_1,A_2,A_3,\dots$ is define as: $A_1 = f([0,1])$, and for $n \geq 2, A_n = f(A_{n-1}).$ Prove that $\displaystyle \lim_{n\to+\infty} d(A_n) = 0$, where $d(A)$ is the diameter of the set $A$. Note: The diameter of a set $X$ is define as $d(X) = \sup_{x,y\in X} |x-y|.$

Three circumferences are tangent to each other, as shown in the figure. The region of the outer circle that is not covered by the two inner circles has an area equal to $2 \pi$. Determine the length of the $PQ$ segment . [img]https://cdn.artofproblemsolving.com/attachments/a/e/65c08c47d4d20a05222a9b6cf65e84a25283b7.png[/img]

Asli will distribute $100$ candies among her brother and $18$ friends of him. Asli splits friends of her brother into several groups and distributes all the candies into these groups. In each group, the candies are shared in a fair way such that each child in a group takes same number of candies and this number is the largest possible. Then, Asli's brother takes the remaining candies of each group. At most how many candies can Asli's brother have? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 14 \qquad\textbf{(C)}\ 16 \qquad\textbf{(D)}\ 17 \qquad\textbf{(E)}\ 18 $

The distance from $A$ to $B$ is $d$ kilometres. A plane flying with the constant speed in the constant direction along and over the line $(AB)$ is being watched from those points. Observers have reported that the angle to the plane from the point $A$ has changed by $\alpha$ degrees and from $B$ --- by $\beta$ degrees within one second. What can be the minimal speed of the plane?

Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?

The $n$ contestant of EGMO are named $C_1, C_2, \cdots C_n$. After the competition, they queue in front of the restaurant according to the following rules. [list] [*]The Jury chooses the initial order of the contestants in the queue. [*]Every minute, the Jury chooses an integer $i$ with $1 \leq i \leq n$. [list] [*]If contestant $C_i$ has at least $i$ other contestants in front of her, she pays one euro to the Jury and moves forward in the queue by exactly $i$ positions. [*]If contestant $C_i$ has fewer than $i$ other contestants in front of her, the restaurant opens and process ends. [/list] [/list] [list=a] [*]Prove that the process cannot continue indefinitely, regardless of the Jury’s choices. [*]Determine for every $n$ the maximum number of euros that the Jury can collect by cunningly choosing the initial order and the sequence of moves. [/list]