Given a regular dodecagon (a convex polygon with 12 congruent sides and angles) with area 1, there are two possible ways to dissect this polygon into 12 equilateral triangles and 6 squares. Let $T_1$ denote the union of all triangles in the first dissection, and $S_1$ the union of all squares. Define $T_2$ and $S_2$ similarly for the second dissection. Let $S$ and $T$ denote the areas of $S_1 \cap S_2$ and $T_1 \cap T_2$, respectively. If $\frac{S}{T} = \frac{a+b\sqrt{3}}{c}$ where $a$ and $b$ are integers, $c$ is a positive integer, and $\gcd(a,c)=1$, compute $10000a+100b+c$. [i]Proposed by Lewis Chen[/i]

Let $ABCD$ be a cyclic quadrilateral inscribed in circle $\Omega$ with $AC \perp BD$. Let $P=AC \cap BD$ and $W,X,Y,Z$ be the projections of $P$ on the lines $AB, BC, CD, DA$ respectively. Let $E,F,G,H$ be the mid-points of sides $AB, BC, CD, DA$ respectively. (a) Prove that $E,F,G,H,W,X,Y,Z$ are concyclic. (b) If $R$ is the radius of $\Omega$ and $d$ is the distance between its centre and $P$, then find the radius of the circle in (a) in terms of $R$ and $d$.

Find all ordered pairs $(a,b)$, of natural numbers, where $1<a,b\leq 100$, such that $\frac{1}{\log_{a}{10}}+\frac{1}{\log_{b}{10}}$ is a natural number.

Prove that if $ a + b = 1 $, then $$ a^5 + b^5 \geq \frac{1}{16}$$

Consider a set $X$ with $|X| = n\geq 1$ elements. A family $\mathcal{F}$ of distinct subsets of $X$ is said to have property $\mathcal{P}$ if there exist $A,B \in \mathcal{F}$ so that $A\subset B$ and $|B\setminus A| = 1$. i) Determine the least value $m$, so that any family $\mathcal{F}$ with $|\mathcal{F}| > m$ has property $\mathcal{P}$. ii) Describe all families $\mathcal{F}$ with $|\mathcal{F}| = m$, and not having property $\mathcal{P}$. ([i]Dan Schwarz[/i])

Let $a, b, c$ be side lengths of a right triangle. Determine the minimum possible value of $\frac{a^3 + b^3 + c^3}{abc}$.

Let $P(x)$ be a polynomial of degree $n$ such that $P(x)=3^k$ for $0\le k \le n$. Find $P(n+1)$

Find all pairs $(a, b)$ of natural numbers such that $$\frac{a^3 + 1}{2ab^2 + 1}$$ is an integer.

Prove that in every convex hexagon of area $S$ one can draw a diagonal that cuts off a triangle of area not exceeding $\frac{1}{6}S.$

Consider arithmetic sequences where all terms are natural numbers. If the first term of such a sequence is $1$, prove that that sequence contains infinitely many terms that are the cube of a natural number. Give an example of such a sequence in which no term is the cube of a natural number and show the correctness of this example.

Let $n$ be positive integer. Given is a grid $nxn$. Some cells of the grid are colored in green, so that no two green squares share a common side. Is it possible, however the green cells are colored, to place $n$ rooks, so that none of the rooks is on green cell, and no two rooks attack each other, if a) n=19 b) n=20

Find all functions $f: Q^{+}\rightarrow R$ such that $f(x)+f(y)+2xyf(xy)=\frac{f(xy)}{f(x+y)}$ for all $x,y\in Q^{+}$

Find all $a , b , c \in \mathbb{N}$ for which \[1997^a+15^b=2012^c\]

Take $r$ such that $1\le r\le n$, and consider all subsets of $r$ elements of the set $\{1,2,\ldots,n\}$. Each subset has a smallest element. Let $F(n,r)$ be the arithmetic mean of these smallest elements. Prove that: \[ F(n,r)={n+1\over r+1}. \]

In a football league, there are $n\geq 6$ teams. Each team has a homecourt jersey and a road jersey with different color. When two teams play, the home team always wear homecourt jersey and the road team wear their homecourt jersey if the color is different from the home team's homecourt jersey, or otherwise the road team shall wear their road jersey. It is required that in any two games with 4 different teams, the 4 teams' jerseys have at least 3 different color. Find the least number of color that the $n$ teams' $2n$ jerseys may use.

