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.
. Find all funcitions 
such that for all any 
, 
, 
be non-negative real numbers, no two of which are zero. Such that 
Prove that :
be a convex quadrilateral and points 
and 
on sides 
such that![\[\tfrac{AB}{AE}=\tfrac{CD}{DF}=n\]](http://latex.artofproblemsolving.com/b/4/2/b42cd6305fab848a60c79689f17bdb55e1ba0d31.png)
is the area of 
show that 
and can teleport to other Cartesian coordinates with only 
of 
moves: 
, 
when 
, 
, and 
when 
.
be any polynomial with positive integer coefficients that passes through 
. Show that for all such , there exists a unique point on the curve where the wizard can land on., let be this unique point. Find the equation of the graph that contains all potential .
be a sequence of positive integers. Let 
be the number of 3-element subsequences 
with 
, such that 
and 
. Considering all such sequences 
, find the greatest value of .
, 
is the midpoint of 
. 
is an arbitrary point on 
. Let 
be the intersection of 
and 
. The line 
intersects with the circumcircle of 
, for the second time at 
. 
is the circumcenter of triangle 
. Prove that 
.
in the expansion of 
table. A cannon can fire at any 
cells of the board after that the tank will move to one of the adjacent cells (by side). Then the process is repeated. Find the smallest value of such that the cannon can definitely shoot the tank after some time.
is 
. Line 
meets line 
at point 
, and there is a point on 
such that 
. Line 
intersects at point . The perpendicular bisector of line segment intersects line 
at point 
, and line intersects 
at point 
.
is tangent to 
.
, because last four digits would have to be divisible by 
, but in each of this cases numbers 
are not. Similarly, we can see that 
leads to contradiction.
is coprime to 
. We know that 
is coprime with 
and 
for all 
, so function 
is bijective on integers relatively prime to 
(we count modulo ). To see that this function is bijective, we can also see that 
iff 
divides 
, but 
cannot divide neither 
, nor 
if 
is not divisible by , so we would have to have 
. The same argument works modulo 
. Therefore, we can have 
. Obviously, we can also have 
, so our answer is 
.
and 
.
Is there any generalizations?
such that 
.
such that for any positive integer 
there exists a positive integer 
are equal to 
