It is given circle with center in center of coordinate center with radius of $2016$. On circle and inside it are $540$ points with integer coordinates such that no three of them are collinear. Prove that there exist two triangles with vertices in given points such that they have same area

Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.

Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$. The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$. The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [img]https://imgur.com/1mfBNNL.png[/img]

Consider the $5$ by $5$ by $5$ equilateral triangular grid as shown: [asy] size(5cm); real n = 5; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); } for (int i = 0; i < n; ++i) { draw((i,0)--((n+i)/2,(n-i)*0.866)); } [/asy] Ethan chooses two distinct upward-oriented equilateral triangles bounded by the gridlines. The probability that Ethan chooses two triangles that share exactly one vertex can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Andrew Wen[/i]

Find the largest real constant $a$ such that for all $n \geq 1$ and for all real numbers $x_0, x_1, ... , x_n$ satisfying $0 = x_0 < x_1 < x_2 < \cdots < x_n$ we have \[\frac{1}{x_1-x_0} + \frac{1}{x_2-x_1} + \dots + \frac{1}{x_n-x_{n-1}} \geq a \left( \frac{2}{x_1} + \frac{3}{x_2} + \dots + \frac{n+1}{x_n} \right)\]

Let $ABC$ be an equilateral triangle and a point M inside the triangle such that $MA^2 = MB^2 +MC^2$. Draw an equilateral triangle $ACD$ where $D \ne B$. Let the point $N$ inside $\vartriangle ACD$ such that $AMN$ is an equilateral triangle. Determine $\angle BMC$.

Let $p_1,p_2,\ldots,p_n$ be distinct primes greater than $3$. Show that $2^{p_1p_2\cdots p_n}+1$ has at least $4^n$ divisors.

Two towns, $A$ and $B$, are $100$ miles apart. Every $20$ minutes, (starting at midnight), a bus traveling at $60$ mph leaves town $A$ for town $B$, and every $30$ minutes (starting at midnight) a bus traveling at $20$ mph leaves town $B$ for town $A$. Dirk starts in Town $A$ and gets on a bus leaving for town $B$ at noon. However, Dirk is always afraid he has boarded a bus going in the wrong direction, so each time the bus he is in passes another bus, he gets out and transfers to that other bus. How many hours pass before Dirk finally reaches Town $B$?

Let $a,b$ and $c$ be positive integers that $$\frac{a\sqrt{3}+b}{b\sqrt3+c}$$ is a rational number, show that $$\frac{a^2+b^2+c^2}{a+b+ c}$$ is an integer. [i](Anonymous314)[/i]

Let $ABCD$ be a trapezoid in which $AB \parallel CD$ and $AB = 2CD$. A line $\ell$ perpendicular to $CD$ was drawn through point $C$. A circle with center at point $D$ and radius $DA$ intersects line $\ell$ at points $P$ and $Q$. Prove that $AP \perp BQ$.

The increasing sequence $3, 15, 24, 48, \ldots$ consists of those positive multiples of 3 that are one less than a perfect square. What is the remainder when the 1994th term of the sequence is divided by 1000?

Let $z$ be a complex number such that $z,z^2,z^3$ are all collinear in the complex plane . Show that $z$ is a real number .

Evaluate \[\int_0^1 (1-x^2)^n dx\ (n=0,1,2,\cdots)\]

Given pairwise different real numbers $a,b,c,d,e$ such that $$ \left\{ \begin{array}{ll} ab + b = ac + a, \\ bc + c = bd + b, \\ cd + d = ce + c, \\ de + e = da + d. \end{array} \right. $$ Prove that $abcde=1$.

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

What is the least positive integer $n$ for which $9n$ is a perfect square and $12n$ is a perfect cube?

Consider a regular polygon with $2^n$ sides, for $n \ge 2$, inscribed in a circle of radius $1$. Denote the area of this polygon by $A_n$. Compute $\prod_{i=2}^{\infty}\frac{A_i}{A_{i+1}}$

Alicia earns $ \$20$ per hour, of which $ 1.45\%$ is deducted to pay local taxes. How many cents per hour of Alicia's wages are used to pay local taxes? $ \textbf{(A)}\ 0.0029\qquad \textbf{(B)}\ 0.029\qquad \textbf{(C)}\ 0.29\qquad \textbf{(D)}\ 2.9\qquad \textbf{(E)}\ 29$

A subset $S$ of the set $M=\{1,2,.....,p-1\}$,where $p$ is a prime number of the kind $12n+11$,is [i]essential[/i],if the product ${\Pi}_s$ of all elements of the subset is not less than the product $\bar{{\Pi}_s}$ of all other elements of the set.The [b]difference[/b] $\bigtriangleup_s=\Pi_s-\bar{{\Pi}_s}$ is called [i]the deviation[/i] of the subset $S$.Define the least possible remainder of division by $p$ of the deviation of an essential subset,containing $\frac{p-1}{2}$ elements.

Sofía colours $46$ cells of a $9 \times 9$ board red. If Pedro can find a $2 \times 2$ square from the board that has $3$ or more red cells, he wins; otherwise, Sofía wins. Determine the player with the winning strategy.

Find all triples of non-negative real numbers $(a,b,c)$ which satisfy the following set of equations $$a^2+ab=c$$ $$b^2+bc=a$$ $$c^2+ca=b$$

A function $ f:\mathbb{Q}_{>0}\longrightarrow\mathbb{Q} $ has the following property: $$ f(xy)=f(x)+f(y),\quad x,y\in\mathbb{Q}_{>0} $$ [b]a)[/b] Demonstrate that there are no injective functions with this property. [b]b)[/b] Do exist surjective functions having this property?

$ 2000(2000^{2000}) \equal{}$ $ \textbf{(A)}\ 2000^{2001} \qquad \textbf{(B)}\ 4000^{2000} \qquad \textbf{(C)}\ 2000^{4000}\qquad \textbf{(D)}\ 4,000,000^{2000} \qquad \textbf{(E)}\ 2000^{4,000,000}$

Triangle $ABC$ is equilateral with side length $6$. Suppose that $O$ is the center of the inscribed circle of this triangle. What is the area of the circle passing through $A$, $O$, and $C$? $\textbf{(A)}\ 9\pi \qquad\textbf{(B)}\ 12\pi \qquad\textbf{(C)}\ 18\pi \qquad\textbf{(D)}\ 24\pi \qquad\textbf{(E)}\ 27\pi$

An $m\times n$ checkerboard is colored randomly: each square is independently assigned red or black with probability $\frac12.$ we say that two squares, $p$ and $q$, are in the same connected monochromatic region if there is a sequence of squares, all of the same color, starting at $p$ and ending at $q,$ in which successive squares in the sequence share a common side. Show that the expected number of connected monochromatic regions is greater than $\frac{mn}8.$