Let $ABC$ be a triangle with $\angle{A} = 60^\circ$. The midperpendicular of segment $AB$ meets line $AC$ at point $C_1$. The midperpendicular of segment $AC$ meets line $AB$ at point $B_1$. Prove that line $B_1C_1$ touches the incircle of triangle $ABC$.

In triangle $ABC, AB=\sqrt{30}, AC=\sqrt{6},$ and $BC=\sqrt{15}.$ There is a point $D$ for which $\overline{AD}$ bisects $\overline{BC}$ and $\angle ADB$ is a right angle. The ratio \[ \frac{\text{Area}(\triangle ADB)}{\text{Area}(\triangle ABC)} \] can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

An ant craws along a closed route along the edges of a dodecahedron, never going backwards. Each edge of the route is passed exactly twice. Prove that one of the edges is passed both times in the same direction. (Dodecahedron has $12$ faces in the shape of pentagon, $30$ edges and $20$ vertices; each vertex emitting 3 edges). (8)

[u]Round 1[/u] [b]p1.[/b] Today, the date $4/9/16$ has the property that it is written with three perfect squares in strictly increasing order. What is the next date with this property? [b]p2.[/b] What is the greatest integer less than $100$ whose digit sumis equal to its greatest prime factor? [b]p3.[/b] In chess, a bishop can only move diagonally any number of squares. Find the number of possible squares a bishop starting in a corner of a $20\times 16$ chessboard can visit in finitely many moves, including the square it stars on. [u]Round 2 [/u] [b]p4.[/b] What is the fifth smallest positive integer with at least $5$ distinct prime divisors? [b]p5.[/b] Let $\tau (n)$ be the number of divisors of a positive integer $n$, including $1$ and $n$. Howmany positive integers $n \le 1000$ are there such that $\tau (n) > 2$ and $\tau (\tau (n)) = 2$? [b]p6.[/b] How many distinct quadratic polynomials $P(x)$ with leading coefficient $1$ exist whose roots are positive integers and whose coefficients sum to $2016$? [u]Round 3[/u] [b]p7.[/b] Find the largest prime factor of $112221$. [b]p8.[/b] Find all ordered pairs of positive integers $(a,b)$ such that $\frac{a^2b^2+1}{ab-1}$ is an integer. [b]p9.[/b] Suppose $f : Z \to Z$ is a function such that $f (2x)= f (1-x)+ f (1-x)$ for all integers $x$. Find the value of $f (2) f (0) +f (1) f (6)$. [u]Round 4[/u] [b]p10.[/b] For any six points in the plane, what is the maximum number of isosceles triangles that have three of the points as vertices? [b]p11.[/b] Find the sum of all positive integers $n$ such that $\sqrt{n+ \sqrt{n -25}}$ is also a positive integer. [b]p12.[/b] Distinct positive real numbers are written at the vertices of a regular $2016$-gon. On each diagonal and edge of the $2016$-gon, the sum of the numbers at its endpoints is written. Find the minimum number of distinct numbers that are now written, including the ones at the vertices. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3158474p28715078]here[/url]. and 9-12 [url=https://artofproblemsolving.com/community/c3h3162282p28763571]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Zscoder has an simple undirected graph $G$ with $n\ge 3$ vertices. Navi labels a positive integer to each vertex, and places a token at one of the vertex. This vertex is now marked red. In each turn, Zscoder plays with following rule: $\bullet$ If the token is currently at vertex $v$ with label $t$, then he can move the token along the edges in $G$ (possibly repeating some edges) exactly $t$ times. After these $t$ moves, he marks the current vertex red where the token is at if it is unmarked, or does nothing otherwise, then finishes the turn. Zscoder claims that he can mark all vertices in $G$ red after finite number of turns, regardless of Navi's labels and starting vertex. What is the minimum number of edges must $G$ have, in terms of $n$? [i]Proposed by Yeoh Zi Song[/i]

Define that $x*y=ax+by+cxy$ for all real numbers $x,y$, where $a,b,c$ are uncertain. It is known that $1*2=3,2*3=4$. If there exists a real number $d$, for any real number $x$, $x*d=x$, then $d=$________.

Let $f: N \to N$ be a function satisfying the following: $\bullet$ $f(ab) = f(a)f(b)$, whenever the greatest common divisor of $a$ and $b$ is $1$. $\bullet$ $f(p + q) = f(p)+ f(q)$ whenever $p$ and $q$ are primes. Determine all possible values of $f(2002)$. Justify your answers.

An isosceles trapezoid with bases $a$ and $c$ and altitude $h$ is given. a) On the axis of symmetry of this trapezoid, find all points $P$ such that both legs of the trapezoid subtend right angles at $P$; b) Calculate the distance of $p$ from either base; c) Determine under what conditions such points $P$ actually exist. Discuss various cases that might arise.

