[/quote]
,
chess board, except for the 
central square, there is a checker. In one move, a checker can jump over adjacent checker (diagonally), and this adjacent checker (that was jumped over) is removed. Is it possible to come up with a sequence of moves, so that only one checker is left on the board?
be the Fermat point of a 
.
,
,
are concurrent and the point of concurrence is 
,
be a quadrilateral such that the excircles 
and 
of triangles 
and 
touching their sides 
and 
respectively touch the extension of 
at the same point 
meets 
,
and 
.
and 
is right
?
with 
and 
.
?
(
that it is possible to form a triangle from segments of length 
.
times and obtain the numbers 
so that segments with lengths 
and 
Prove that
which satisfy 
![$ \frac{a+b+c}{3} \ge \sqrt[10]{\frac{a^3+b^3+c^3}{3}}$](http://latex.artofproblemsolving.com/c/d/a/cdae05ad34239366b0dd3921243522c711b6ae58.png)
method, I can assum 
![$ \frac{2x+\frac{1}{x^2}}{3} \ge \sqrt[10]{ \frac{2x^3+ \frac{1}{x^6}}{3}} $](http://latex.artofproblemsolving.com/c/d/4/cd481672bee1e87d8c97ac623436e0ec75cfa73a.png)
For a positive integer 
,
be the set of bijective functions from 
to itself. For a pair of positive integers 
such that 
,
,
if 
,
?
and a permutation 
?
be the set of non-negative integers and 
be the set of positive real numbers. Let 
be a function such that 
and 
for all integers 
,
for all integers 
.
.
is an integer. Prove that 
are integers.
Y by
Paca-Vaca decided to note every day a single quadratic polynomial of the form 
, where 
and 
are positive integers, less or equal than 
. He follows the rule that the polynomial he writes must not have any common roots with the polynomials previously noted.
What is the maximum amount of days Paca-Vaca can follow this plan?
, where 
and 
are positive integers, less or equal than 
. He follows the rule that the polynomial he writes must not have any common roots with the polynomials previously noted.What is the maximum amount of days Paca-Vaca can follow this plan?
