Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

For $i = 1,2, \ldots, 1991$, we choose $n_i$ points and write number $i$ on them (each point has only written one number on it). A set of chords are drawn such that: (i) They are pairwise non-intersecting. (ii) The endpoints of each chord have distinct numbers. If for all possible assignments of numbers the operation can always be done, find the necessary and sufficient condition the numbers $n_1, n_2, \ldots, n_{1991}$ must satisfy for this to be possible.

For every $3$-digit natural number $n$ (leading digit of $n$ is nonzero), we consider the number $n_0$ obtained from $n$ eliminating all possible digits that are zero. For example, if $n = 207$, then $n_0 = 27$. Determine the number of three-digit positive integers $n$, for which $n_0$ is a divisor of $n$ different from $n$.

Find all pairs of natural numbers $(k, m)$ such that for any natural $n{}$ the product\[(n+m)(n+2m)\cdots(n+km)\]is divisible by $k!{}$. [i]Proposed by P. Kozhevnikov[/i]

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.

Given a real number $a$, the [i]floor[/i] of $a$, written $\lfloor a \rfloor$, is the greatest integer less than or equal to $a$. For how many real numbers $x$ such that $1 \le x \le 20$ is \[ x^2 + \lfloor 2x \rfloor = \lfloor x^2 \rfloor + 2x \, ? \]

A triangle is called a parabolic triangle if its vertices lie on a parabola $y = x^2$. Prove that for every nonnegative integer $n$, there is an odd number $m$ and a parabolic triangle with vertices at three distinct points with integer coordinates with area $(2^nm)^2$.

Three disks of diameter $d$ are touching a sphere in their centers. Besides, every disk touches the other two disks. How to choose the radius $R$ of the sphere in order that axis of the whole figure has an angle of $60^\circ$ with the line connecting the center of the sphere with the point of the disks which is at the largest distance from the axis ? (The axis of the figure is the line having the property that rotation of the figure of $120^\circ$ around that line brings the figure in the initial position. Disks are all on one side of the plane, passing through the center of the sphere and orthogonal to the axis).

Let $ ABCD$ be a trapezoid such that $ AB \parallel CD$ and assume that there are points $ E$ on the line outside the segment $ BC$ and $ F$ on the segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Let $ I,J,K$ respectively be the intersection of line $ EF$ and line $ CD$, the intersection of line $ EF$ and line $ AB$, and the midpoint of segment $ EF$. Prove that $ K$ is on the circumcircle of triangle $ CDJ$ if and only if $ I$ is on the circumcircle of triangle $ ABK$. [i]Utari Wijayanti, Bandung[/i]