Let $ABCD$ be a convex quadrilateral, with $\angle BAC=\angle DAC$ and $M$ a point inside such that $\angle MBA=\angle MCD$ and $\angle MBC=\angle MDC$. Show that the angle $\angle ADC$ is equal to $\angle BMC$ or $\angle AMB$.

In the following diagram (not to scale), $A$, $B$, $C$, $D$ are four consecutive vertices of an 18-sided regular polygon with center $O$. Let $P$ be the midpoint of $AC$ and $Q$ be the midpoint of $DO$. Find $\angle OPQ$ in degrees. [asy] pathpen = rgb(0,0,0.6)+linewidth(0.7); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pen dd = rgb(0,0,0.6)+ linewidth(0.7) + linetype("4 4"); real n = 10, start = 360/n*6-15; pair O=(0,0), A=dir(start), B=dir(start+360/n), C=dir(start+2*360/n), D=dir(start+3*360/n), P=(A+C)/2, Q=(O+D)/2; D(D("O",O,NE)--D("A",A,W)--D("B",B,SW)--D("C",C,S)--D("D",D,SE)--O--D("P",P,1.6*dir(95))--D("Q",Q,NE)); D(A--C); D(A--(A+dir(start-360/n))/2, dd); D(D--(D+dir(start+4*360/n))/2, dd); [/asy]

Ten closed intervals, each of length $1$, are placed in the interval $[0,4]$. Show that there is a point in the larger interval that belongs to at least four of the smaller intervals.

A word is a sequence of capital letters of our alphabet (that is, there are 26 possible letters). A word is called palindrome if has at least two letters and is spelled the same forward and backward. For example, the words "ARARA" e "NOON" are palindromes, but the words "ESMERALDA" and "A" are not palindromes. We say that a word $x$ contains a word $y$ if there are consecutive letters of $x$ that together form the word $y$. For example, the word "ARARA" contains the word "RARA" and also the word "ARARA", but doesn't contain the word "ARRA". Compute the number of words of 14-letter that contain some palindrome.

For real numbers $x$ and $y$ we define $M(x, y)$ to be the maximum of the three numbers $xy$, $(x- 1)(y - 1)$, and $x + y - 2xy$. Determine the smallest possible value of $M(x, y)$ where $x$ and $y$ range over all real numbers satisfying $0 \le x, y \le 1$.

Let $BC$ be a chord of a circle $\Gamma$ and $A$ be a point inside $\Gamma$ such that $\angle BAC$ is acute. Outside $\triangle ABC$, construct two isosceles triangles $\triangle ACP$ and $\triangle ABR$ such that $\angle ACP$ and $\angle ABR$ are right angles. Let lines $BA$ and $CA$ meet $\Gamma$ again at points $E$ and $F$, respectively. Let lines $EP$ and $FR$ meet $\Gamma$ again at points $X$ and $Y$, respectively. Prove that $BX=CY$.

Consider an equilateral triangle and square, both with area $1$. What is the product of their perimeters?

A positive integer is called [i]lonely [/i] if the sum of the inverses of its positive divisors (including $1$ and itself) is not equal with the some of the inverses of the positive divisors of any other positive integer. a) Show that any prime number is lonely. b) Prove that there are infinitely many numbers that are not lonely

Find all pairs of positive integers \(a, b\) such that the numbers \(a+1\), \(b+1\), \(2a+1\), \(2b+1\), \(a+3b\), and \(b+3a\) are all prime numbers.

Let $n$ be an integer. If the tens digit of $n^2$ is 7, what is the units digit of $n^2$?

