Let $A'$ and $B'$ be feet of altitudes from $A$ and $B$, respectively, in acute-angled triangle $ABC$ ($AC\not = BC$). Circle $k$ contains points $A'$ and $B'$ and touches segment $AB$ in $D$. If triangles $ADA'$ and $BDB'$ have the same area, prove that \[\angle A'DB'= \angle ACB.\]

In a triangle $ABC, L$ and $K$ are the points of intersections of the angle bisectors of $\angle ABC$ and $\angle BAC$ with the segments $AC$ and $BC$, respectively. The segment $KL$ is angle bisector of $\angle AKC$, determine $\angle BAC$.

Given is $\triangle ABC$ such that $\angle A = 57^o, \angle B = 61^o$ and $\angle C = 62^o$. Which segment is longer: the angle bisector through $A$ or the median through $B$? (N.Beluhov)

Evaluate $ \int_0^1 \frac{x\minus{}e^{2x}}{x^2\minus{}e^{2x}}dx$.

Find the triangle of the least area which can cover any triangle with sides not exceeding $1$.

Players $A$ and $B$ play a "paintful" game on the real line. Player $A$ has a pot of paint with four units of black ink. A quantity $p$ of this ink suffices to blacken a (closed) real interval of length $p$. In every round, player $A$ picks some positive integer $m$ and provides $1/2^m $ units of ink from the pot. Player $B$ then picks an integer $k$ and blackens the interval from $k/2^m$ to $(k+1)/2^m$ (some parts of this interval may have been blackened before). The goal of player $A$ is to reach a situation where the pot is empty and the interval $[0,1]$ is not completely blackened. Decide whether there exists a strategy for player $A$ to win in a finite number of moves.

William is thinking of an integer between 1 and 50, inclusive. Victor can choose a positive integer $m$ and ask William: "does $m$ divide your number?", to which William must answer truthfully. Victor continues asking these questions until he determines William's number. What is the minimum number of questions that Victor needs to guarantee this?

Yuri and Vlad are playing a game on the table $4 \times 100$. Firstly, Yuri chooses $73$ squares $2 \times 2$ (squares can intersect, but cannot be equal). Then Vlad colours the cells of the table in $4$ colours such that in any row and in any column, and in any square chosen by Yuri, there were cells of all 4 colours. After that Vlad pays 2 rubles for every square $2 \times 2$, not chosen by Yuri, which cells of all 4 colours. What is the maximum possible number of rubles Yuri can get regardless of Vlad's actions [i]M. Shutro[/i]

Find the maximal possible $n$, where $A_1, \dots, A_n \subseteq \{1, 2, \dots, 2016\}$ satisfy the following properties. - For each $1 \le i \le n$, $\lvert A_i \rvert = 4$. - For each $1 \le i < j \le n$, $\lvert A_i \cap A_j \rvert$ is even.

A lightly damaged rook moves around on a $m \times n$ chessboard by taking turns moves to a horizontal or vertical field. For which $m$ and $n$, is it possible for him to have visited each field exactly once? The starting field counts as visited, squares skipped during a move, however, are not.