Prove that if $a$ and $b$ are positive integers and $ab>1$, then \[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$. [i]Calvin Deng.[/i]

Let $ x$,$ y$, and $ z$ be three positive real numbers whose sum is $ 1$. If no one of these numbers is more than twice any other, then the minimum possible value of the product $ xyz$ is $ \textbf{(A)}\ \frac{1}{32}\qquad \textbf{(B)}\ \frac{1}{36}\qquad \textbf{(C)}\ \frac{4}{125}\qquad \textbf{(D)}\ \frac{1}{127}\qquad \textbf{(E)}\ \text{none of these}$

Two infinite rows of evenly-spaced dots are aligned as in the figure below. Arrows point from every dot in the top row to some dot in the lower row in such a way that: [list][*]No two arrows point at the same dot. [*]Now arrow can extend right or left by more than 1006 positions.[/list] [img]https://cdn.artofproblemsolving.com/attachments/7/6/47abf37771176fce21bce057edf0429d0181fb.png[/img] Show that at most 2012 dots in the lower row could have no arrow pointing to them.

Show that the cube roots of three distinct prime numbers cannot be three terms (not necessarily consecutive) of an arithmetic progression.

Prove that for all positive integers $n,m$, with $m$ odd, the following number is an integer \[ \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k. \]

The straight line $ \overline{AB}$ is divided at $ C$ so that $ AC\equal{}3CB$. Circles are described on $ \overline{AC}$ and $ \overline{CB}$ as diameters and a common tangent meets $ AB$ produced at $ D$. Then $ BD$ equals: $ \textbf{(A)}\ \text{diameter of the smaller circle} \\ \textbf{(B)}\ \text{radius of the smaller circle} \\ \textbf{(C)}\ \text{radius of the larger circle} \\ \textbf{(D)}\ CB\sqrt{3}\\ \textbf{(E)}\ \text{the difference of the two radii}$

A "spherical ellipse" with foci $A,B$ on a given sphere is defined as the set of all points $P$ on the sphere such that $\overset{\Large\frown}{PA}+\overset{\Large\frown}{PB}=$ constant. Here $\overset{\Large\frown}{PA}$ denotes the shortest distance on the sphere between $P$ and $A$. Determine the entire class of real spherical ellipses which are circles.

Let $O, I$ be the circumcenter and the incenter of triangle $ABC$, $P$ be an arbitrary point on segment $OI$, $P_A$, $P_B$, and $P_C$ be the second common points of lines $PA$, $PB$, and $PC$ with the circumcircle of triangle $ABC$. Prove that the bisectors of angles $BP_AC$, $CP_BA$, and $AP_CB$ concur at a point lying on $OI$.

Points $ A_1$, $ A_2$, $ ...$ are placed on a circle with center $ O$ such that $ \angle OA_n A_{n\plus{}1}\equal{}35^\circ$ and $ A_n\neq A_{n\plus{}2}$ for all positive integers $ n$. What is the smallest $ n>1$ for which $ A_n\equal{}A_1$?

In a triangle $ABC,$ the internal and external bisectors of the angle $A$ intersect the line $BC$ at $D$ and $E$ respectively. The line $AC$ meets the circle with diameter $DE$ again at $F.$ The tangent line to the circle $ABF$ at $A$ meets the circle with diameter $DE$ again at $G.$ Show that $AF = AG.$

Among 6 coins one is counterfeit (its weight differs from that real one and neither weights is known). Using scales that show the total weight of coins placed on the cup, find the counterfeit coin in 3 weighings. [i](5 points)[/i]

Given triangle $ABC$ with the inner - bisector $AD$. The line passes through $D$ and perpendicular to $BC$ intersects the outer - bisector of $\angle BAC$ at $I$. Circle $(I,ID)$ intersects $CA$, $AB$ at $E$, $F$, reps. The symmedian line of $\triangle AEF$ intersects the circle $(AEF)$ at $X$. Prove that the circles $(BXC)$ and $(AEF)$ are tangent. [Hide=Diagram] [asy]import graph; size(7.04cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = 7.02, xmax = 14.06, ymin = -1.54, ymax = 4.08; /* image dimensions */ /* draw figures */ draw((8.62,3.12)--(7.58,-0.38)); draw((7.58,-0.38)--(13.68,-0.38)); draw((13.68,-0.38)--(8.62,3.12)); draw((8.62,3.12)--(9.85183961338573,3.5535510951732316)); draw((9.85183961338573,3.5535510951732316)--(9.851839613385732,-0.38)); draw((9.851839613385732,-0.38)--(8.62,3.12)); draw(circle((10.012708209519483,1.129702986881574), 2.4291805937992947)); draw((8.62,3.12)--(9.470868507287285,-1.238276762688951), red); draw(shift((9.85183961338573,3.553551095173232))*xscale(3.9335510951732324)*yscale(3.9335510951732324)*arc((0,0),1,237.85842690125605,309.7357733435313), linetype("4 4")); draw(shift((10.63,3.8274278922585725))*xscale(5.196628663716066)*yscale(5.196628663716066)*arc((0,0),1,234.06132677886183,305.9386732211382), blue); /* dots and labels */ dot((8.62,3.12),linewidth(3.pt) + dotstyle); label("$A$", (8.48,3.24), NE * labelscalefactor); dot((7.58,-0.38),linewidth(3.pt) + dotstyle); label("$B$", (7.3,-0.58), NE * labelscalefactor); dot((13.68,-0.38),linewidth(3.pt) + dotstyle); label("$C$", (13.76,-0.26), NE * labelscalefactor); dot((9.851839613385732,-0.38),linewidth(3.pt) + dotstyle); label("$D$", (9.94,-0.26), NE * labelscalefactor); dot((9.85183961338573,3.5535510951732316),linewidth(3.pt) + dotstyle); label("$I$", (9.94,3.68), NE * labelscalefactor); dot((7.759138898806625,0.22287129406075654),linewidth(3.pt) + dotstyle); label("$F$", (7.46,0.16), NE * labelscalefactor); dot((12.36635458796946,0.5286480122740898),linewidth(3.pt) + dotstyle); label("$E$", (12.44,0.64), NE * labelscalefactor); dot((9.470868507287285,-1.238276762688951),linewidth(3.pt) + dotstyle); label("$X$", (9.56,-1.12), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [/Hide]

Ali Baba and the $40$ thieves want to cross Bosporus strait. They made a line so that any two people standing next to each other are friends. Ali Baba is the first, he is also a friend with the thief next to his neighbour. There is a single boat that can carry $2$ or $3$ people and these people must be friends. Can Ali Baba and the $40$ thieves always cross the strait if a single person cannot sail?

Two squares on an $8\times 8$ chessboard are called adjacent if they have a common edge or common corner. Is it possible for a king to begin in some square and visit all squares exactly once in such a way that all moves except the first are made into squares adjacent to an even number of squares already visited?

Find the greatest real number $C$ such that, for all real numbers $x$ and $y \neq x$ with $xy = 2$ it holds that \[\frac{((x + y)^2 - 6)((x - y)^2 + 8)}{(x-y)^2}\geq C.\] When does equality occur?

Let $k$ be a positive integer. Prove that: (a) If $k=m+2mn+n$ for some positive integers $m,n$, then $2k+1$ is composite. (b) If $2k+1$ is composite, then there exist positive integers $m,n$ such that $k=m+2mn+n$.