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.
-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow?
. Initially, the numbers 
are written on a board. In each move, two numbers are selected such that their difference is also present on the board. This difference is then erased from the board. (For example, if the numbers 
and 
are on the board, then 
can be erased as 
, or 
as 
, or 
as 
.) is it possible to end with only one number remaining on the board?
, where 
and 
.
satisfies the following property:![\[
f\left( \lambda x + (1 - \lambda)x',\; \lambda y + (1 - \lambda)y' \right) > \min\{f(x, y),\; f(x', y')\}
\]](http://latex.artofproblemsolving.com/3/b/d/3bd9fbf82b0b1d98a3c68745bb3f159cd9e2529a.png)
and for all 
.
be a real numbers such that 
Then find maximum value of 
segments 
and 
are parallel. Angle bisectors of 
and 
meet at 
. Angle bisectors of 
and 
meet at 
. Prove that 
is cyclic
such that 
is even , 
is odd and 
is divisible by 
.Prove that there exists a prime number 
such that is divisible by 
+1 w
and 
, then find the maximum value of ![$\sqrt{ad^3 g^4} +\sqrt[3]{be^3 h^4} + \sqrt[8]{cf^3 k^4}$](http://latex.artofproblemsolving.com/b/f/a/bfa17e8bb4cc05a84ed6a757f506d6d0ed2b0081.png)
Then there are two cases either 
or 
.When we are admitting the case we cannot divide by 
. So, in the case we apply divison by 
then is a solid prerequisite to do so.Thus, 
from 
we must take the assumption in hand that . For example take the extension of the same problem in 
then the same problem reads 
,implying only one solution with optimistic repetation of root , two times that is the multiplicity of in 
. Thankfully, we are lucky enough that we are in the field of 
.The reason is that, the book you mention was a book for below 10std (as far as I remember it is below 10th std) students, where prerequisite assumption is that ,we should work on field of .
Then there are two cases either or .When we are admitting the case we cannot divide by . So, in the case we apply divison by then is a solid prerequisite to do so.Thus, from we must take the assumption in hand that . For example take the extension of the same problem in then the same problem reads ,implying only one solution with optimistic repetation of root , two times that is the multiplicity of in . Thankfully, we are lucky enough that we are in the field of .The reason is that, the book you mention was a book for below 10std (as far as I remember it is below 10th std) students, where prerequisite assumption is that ,we should work on field of ..
Then there are two cases either or .When we are admitting the case we cannot divide by . So, in the case we apply divison by then is a solid prerequisite to do so.Thus, from we must take the assumption in hand that . For example take the extension of the same problem in then the same problem reads ,implying only one solution with optimistic repetation of root , two times that is the multiplicity of in . Thankfully, we are lucky enough that we are in the field of .The reason is that, the book you mention was a book for below 10std (as far as I remember it is below 10th std) students, where prerequisite assumption is that ,we should work on field of ...The assumption whenever we get 
else we get the case .I can explain you more but the fact is I cannot use argument of field theory to explain it in total details.The reason why it's actually the case lies in field theory logics.
Which means that the roots of this equation have to be real so we can use an method that is lost in the darkness called factoring. We can factor out the from each of the terms on the left hand side and get which with more logic we can find that the possible outcomes is that if the Parantheses are 0 or the x=0 so first we can subsitute a value of x into that to make the value 0 so we get that x=5 and we finally get the solutions of and and to wrap up our proof we can prove that factoring is the best way to go because with quadratics you would only find 2 possibiliteis or 1 depending on the plus minus. And the other thing is that if you divide by x and just solve it with algebra then you will only get the solution of 5. Thus, proving that factoring is the best method out of all of them. We can use the remainder theorem to prove this which can be done easily. 
is lost? right. Well forget about field theory and all that, Let me explain it in layman's term what is actually happening. In second solution , the solution is not actually lost. The reason we are getting but not is beacuse when we are dividing by we making an assumption that and since we are making this assumption the solution is lost. For example when we divide by 
the solution is lost why 
and we are assuming 
which is equivalent to 
. Now divison by zero is not possible which is not at all very easy to explain. Now and is not possible at the same time. Thus either or . and 
can be same when we are in a field of 
. If you are avoid knowing what is field that's perfectly fine to learn later, but just in layman's term note that 
is possible in finite fields of charecteristic .
and 
Prove that
Prove that
