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.
(i know 
well). i want to study so if you guys have some easy or normal problems please send me
and 
. At each step, it is allowed to add to one of the polynomials and to multiply another one by the polynomial 
. Can the polynomials become equal at some point?
of degree 
. Sasha wants to guess it (knowing ). During a turn, Sasha can name a certain segment ![$[a;b]$](http://latex.artofproblemsolving.com/0/0/6/0066f4b2714f88cdaf883b00f877aa1355b7f9ef.png)
and Maxim will give in response the maximum value of on the segment . Will Sasha be able to guess in a finite number of steps?
and 
Prove that
Let 
and 
Prove that
not isosceles, the incircle 
. 
is the intersection of with 
. 
is the projection of 
onto 
. 
cut at the second point 
. 
is the projection of 
onto 
. 
cut at the second point 
respectively. Prove 
are collinear
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 
, and 
for all integers 
. 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)
, let 
denote the smallest possible value of 
where 
are sets such that 
and 
whenever 
. Determine for each positive integer .
and 
intersect at . The common tangent line nearer to 
of the two circles touches 
at 
respectively. Let 
be the symmetric points of with respect to respectively. The circumcircle of triangle 
intersects circles and at points 
respectively which are distinct from . Prove that the circumradii of the triangles 
and 
are equal.
board in such a way that a chess king from any cell attacks no more than two marked ones? (The cell on which a king stands is also considered to be attacked by this king.)
board in such a way that a chess king from any cell attacks no more than two marked ones? (The cell on which a king stands is also considered to be attacked by this king.)
grid by 
grid and note that the above problem is same as. grid. There are atmost 
marked cells in every 
subsquare.Find the largest number of marked cells.
tiles of form 
. There are tiles of 
shape and there are 
squares of form 
. Note that shaped tile and 
tile each can have atmost marked cells while tile of form 
can have atmost 1 marked cell. So we have atmost 
marked cells.
marked cells.
gives 
as ans for grid so we are done. 
is an integer. Prove that 
are integers.
![\[
v_p(n!) \leq \frac{n}{p - 1}
\]](http://latex.artofproblemsolving.com/5/7/c/57ca4d0a6532fb4b97687a97b9c1fb35ad02b9f2.png)
are given such that 
.
in natural numbers m and n.
be a 
board. Some of its cells are colored black in such a way that every 
board of 