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.
chessboard. Initially, Azer colors all cells of this chessboard with some colors. Then, Babek takes 
rows and columns and looks at the 
cells in the intersection. Babek wants to have all these cells in a same color, but Azer doesn't. With at least how many colors, Azer can reach his goal?
be non-negative real numbers such that 
Prove that
be a positive integer and 
be real numbers such that ![\[a_1+a_2+\dots+a_n=0.\]](http://latex.artofproblemsolving.com/0/f/d/0fde8d75cebc35103ae9acf8ebe393653d336d60.png)
Define the set 
by![\[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]](http://latex.artofproblemsolving.com/6/9/7/6974ebf20c44bcb4d52d85adc0805e28aafa5d6e.png)
Prove that, if is not empty, then![\[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]](http://latex.artofproblemsolving.com/b/e/3/be3e65a633dc2ac092a264968f1cf8514d3d6124.png)
denote the set of all positive integers less than 
that are relatively prime to . Let 
. Is the polynomial 
reducible over the rational numbers, given that it has integer coefficients?
is defined by 
and for all positive integers 
, 
. Show that for every positive integer 
, there exists a suitable positive integer 
such that 
is a multiple of .
has circumcircle 
and incenter 
. The incircle of triangle touches side 
at 
respectively. Circumcircle of triangle 
intersects again at 
distinct from 
, circumcircle of triangle 
intersects again at 
distinct from 
. Prove that the points 
are concyclic.
lies inside triangle so that 
. The point is such that 
is a parallelogram. Prove that 
.
, point 
on 
satisfies 
and 
.
be the point where the perpendicular from 
to line 
meets the angle bisector of 
.
holds. is an isosceles triangle.
be a positive integer, and let its positive divisors be![\[
d_1 < d_2 < \cdots < d_k.
\]](http://latex.artofproblemsolving.com/6/3/e/63ec82aba0d6c4eece89af6a1247a89498616281.png)
Define 
to be the number of ordered pairs 
with 
such that 
.
. when![\[
n = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k},
\]](http://latex.artofproblemsolving.com/2/7/2/272dc2cc33ebbf695311cb61567fa0297e1299b6.png)
where the 
are distinct primes and the 
are positive integers.
such that 
.
that verify the following equation for all 
:
be a positive integer. Determine all sequences 
of positive integers such that
for all positive integers 
.
points in the plane and no three of them are on a line. And let 
points such that 
and 
are parallelograms:![\[ \overline{MA} + \overline{MB} + \overline{MC} < \overline{AA'} + \overline{BB'} + \overline{CC'}.\]](http://latex.artofproblemsolving.com/f/3/4/f34500d1a5ca6985f6ca677e31cd11df79c60ffe.png)
and 
have the same length. Show that 
When do we have equality?
and 
Find the minimum 
