AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
, 
, 
, 
be four points in the plane, with and on the same side of the line 
, such that 
and 
. Find the ratio![\[\frac{AB \cdot CD}{AC \cdot BD}, \]](http://latex.artofproblemsolving.com/f/3/c/f3cf9729b32b210faeea6e2d23da3582be2ae061.png)
and 
are orthogonal. (Intersecting circles are said to be orthogonal if at either common point their tangents are perpendicuar. Thus, proving that the circumcircles of the triangles and are orthogonal is equivalent to proving that the tangents to the circumcircles of the triangles and at the point are perpendicular.)
such that for any positive real numbers 
and 
,
Proposed by Athanasios Kontogeorgis, Grecce, and Dorlir Ahmeti, Kosovo
of positive real numbers satisfies ![\[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\]](http://latex.artofproblemsolving.com/0/3/9/03909a5f60d944063182ec97cf73f283178e8d4d.png)
for every positive integer 
. Prove that 
for every 
.
, 
and 
be the respective intersections with BC of the internal angle bisector, external angle bisector, and the median from A. The circumcircle of 
intersects 
a second time at point 
different from A. Define 
and 
analogously. Prove that the circumcenter of 
lies on the Euler line of ABC.
such that 
for all 
of the acute-angled triangle 
is tangent to its side 
at a point 
. Let 
be an altitude of triangle , and let 
be the midpoint of the segment . If 
is the common point of the circle and the line 
(distinct from ), then prove that the incircle and the circumcircle of triangle 
are tangent to each other at the point .
is called lucky if it has at least two distinct prime divisors and can be written in the form:![\[
n = p_1^{\alpha_1} + \cdots + p_k^{\alpha_k}
\]](http://latex.artofproblemsolving.com/7/4/4/744a5ccaeb9476ebd7d999c395762cb6e99a7a71.png)
where 
are distinct prime numbers that divide . (Note: it is possible that has other prime divisors not among .) Prove that for every prime number 
, there exists a lucky number such that 
.
be a non-isosceles triangle with incenter 
Let 
be the smaller circle through 
tangent to 
and 
(the addition of indices being mod 3). Let 
be the second point of intersection of 
and 
Prove that the circumcentres of the triangles 
are collinear.
be positive real numbers that fulfill![\[
\frac{x^2}{y^2}+\frac{4x^2-3xy-4y^2}{2xy-5y^2}=2
\]](http://latex.artofproblemsolving.com/6/c/c/6ccba85deb3e6aa205abd3bc8e9e9bb68f4df6fd.png)
Hence find the value of 
(base-10) into base-
, where is the smallest integer that has 8 factors. The answer will be the code to the safe.[/quote]
moves.
. Then suppose 
and 
correspond to the same state (some distinct values of 
and 
must satisfy this by PHP). Therefore, applying the algorithm 
times to a state returns that state back to itself. This is true no matter what state we are currently at, since every piece is unique on the cube. This means that after algorithms at the beginning, we will return to the solved state.
moves.
and then 
then trivially the puzzle gets resolved after applying this finite sequence of legal moves.
,
,
and 
then find the greatest possible value of 
such that 
coprime, 
and 
.
