An acute triangle has unit area. Show that there is a point inside the triangle whose distance from each of the vertices is at least $\frac{2}{\sqrt[4]{27}}$.

Each face of a regular tetrahedron with edge length $2011$ is divided into $2011^2$ equilateral triangles of side length $1$, created by drawing lines parallel to each edge. Bruno and Mariano take turns marking one of the unit triangles. Except for the first move, every triangle marked must share at least one point with the triangle marked in the previous move. Bruno plays first. The game ends when a player cannot make a move, and that player loses. Determine which of the two players has a winning strategy and describe the strategy.

[b]6.1 / 7.1[/b] There are $8$ rooks on the chessboard such that no two of them they don't hit each other. Prove that the black squares contain an even number of rooks. [b]6.2 [/b] The natural numbers are arranged in a $3 \times 3$ table. Kolya and Petya crossed out 4 numbers each. It turned out that the sum of the numbers crossed out by Petya is three times the sum numbers crossed out by Kolya. What number is left uncrossed? $$\begin{tabular}{|c|c|c|}\hline 4 & 12 & 8 \\ \hline 13 & 24 & 14 \\ \hline 7 & 5 & 23 \\ \hline \end{tabular} $$ [b]6.3 [/b] Misha and Sasha left at noon on bicycles from city A to city B. At the same time, I left from B to A Vanya. All three travel at constant but different speeds. At one o'clock Sasha was exactly in the middle between Misha and Vanya, and at half past one Vanya was in the middle between Misha and Sasha. When Misha will be exactly in the middle between Sasha and Vanya? [b]6.4[/b] There are $35$ piles of nuts on the table. Allowed to add one nut at a time to any $23$ piles. Prove that by repeating this operation, you can equalize all the heaps. [b]6.5[/b] There are $64$ vertical stripes on the round drum, and each stripe you need to write down a six-digit number from digits $1$ and $2$ so that all the numbers were different and any two adjacent ones differed in exactly one discharge. How to do this? [b]6.6 / 7.6[/b] Two brilliant mathematicians were told in natural terms number and were told that these numbers differ by one. After that they take turns asking each other the same question: “Do you know my number?" Prove that sooner or later one of them will answer positively. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988085_1969_leningrad_math_olympiad]here[/url].

Construct for the triangle $ABC$ a circle $S$ passing through the point $B$ and touching the line $CA$ at the point $A$, a circle $T$ passing through the point $C$ and touches the line $BA$ at the point $A$. The second intersection point of the circles $S$ and $T$ is denoted by $D$. The intersection point of the line $AD$ and the circumscribed circle $\Delta ABC$ is denoted by $E$. Prove that $D$ is the midpoint of the segment $AE$.

Compute $$\lim \limits_{n \to \infty}\frac{1}{n}\sum \limits_{k=1}^n\frac{\sqrt[n+k+1]{n+1}-\sqrt[n+k]{n}}{\sqrt[n+k]{n+1}-\sqrt[n+k]{n}}$$

Let $E \subset [0,1]$ be a Lebesgue measurable set having Lebesgue measure $| E |<\frac{1}{2}$. Let $$h (s) = \int _ {\overline {E}} \frac{dt}{{(s-t)}^2}$$ where $\overline {E} = [0,1] \backslash E$. Prove that there is one $t \in \overline {E}$ for which $$\int_E \frac {ds} {h (s) {(s-t)} ^ 2} \leq c {| E |} ^ 2$$ with some absolute constant c .

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Friends Alice, Betty, and Cathy are playing a game. Betty and Cathy are each given a square number, such that Betty knows Cathy's number and Cathy knows Betty's, but neither of them know their own. Alice then says: "The sum of the numbers is less than 100." Betty says: "If Cathy knew the number of possibilities for my number, she would know her own." Cathy then says: "Now I know my number." What is Cathy's number? $\textbf{(A) }16\qquad\textbf{(B) }25\qquad\textbf{(C) }36\qquad\textbf{(D) }49\qquad\textbf{(E) }64$

Set \[A_n=\sum_{k=1}^n \frac{k^6}{2^k}.\] Find $\lim_{n\to\infty} A_n.$

Let $S$ denote the set of fractions $\dfrac mn$ for relatively prime positive integers $m$ and $n$ with $m+n\le 10000$. The least fraction in $S$ that is strictly greater than \[\prod_{i=0}^\infty \left(1-\dfrac{1}{10^{2i+1}}\right)\] can be expressed in the form $\dfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $1000p+q$. [i]Proposed by James Lin[/i]

Baron Munchausen has a set of $50$ coins. The mass of each is a distinct positive integer not exceeding $100$, and the total mass is even. The Baron claims that it is not possible to divide the coins into two piles with equal total mass. Can the Baron be right?

Let $\Omega$ be a circle, and let $A$, $B$, $C$, $D$ and $K$ be distinct points on it, in that order, and such that lines $BC$ and $AD$ are parallel. Let $A'\neq A$ be a point on line $AK$ such that $BA=BA'$. Similarly, let $C'\neq C$ be a point on line $CK$ such that $DC=DC'$. Prove that segments $AC$ and $A'C'$ have the same length.

Find all integers $ b$ and $ c$ such that the equation $ x^2 - bx + c = 0$ has two real roots $ x_1, x_2$ satisfying $ x_1^2 + x_2^2 = 5$.

