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 an acute triangle. Points 
, and 
lie on a line in this order and satisfy 
. Let 
and 
be the midpoints of 
and 
, respectively. Suppose triangle 
is acute, and let 
be its orthocentre. Points 
and 
lie on lines 
and 
, respectively, such that 
and are concyclic and pairwise different, and 
and are concyclic and pairwise different. Prove that 
and are concyclic.
such for any 
:
.
satisfy,
Where {
} is a permutation of . Prove that 
be an integer. We are given a balance and 
weights of weight 
. We are to place each of the weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed.
to satisfy that the equation 
has at least 1 roots 
of positive integers is called central if for every positive integer , the arithmetic mean of the first 
terms of the sequence is equal to .
, 
, 
, 
of positive integers such that for every central sequence 
, 
, 
, , there are infinitely many positive integers with 
.
of the equation![\[n^3=p^2-p-1\]](http://latex.artofproblemsolving.com/f/f/8/ff88093bb0aa93afcfdff3ae25149ec5fbacb61f.png)
is a prime number and is an integer
be an integer. In a configuration of an 
board, each of the 
cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate 
counterclockwise. We call a cell good if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of , the maximum number of good cells over all possible starting configurations.
and 
be points on a plane such that 
Let be a point on that plane such that 
Prove that ![$$AP \in \left[\frac{5-\sqrt{5}}{10}, \frac{-1+\sqrt{5}}{2}\right] \cup \left[\frac{5+\sqrt{5}}{10}, \frac{1+\sqrt{5}}{2}\right].$$](http://latex.artofproblemsolving.com/7/8/e/78e428cbc99ce4e9448f5c4cec86f50567123812.png)
, intersecting coordinate axes at three different points. Prove that all circles circumscribed around triangles with vertices at these points pass through one common point.
, intersecting coordinate axes at three different points. Prove that all circles circumscribed around triangles with vertices at these points pass through one common point.
?
be reals such that 
. Prove that
specifies the greatest common divisor of 
and 
.
where 
and 
are the roots of 
.
,
with respect to the circle 
passing through the three points 
lies on 
so 
.
[\hide]
so 
.