A "domino" is made up of two small squares: [asy] unitsize(10); draw((0,0) -- (2,0) -- (2,1) -- (0,1) -- cycle); fill((0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle); [/asy] Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes? [diagram requires in-line asy]

Let $f, g:\mathbb{N}\to\mathbb{N}$ be functions that satisfy the following equation: \[f(f(n))+g(f(n)) = n,\ \forall\ n\in\mathbb{N}\ .\] Prove that $g$ is the zero function on $\mathbb{N}$.

Let $n$ be a positive integer. A \emph{pseudo-Gangnam Style} is a dance competition between players $A$ and $B$. At time $0$, both players face to the north. For every $k\ge 1$, at time $2k-1$, player $A$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $B$ is forced to follow him; at time $2k$, player $B$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $A$ is forced to follow him. After time $n$, the music stops and the competition is over. If the final position of both players is north or east, $A$ wins. If the final position of both players is south or west, $B$ wins. Determine who has a winning strategy when: (a) $n=2013^{2012}$ (b) $n=2013^{2013}$

Let $\xi_1 , \xi_2 , ...$ be a series of independent, zero-expected-value random variables for which $\lim_{n\to\infty} E(\xi_n ^ 2) = 0$, and $S_n = \sum_{j = 1}^n \xi_j$ . Denote by I(A) the indicator function of event A. Prove that $$\frac{1}{\log n} \sum_{k = 1}^n \frac1k I\bigg(\max_{1\leq j\leq k} |S_j|>\sqrt k\bigg) \to 0$$ with probability 1 if $n\to\infty$ .

Michael plays catcher for his school's baseball team. He has always been a great player behind the plate, but this year as a junior, Michael's offense is really improving. His batting average is $.417$ after six games, and the team is $6-0$ (six wins and no losses). They are off to their best start in years. On the way home from their sixth game, Michael notes to his father that the attendance seems to be increasing due to the team's great start, "There were $181$ people at the first game, then $197$ at the second, $203$ the third, $204$ the fourth, $212$ at the fifth, and there were $227$ at today's game." Just then, Michael's genius younger brother Tony, just seven-years-old, computes the average attendance of the six games. What is their average?

What minimum number of colours is sufficient to colour all positive real numbers so that every two numbers whose ratio is 4 or 8 have different colours?

A pair of standard 6-sided fair dice is rolled once. The sum of the numbers rolled determines the diameter of a circle. What is the probability that the numerical value of the area of the circle is less than the numerical value of the circle's circumference? $ \textbf{(A)}\ \frac{1}{36} \qquad \textbf{(B)}\ \frac{1}{12} \qquad \textbf{(C)}\ \frac{1}{6} \qquad \textbf{(D)}\ \frac{1}{4} \qquad \textbf{(E)}\ \frac{5}{18} $

Natural numbers from $1$ to $99$ (not necessarily distinct) are written on $99$ cards. It is given that the sum of the numbers on any subset of cards (including the set of all cards) is not divisible by $100$. Show that all the cards contain the same number.

$\boxed{\text{A4}}$ Let $x,y$ be positive reals satisfying the condition $x^3+y^3\leq x^2+y^2$.Find the maximum value of $xy$.

Let $\triangle ABC$ be a triangle such that $AB=5,AC=8,$ and $\angle BAC=60^{\circ}$. Let $\Gamma$ denote the circumcircle of $ABC$, and let $I$ and $O$ denote the incenter and circumcenter of $\triangle ABC$, respectively. Let $P$ be the intersection of ray $IO$ with $\Gamma$, and let $X$ be the intersection of ray $BI$ with $\Gamma$. If the area of quadrilateral $XICP$ can be expressed as $\frac{a\sqrt{b}+c\sqrt{d}}{e}$, where $a$ and $d$ are squarefree positive integers and $\gcd(a,c,e)=1$, compute $a+b+c+d+e$.

The radius of the circle inscribed in triangle $ABC$ is equal to $r$. This circle is tangent to $BC$ at point $M$ and divides the segment $AM$ in ratio $k$ (starting from vertex $A$). Find the sum of the radii of the circles inscribed in triangles $AMB$ and $AMC$.

[u]Round 5[/u] [b]p13.[/b] A unit square is rotated $30^o$ counterclockwise about one of its vertices. Determine the area of the intersection of the original square with the rotated one. [b]p14.[/b] Suppose points $A$ and $B$ lie on a circle of radius $4$ with center $O$, such that $\angle AOB = 90^o$. The perpendicular bisectors of segments $OA$ and $OB$ divide the interior of the circle into four regions. Find the area of the smallest region. [b]p15.[/b] Let $ABCD$ be a quadrilateral such that $AB = 4$, $BC = 6$, $CD = 5$, $DA = 3$, and $\angle DAB = 90^o$. There is a point $I$ inside the quadrilateral that is equidistant from all the sides. Find $AI$. [u]Round 6[/u] [i]The answer to each of the three questions in this round depends on the answer to one of the other questions. There is only one set of correct answers to these problems; however, each question will be scored independently, regardless of whether the answers to the other questions are correct. [/i] [b]p16.[/b] Let $C$ be the answer to problem $18$. Compute $$\left( 1 - \frac{1}{2^2} \right) \left( 1 - \frac{1}{3^2} \right) ... \left( 1 - \frac{1}{C^2} \right).$$ [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $PQRS$ be a square, and let point $M$ lie on segment $PQ$ such that $MQ = 7PM$ and point $N$ lie on segment $PS$ such that $NS = 7PN$. Segments $MS$ and $NQ$ meet at point $X$. Given that the area of quadrilateral $PMXN$ is $A - \frac12$, find the side length of the square. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $N = 6B$. Find the number of ordered triples $(a, b, c)$ of integers between $0$ and $N - 1$, inclusive, such that $a + b + c$ is divisible by $N$. [u]Round 7[/u] [b]p19.[/b] Let $k$ be the units digit of $\underbrace{7^{7^{7^{7^{7^{7^{7}}}}}}}_{Seven \,\,7s}$ . What is the largest prime factor of the number consisting of $k$ $7$’s written in a row? [b]p20.[/b] Suppose that $E = 7^7$ , $M = 7$, and $C = 7·7·7$. The characters $E, M, C, C$ are arranged randomly in the following blanks. $$... \times ... \times ... \times ... $$ Then one of the multiplication signs is chosen at random and changed to an equals sign. What is the probability that the resulting equation is true? [b]p21[/b]. During a recent math contest, Sophy Moore made the mistake of thinking that $133$ is a prime number. Fresh Mann replied, “To test whether a number is divisible by $3$, we just need to check whether the sum of the digits is divisible by $3$. By the same reasoning, to test whether a number is divisible by $7$, we just need to check that the sum of the digits is a multiple of $7$, so $133$ is clearly divisible by $7$.” Although his general principle is false, $133$ is indeed divisible by $7$. How many three-digit numbers are divisible by $7$ and have the sum of their digits divisible by $7$? [u]Round 8[/u] [b]p22.[/b] A [i]look-and-say[/i] sequence is defined as follows: starting from an initial term $a_1$, each subsequent term $a_k$ is found by reading the digits of $a_{k-1}$ from left to right and specifying the number of times each digit appears consecutively. For example, $4$ would be succeeded by $14$ (“One four.”), and $31337$ would be followed by $13112317$ (“One three, one one, two three, one seven.”) If $a_1$ is a random two-digit positive integer, find the probability that $a_4$ is at least six digits long. [b]p23.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$, and $\angle BIP = \angle PBI = \angle CAB$. If $\frac{AP}{BC} = k$, express $\frac{IP}{CP}$ in terms of $k$. [b]p24.[/b] A subset of $\{1, 2, 3, ... , 30\}$ is called [i]delicious [/i] if it does not contain an element that is $3$ times another element. A subset is called super delicious if it is delicious and no delicious set has more elements than it has. Determine the number of super delicious subsets. PS. You sholud use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Julia has $289$ coins stored in boxes: All the boxes contain the same number of coins (which is greater than $1$) and in each box there are coins from the same country, The coins from Bolivia are more than $6\%$ of the total, those from Chile are more than $12\%$ of the total, those of Mexico are more than $24\% $of the total and those of Peru more than $36\%$ of the total. Can Julia have any coins from Uruguay?

How many distinct permutations of the letters in the word REDDER are there that do not contain a palindromic substring of length at least two? (A [i]substring[/i] is a continuous block of letters that is part of the string. A string is [i]palindromic[/i] if it is the same when read backwards.)

Let $ABC$ be an isosceles triangle with $AB=AC$. On the extension of the side ${CA}$ we consider the point ${D}$ such that ${AD<AC}$. The perpendicular bisector of the segment ${BD}$ meets the internal and the external bisectors of the angle $\angle BAC$ at the points ${E}$and ${Z}$, respectively. Prove that the points ${A, E, D, Z}$ are concyclic.