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.
denotes the least natural such that
Find all naturals 
such that 
.
square is divided into unit squares. Is it possible to fill each unit square with a number 
in such a way that, whenever one places the tile so that it fully covers nine unit squares, the tile will cover nine different numbers?
be an odd prime number. How many -element subsets 
of 
are there, the sum of whose elements is divisible by ?
be a natural number. The numbers 
are written in a row in some order. For each pair of adjacent numbers, their greatest common divisor (GCD) is calculated and written on a sheet. What is the maximum possible number of distinct values among the 
GCDs obtained?
, there exists some positive integer 
that makes the following equation have no integer root 
.
, and 
are all polynomials such that ![\[ P(x^5)+xQ(x^5)+x^2R(x^5)=(x^4+x^3+x^2+x+1)S(x),\]](http://latex.artofproblemsolving.com/1/6/a/16a71abc110ece558d427a07d7be2d1f72148024.png)
prove that 
is a factor of 
.
such that the equality 
holds for all pairs of real numbers 
.
with 
.![\[
(x^{2}-yz)(y^{2}-zx)(z^{2}-xy).
\]](http://latex.artofproblemsolving.com/a/8/7/a87fae27584012a867bc0a90190c0317f9f7ab07.png)
be a positive integer. A positive integer is called a benefactor of if the positive divisors of can be partitioned into two sets 
and 
such that is equal to the sum of elements in minus the sum of the elements in . Note that or could be empty, and that the sum of the elements of the empty set is 
.
is a benefactor of 
because 
. has at least 
benefactors.
then we will permute it. So the ordered paid 
can be 
or 
or 
. Now there are total 
permutations of the set 
. So we have total 
options for i.e. 
options for
And options for
Hence for we have total sum as 
, for we have total sum as 
, for we have total sum as . So total up to 
.
.... 
![\[
\begin{cases}
x - y z = 1,\\[2pt]
y - z x = 2,\\[2pt]
z - x y = 4.
\end{cases}
\]](http://latex.artofproblemsolving.com/b/2/d/b2d94e49491a71f86109103f985fe3f238cf4d95.png)
is an obvious solution. Now, let 
.
or 
.
.
and 
: Prove that :
is a permutation of the elements of the set 
}