A $2015\times2015$ chessboard is given, the cells of which are painted white and black alternatively so that the corner cells are black. There are $n{}$ [url=https://i.stack.imgur.com/V1kdh.png]L-trominoes[/url] placed on the board, no two of which overlap and which cover all of the black cells. Find the smallest possible value of $n{}$.

Define the set $M_q=\{x \in \mathbb{Q} \mid x^3-2015x=q \}$ , where $q$ is an arbitrary rational number. [b]a)[/b] Show that there exists values for $q$ such that the set is null as well as values for which it has exactly one element. [b]b)[/b] Determine all the possible values for the cardinality of $M_q$

Given is a triangle $ABC$ and two points $D \in AC, E \in BD$ such that $\angle DAE=\angle AED=\angle ABC$. Show that $BE=2CD$ iff $\angle ACB=90^{\circ}$.

Let $H$ be the orthocenter of $\triangle ABC$. The points $A_{1} \not= A$, $B_{1} \not= B$ and $C_{1} \not= C$ lie, respectively, on the circumcircles of $\triangle BCH$, $\triangle CAH$ and $\triangle ABH$ and satisfy $A_{1}H=B_{1}H=C_{1}H$. Denote by $H_{1}$, $H_{2}$ and $H_{3}$ the orthocenters of $\triangle A_{1}BC$, $\triangle B_{1}CA$ and $\triangle C_{1}AB$, respectively. Prove that $\triangle A_{1}B_{1}C_{1}$ and $\triangle H_{1}H_{2}H_{3}$ have the same orthocenter.

Let $a,b,c,d$ be positive real numbers. What is the minimum value of $$ \frac{(a^2+b^2+2c^2+3d^2)(2a^2+3b^2+6c^2+6d^2)}{(a+b)^2(c+d)^2}$$

The point $P$ lies on the edge $AB$ of a quadrilateral $ABCD$. The angles $BAD, ABC$ and $CPD$ are right, and $AB = BC + AD$. Show that $BC = BP$ or $AD = BP$.

We call a function $g$ [i]special [/i] if $g(x)=a^{f(x)}$ (for all $x$) where $a$ is a positive integer and $f$ is polynomial with integer coefficients such that $f(n)>0$ for all positive integers $n$. A function is called an [i]exponential polynomial[/i] if it is obtained from the product or sum of special functions. For instance, $2^{x}3^{x^{2}+x-1}+5^{2x}$ is an exponential polynomial. Prove that there does not exist a non-zero exponential polynomial $f(x)$ and a non-constant polynomial $P(x)$ with integer coefficients such that $$P(n)|f(n)$$ for all positive integers $n$.

Square $ EFGH$ is inside the square $ ABCD$ so that each side of $ EFGH$ can be extended to pass through a vertex of $ ABCD$. Square $ ABCD$ has side length $ \sqrt {50}$ and $ BE \equal{} 1$. What is the area of the inner square $ EFGH$? [asy]unitsize(4cm); defaultpen(linewidth(.8pt)+fontsize(10pt)); pair D=(0,0), C=(1,0), B=(1,1), A=(0,1); pair F=intersectionpoints(Circle(D,2/sqrt(5)),Circle(A,1))[0]; pair G=foot(A,D,F), H=foot(B,A,G), E=foot(C,B,H); draw(A--B--C--D--cycle); draw(D--F); draw(C--E); draw(B--H); draw(A--G); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,SE); label("$D$",D,SW); label("$E$",E,NNW); label("$F$",F,ENE); label("$G$",G,SSE); label("$H$",H,WSW);[/asy]$ \textbf{(A)}\ 25\qquad \textbf{(B)}\ 32\qquad \textbf{(C)}\ 36\qquad \textbf{(D)}\ 40\qquad \textbf{(E)}\ 42$

Given a rectangle $ABCD$ with $AB> BC$. On the side $CD$, take a point $L$ such that $BL$ and $AC$ are perpendicular. Let $K$ be the intersection point of segments $BL$ and $AC$. It is known that segments $AL$. and $DK$ are perpendicular. Find $\angle ACB.$

Let $({{A}_{n}})_{n=1}^{\infty }$ and $({{a}_{n}})_{n=1}^{\infty }$ be sequences of positive integers. Assume that for each positive integer $x$, there is a unique positive integer $N$ and a unique $N-tuple$ $({{x}_{1}},...,{{x}_{N}})$ such that $0\le {{x}_{k}}\le {{a}_{k}}$ for $k=1,2,...N$, ${{x}_{N}}\ne 0$, and $x=\sum\limits_{k=1}^{N}{{{A}_{k}}{{x}_{k}}}$. (a) Prove that ${{A}_{k}}=1$ for some $k$; (b) Prove that ${{A}_{k}}={{A}_{j}}\Leftrightarrow k=j$; (c) Prove that if ${{A}_{k}}\le {{A}_{j}}$, then $\left. {{A}_{k}} \right|{{A}_{j}}$.