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.
of integers satisfying![\[x_0 = 0, |x_n| = |x_{n-1} + 1|\]](http://latex.artofproblemsolving.com/4/8/e/48e7b6f98f2062879377a9a2e507a63eac9269a8.png)
.
.
be a tetrahedron such that 
A sphere of radius 
is circumscribed about tetrahedron 
Given that 
, 
, and 
, prove that ![$$r^2+\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \ge \frac{9\sqrt[3]{4}}{4}$$](http://latex.artofproblemsolving.com/6/c/6/6c665b4611f5fc8ebeba03ac649bfee4e2634950.png)
with equality at ![$a=b=c=\sqrt[3]{2}.$](http://latex.artofproblemsolving.com/b/b/9/bb9c9671b23cb45e5f85ae01bf25d566c2e43e91.png)
is lovely if there exist a positive integer 
and (not necessarily distinct) positive integers 
, 
, 
, 
such that 
and 
for 
.
, which is a perfect square of an integer?
, prove that there exists a positive integer 
, such that for any integer 
, can be expressed by a sum of positive integers 
's as![\[n=a_1+a_2+\dots+a_m,\]](http://latex.artofproblemsolving.com/6/c/2/6c2a979a5ff6c40bf2d7152c8c32088fc36f848b.png)
where 
, 
, 
, 
.
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 
.
and 
be points on a plane such that 
, where is a positive integer. Let 
be the set of all points such that 
, where 
is a real number. The path that traces is continuous, and the value of is minimized. Prove that for all , is always a rational number.
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 
.
,
and 
and so forth.
.
be an odd prime. Prove that:![\[\displaystyle\sum_{k=1}^{p-1}k^{2p-1} \equiv \frac{p(p+1)}{2} \pmod{p^2}\]](http://latex.artofproblemsolving.com/a/5/5/a55e75d4d9769ceec3a3ce359aac676c7c7875fd.png)
![\[
\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 
.
.