The two squares shown share the same center $O$ and have sides of length 1. The length of $\overline{AB}$ is $43/99$ and the area of octagon $ABCDEFGH$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ [asy] real alpha = 25; pair W=dir(225), X=dir(315), Y=dir(45), Z=dir(135), O=origin; pair w=dir(alpha)*W, x=dir(alpha)*X, y=dir(alpha)*Y, z=dir(alpha)*Z; draw(W--X--Y--Z--cycle^^w--x--y--z--cycle); pair A=intersectionpoint(Y--Z, y--z), C=intersectionpoint(Y--X, y--x), E=intersectionpoint(W--X, w--x), G=intersectionpoint(W--Z, w--z), B=intersectionpoint(Y--Z, y--x), D=intersectionpoint(Y--X, w--x), F=intersectionpoint(W--X, w--z), H=intersectionpoint(W--Z, y--z); dot(O); label("$O$", O, SE); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); label("$D$", D, dir(O--D)); label("$E$", E, dir(O--E)); label("$F$", F, dir(O--F)); label("$G$", G, dir(O--G)); label("$H$", H, dir(O--H));[/asy]

Let $S = \{1, 2, \ldots, n\}$ for some positive integer $n$, and let $A$ be an $n$-by-$n$ matrix having as entries only ones and zeroes. Define an infinite sequence $\{x_i\}_{i \ge 0}$ to be [i]strange[/i] if: [list] [*] $x_i \in S$ for all $i$, [*] $a_{x_kx_{k+1}} = 1$ for all $k$, where $a_{ij}$ denotes the element in the $i^{\text{th}}$ row and $j^{\text{th}}$ column of $A$. [/list] Prove that the set of strange sequences is empty if and only if $A$ is nilpotent, i.e. $A^m = 0$ for some integer $m$.

Point $P$ lies on the diagonal $AC$ of square $ABCD$ with $AP>CP$. Let $O_1$ and $O_2$ be the circumcenters of triangles $ABP$ and $CDP$ respectively. Given that $AB=12$ and $\angle O_1 P O_2 = 120^\circ$, then $AP=\sqrt{a}+\sqrt{b}$ where $a$ and $b$ are positive integers. Find $a+b$.

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

Evaluate the sum $$\sum_{n=0}^\infty\operatorname{arctan}\left(\frac1{1+n+n^2}\right).$$

Let $X$ be a point on the segment $[BC]$ of an equilateral triangle $ABC$ and let $Y$ and $Z$ be points on the rays $[BA$ and $[CA$ such that the lines $AX, BZ, CY$ are parallel. If the intersection of $XY$ and $AC$ is $M$ and the intersection of $XZ$ and $AB$ is $N$, prove that $MN$ is tangent to the incenter of $ABC$.

There are $2015$ points on a plane and no two distances between them are equal. We call the closest $22$ points to a point its $neighbours$. If $k$ points share the same neighbour, what is the maximum value of $k$?

Let $ABC$ be an acute triangle with $\angle B > \angle C$. On the circle $\mathcal{C}(O, R)$ circumscribed to this triangle points $D, E, J, K, S$ are chosen such that $A, E, J$ and $K$ are on the same side of the line $BC$, the diameter $DE$ is perpendicular on the chord $BC$, $S\in \overarc{EK},\overarc{AE}=\overarc{BJ}=\overarc{CK}=\dfrac{1}{4}\overarc{CE}$ . Let $\{F\}=AC\cap DE, \{M\}=BK\cap AD, \{P\}=BK\cap AC$ and $\{Q\}=CJ\cap BF$. If $\angle SMK =30^{\circ}$ and $\angle AQP = 90^{\circ}$, show that the line $MS$ is tangent to the circumscribed circle of triangle $AOF$.

Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.

Mr. Murgatroyd decides to throw his class a pizza party, but he's going to make them hunt for it first. He chooses eleven locations in the school, which we'll call $1, 2, \ldots, 11$. His plan is to tell students to start at location $1$, and at each location $n$ from $1$ to $10$, they will find a message directing them to go to location $n+1$; at location $11$, there's pizza! Mr. Murgatroyd sends his teaching assistant to post the ten messages in locations $1$ to $10$. Unfortunately, the assistant jumbles up the message cards at random before posting them. If the students begin at location $1$ as planned and follow the directions at each location, show that they will still get to the pizza.

Suppose two circles $\Omega_1$ and $\Omega_2$ with centers $O_1$ and $O_2$ have radii $3$ and $4$, respectively. Suppose that points $A$ and $B$ lie on circles $\Omega_1$ and $\Omega_2$, respectively, such that segments $AB$ and $O_1O_2$ intersect and that $AB$ is tangent to $\Omega_1$ and $\Omega_2$. If $O_1O_2=25$, find the area of quadrilateral $O_1AO_2B$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(12cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -12.81977592804657, xmax = 32.13023014338037, ymin = -14.185056097058798, ymax = 12.56855801985179; /* image dimensions */ /* draw figures */ draw(circle((-3.4277328104418046,-1.4524996726688195), 3), linewidth(1.2)); draw(circle((21.572267189558197,-1.4524996726688195), 4), linewidth(1.2)); draw((-2.5877328104418034,1.4275003273311748)--(20.452267189558192,-5.2924996726687885), linewidth(1.2)); /* dots and labels */ dot((-3.4277328104418046,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_1$", (-4.252707018231291,-1.545940604327141), N * labelscalefactor); dot((21.572267189558197,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_2$", (21.704189347819636,-1.250863978037686), NE * labelscalefactor); dot((-2.5877328104418034,1.4275003273311748),linewidth(3pt) + dotstyle); label("$A$", (-2.3937351324858342,1.6999022848568643), NE * labelscalefactor); dot((20.452267189558192,-5.2924996726687885),linewidth(3pt) + dotstyle); label("$B$", (20.671421155806545,-4.9885012443707835), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Deyuan Li and Andrew Milas[/i]