Let $ABCDEFG$ be a regular heptagon. If $AC = m$ and $AD = n$, prove that $AB =\frac{mn}{m+n}$.

Triangle $ABC$ is inscribed in circle $O$. Tangent $PD$ is drawn from $A$, $D$ is on ray $BC$, $P$ is on ray $DA$. Line $PU$ ($U \in BD$) intersects circle $O$ at $Q$, $T$, and intersect $AB$ and $AC$ at $R$ and $S$ respectively. Prove that if $QR=ST$, then $PQ=UT$.

Let $a, b, c, x, y$ and $z$ be complex numbers such that $a=\frac{b+c}{x-2}, b=\frac{c+a}{y-2}, c=\frac{a+b}{z-2}$. If $xy+yz+zx=1000$ and $x+y+z=2016$, find the value of $xyz$.

Let a triangle $ABC$ inscribed in circle $c(O,R)$ and $D$ an arbitrary point on $BC$(different from the midpoint).The circumscribed circle of $BOD$,which is $(c_1)$, meets $c(O,R)$ at $K$ and $AB$ at $Z$.The circumscribed circle of $COD$ $(c_2)$,meets $c(O,R)$ at $M$ and $AC$ at $E$.Finally, the circumscribed circle of $AEZ$ $(c_3)$,meets $c(O,R)$ at $N$.Prove that $\triangle{ABC}=\triangle{KMN}.$

Six free cells are given in a row. Players $A$ and $B$ alternately write digits from $0$ to $9$ in empty cells, with $A$ starting. When all the cells are filled, one considers the obtained six-digit number $z$. Player $B$ wins if $z$ is divisible by a given natural number $n$, and loses otherwise. For which values of $n$ not exceeding $20$ can $B$ win independently of his opponent’s moves?

For positive integers $n$, let $f_2(n)$ denote the number of divisors of $n$ which are perfect squares, and $f_3(n)$ denotes the number of positive divisors which are perfect cubes. Prove that for each positive integer $k$ there exists a positive integer $n$ for which $\frac{f_2(n)}{f_3(n)}=k$.

Let $\omega$ be a root of unity and $f$ be a polynomial with integer coefficients. Show that if $|f(\omega)|=1$, then $f(\omega)$ is also a root of unity.

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

Let $ABC$ be a triangle with circumcentre $O$. The points $D,E,F$ lie in the interiors of the sides $BC,CA,AB$ respectively, such that $DE$ is perpendicular to $CO$ and $DF$ is perpendicular to $BO$. (By interior we mean, for example, that the point $D$ lies on the line $BC$ and $D$ is between $B$ and $C$ on that line.) Let $K$ be the circumcentre of triangle $AFE$. Prove that the lines $DK$ and $BC$ are perpendicular. [i]Netherlands (Merlijn Staps)[/i]

I'm thinking of two whole numbers. Their product is 24 and their sum is 11. What is the larger number? $ \text{(A)}\ 3\qquad\text{(B)}\ 4\qquad\text{(C)}\ 6\qquad\text{(D)}\ 8\qquad\text{(E)}\ 12 $

A ball was launched on a rectangular billiard table at an angle of $45^o$ to one of the sides. Reflected from all sides (the angle of incidence is equal to the angle of reflection), he returned to his original position . It is known that one of the sides of the table has a length of one meter. Find the length of the second side. [img]https://cdn.artofproblemsolving.com/attachments/3/d/e0310ea910c7e3272396cd034421d1f3e88228.png[/img]

The writer Arthur has $n \ge1$ co-authors who write books with him. Each book has a list of authors including Arthur himself. No two books have the same set of authors. At a party with all his co-author, each co-author writes on a note how many books they remember having written with Arthur. Inspecting the numbers on the notes, they discover that the numbers written down are the first $n$ Fibonacci numbers (defined by $F_1 = F_2 = 1$ and $F_{k+2}= F_{k+1} + F_k$). For which $n$ is it possible that none of the co-authors had a lapse of memory?

A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities $$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$ Prove that there exists a polynomial $F(t)$ in one variable such that $$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$

Let $ABCD$ be a cyclic quadrilateral, and angle bisectors of $\angle BAD$ and $\angle BCD$ meet at point $I$. Show that if $\angle BIC = \angle IDC$, then $I$ is the incenter of triangle $ABD$.

Given a prime $p$, prove that the sum $\sum_{k=1}^{\lfloor \frac{q}{p} \rfloor}{k^{p-1}}$ is not divisible by $q$ for all but finitely many primes $q$.

Prove that there exist infinitely many pairs $(a, b)$ of relatively prime positive integers such that \[\frac{a^{2}-5}{b}\;\; \text{and}\;\; \frac{b^{2}-5}{a}\] are both positive integers.

Let $ABCD$ be a square and $E$ a point on side $CD$ such that $\angle DAE = 30^{\circ}$. The bisector of angle $\angle AEC$ intersects line $BD$ at point $F$. Lines $FC$ and $AE$ intersect at $S$. Find $\angle SDC$. [i]Proposed by Ana Boiangiu[/i]

A convicted person will be released when he reaches the top of a $100$-step staircase. But he cannot advance as he pleases, since he is obliged to go up one step each day of the odd-numbered months and go down one step each day of the even-numbered months. If it begins on January $ 1$, $2001$, what day will it be released?

Let $a, b, c > 0$ be real numbers with $abc = 1$. Show $$1 + ab + bc + ca \ge \min \left\{ \frac{(a + b)^2}{ab} , \frac{(b+c)^2}{bc} , \frac{(c + a)^2}{ca}\right\}.$$ When does equality holds?

Compute the sum of all positive integers $n$ for which there exists a real number $x$ satisfying $$\left(x +\frac{n}{x} \right)^n= 2^{20}.$$

Given two integers $ m,n$ satisfying $ 4 < m < n.$ Let $ A_{1}A_{2}\cdots A_{2n \plus{} 1}$ be a regular $ 2n\plus{}1$ polygon. Denote by $ P$ the set of its vertices. Find the number of convex $ m$ polygon whose vertices belongs to $ P$ and exactly has two acute angles.

Draw on the plane a set of points whose coordinates $(x,y)$ satisfy the equation $x^3 + y^3 = x^2y^2 + xy$.

The integers from 1 to 49 are written in a $7\times 7$ table, such that for any $k\in\{1,2,\ldots,7\}$ the product of the numbers in the $k$-th row equals the product of the numbers in the $(8-k)$-th row. [list=a] [*]Prove that there exists a row such that the sum of the numbers written on it is a prime number. [*]Give an example of such a table. [/list] [i]Cristi Săvescu[/i]

Let $ a$ be a positive integer. Consider the sequence $ (a_n)$ defined as $ a_0\equal{}a$ and $ a_n\equal{}a_{n\minus{}1}\plus{}40^{n!}$ for $ n > 0$. Prove that the sequence $ (a_n)$ has infinitely many numbers divisible by $ 2009$.

Find the largest positive integer $k$ such that we can find a set $A \subseteq \{1,2, \ldots, 100 \}$ with $k$ elements such that, for any $a,b \in A$, $a$ divides $b$ if and only if $s(a)$ divides $s(b)$, where $s(k)$ denotes the sum of the digits of $k$.