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.
![$\sqrt[2]{2}$](http://latex.artofproblemsolving.com/1/8/6/1869ac018fb72a26a12ab14499cbf1b1c13b4a10.png)
, ![$\sqrt[3]{3}$](http://latex.artofproblemsolving.com/1/7/a/17a6bb5dc11696b8650b6d3a11e770f861f4c326.png)
, and ![$\sqrt[5]{5}$](http://latex.artofproblemsolving.com/a/b/9/ab90f2d42dc24065e2a64988fe76f22eb9359799.png)
.
board and made 
moves so that it visited all squares and returned to the starting square. At every moment, the distance from the center of the square the king was on to the center of the board was calculated. A move is called 
if this distance becomes smaller after the move. Find the maximum possible number of pleasant moves. (The chess king moves to a square adjacent either by side or by corner.)
be a function such that
for all 
. Determine all such functions 
.
such that the equality 
holds for all pairs of real numbers 
.
with integer coefficients such that 
and 
is a square of an integer for all nonnegative integers 
.
and an integer 
, 
is defined as follows: 
if 
and 
if 
.
, let 
be all positive integers smaller than that are coprime to . Find all 
such that 
for all 
is the largest positive integer that divides both 
and 
. Integers and are coprime if 
. 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.
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?
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 .
is an obvious solution. Now, let 
.
or 
.
.