Let's say a language $L \subseteq \{0,1\}^*$ is in $\textbf{P}_{angel}$ if there exists a polynomial $p : \mathbb{N} \mapsto \mathbb{N}$, a sequence of strings $\{\alpha_n\}_{n \in \mathbb{N}}$ with $\alpha_n \in \{0,1\}^{p(n)}$, and a deterministic polynomial time Turing Machine $M$ such that for every $x \in \{0,1\}^n$ $$x \in L \Leftrightarrow M(x, \alpha_n) = 1$$ Let us call $\alpha_n$ to be the [i]angel string [/i]for all $x$ of the length $n$. Note that the [i]angel string[/i] is $\textbf{not}$ similar to a [i]witness[/i] or [i]certificate [/i]as used in the definition of $\textbf{NP}$ For example, all unary languages, even $UHALT$ which is undecidable, are in $\textbf{P}_{angel}$ because the \textit{angel string} can simply be a single bit that tells us if the given unary string is in $UHALT$ or not. \\\\ A set $S \subseteq \Sigma^*$ is said to be [b]sparse[/b] if there exists a polynomial $p : \mathbb{N} \mapsto \mathbb{N}$ such that for each $n \in \mathbb{N}$, the number of strings of length $n$ in $S$ is bounded by $p(n)$. In other words, $|S^{=n}| \leq p(n)$, where $S^{=n} \subseteq S$ contains all the strings in $S$ that are of length $n$. [list=1] [*] Given $k \in \mathbb{N}$ sparse sets $S_1, S_2 \ldots S_k$, show that there exists a sparse set $S$ and a deterministic polynomial time TM $M$ with oracle access to $S$ such that given an input $\langle x,i \rangle$ the TM $M$ will accept it if and only if $x \in S_i$. \\Define the set $S$ (note that it need not be computable), and give the description of $M$ with oracle $S$. \\Note that a TM $M$ with oracle access to $S$ can query whether $s \in S$ and get the correct answer in return in constant time. [/*] [*] Let us define a variant of $\textbf{P}_{angel}$ called $\textbf{P}_{bad-angel}$ with a constraint that there should exists a polynomial time algorithm that can [b]compute[/b] the angel string for any length $n \in \mathbb{N}$. In other words, there is a poly-time algorithm $A$ such that $\alpha_n = A(n)$. \\Is $\textbf{P} =\textbf{P}_{bad-angel}$? Is $\textbf{NP}=\textbf{P}_{bad-angel}$? Justify. [/*] [*] Let the language $L \in$ $\textbf{P}_{angel}$. Show that there exists a sparse set $S_L$ and a deterministic polynomial time TM $M$ with oracle access to $S_L$ that can decide the language $L$. [/*]

Each number from the set $\{1,2,3,4,5,6,7,8\}$ is either colored red or blue, following these rules: a) The number $4$ is colored red, and there is at least one number colored blue. b) If two numbers $x, y$ have different colors and $x + y \leq 8$, then the number $x + y$ is colored blue. c) If two numbers $x, y$ have different colors and $x \cdot y \leq 8$, then the number $x \cdot y$ is colored red. Find all possible ways the numbers from this set can be colored.

If $n\geqslant 3$ is an integer and $a_1,a_2,\dotsc ,a_n$ are non-zero integers such that $$a_1a_2\cdots a_n\left( \frac{1}{a_1^2}+\frac{1}{a_2^2} +\cdots +\frac{1}{a_n^2}\right)$$is an integer, does it follow that the product $a_1a_2\cdots a_n$ is divisible by each $a_i^2$?

Two distinct numbers are selected from the set $\{1,2,3,4,\dots,36,37\}$ so that the sum of the remaining $35$ numbers is the product of these two numbers. What is the difference of these two numbers? $\textbf{(A) }5 \qquad \textbf{(B) }7 \qquad \textbf{(C) }8\qquad \textbf{(D) }9 \qquad \textbf{(E) }10$

Do numbers $x_1, x_2, \ldots, x_{99}$ exist, where each of them is equal to $\sqrt{2}+1$ or $\sqrt{2}-1$, and satisfy the equation \[x_1x_2+x_2x_3+x_3x_4+\ldots+x_{98}x_{99}+x_{99}x_1=199\,?\] Justify your answer.

A triangle of area $1$ is cut out of paper. Prove that it can be bent along a straight segment so that the area of the resulting figure is less than $s_0$, where $s_0=\frac{\sqrt5-1}{2}$. Note. The value $s_0$ specified in the condition can be reduced (the smallest value of$s_0$ is unknown to the authors of the problem). If you manage to do this (and justify it), write.

There exists a block of $1000$ consecutive positive integers containing no prime numbers, namely, $1001!+2$, $1001!+3$, $\cdots$, $1001!+1001$. Does there exist a block of $1000$ consecutive positive integers containing exactly five prime numbers?