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.
a positive integer . suppose that there exist two automorphisms 
of 
such that 
. is even.
be an isosceles triangle with 
. The circle 
, passing through 
and 
, intersects segment 
at 
. The circle 
is tangent to 
at and passes through 
. Let 
and 
be the midpoints of segments and 
, respectively. The line 
intersects and at points 
and 
, respectively, where and are the intersections closer to . Prove that 
.
such that for any 
:
, then either travels [list] units vertically (up or down) and 
units horizontally (left or right); or units horizontally (left or right) and units vertically (up or down)., the ant can choose to go to one of eight possible points.
and 
, the ant can travel from 
to 
using at most 
moves.
, the sides and 
are parallel and the angles 
and 
are acute. Show that it is possible to divide the triangle into 4 disjoint triangle 
and the triangle 
into 4 disjoint triangles 
such that the triangles 
and 
are congruent for all 
.
be a positive semi-definite matrix. Prove that the matrix 
, is also positive semi-definite for all 
.
is given in the plane, let 
be the set of points which lie strictly inside it. Also let 
be the set of circles in the plane. For a point 
, let 
be the reflection of in sides 
respectively. Define a function 
such that 
is the circumcircle of 
. Is 
injective? is called injective if for any 
, 
board, some squares are painted red. Let be the number of rows that have an odd number of red squares and let be the number of columns that have an odd number of red squares. Find all possible values of 
. For each value found, give a example of how the board can be painted.
sides are marked on the blackboard. Ana and Beto play alternately, Ana begins. Each player, in turn, must do the following:
join two vertices with a segment, without cutting another already marked segment; or delete a vertex that does not belong to any marked segment.
if is even.
be the set of positive real numbers. Determine all functions 
such that ![\[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\]](http://latex.artofproblemsolving.com/e/7/1/e71b6e0d0b858eb46b81149f1e6be8c41e13d301.png)
for every 
.
?
![$f\colon[0,1]\rightarrow \mathbb{R}$](http://latex.artofproblemsolving.com/f/d/b/fdb1fb0216ab9d17007b1b7b03d20d1060b88531.png)
be a continuous function. Suppose that for each 
, the function ![\[f_t\colon[0,1-t]\rightarrow\mathbb{R}, f_t(x)=f(x+t)-f(x)\]](http://latex.artofproblemsolving.com/4/f/c/4fc6a66d0600a999c000136a26ea23dfcc269cc3.png)
has an unique global minimum point, which we will denote by 
. Prove that if 
, then 
is constant zero.
be a continuous function. Suppose that for each , the function has an unique global minimum point, which we will denote by . Prove that if , then is constant zero.
