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.
, 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 
, 
, 
, 
and 
.
equally spaced points on a circular track 
of circumference . The points are labeled 
in some order, each label used once. Initially, Bunbun the Bunny begins at 
. She hops along from to 
, then from to 
, until she reaches 
, after which she hops back to . When hopping from 
to 
, she always hops along the shorter of the two arcs 
of ; if 
is a diameter of , she moves along either semicircle. arcs which Bunbun traveled, over all possible labellings of the points.
with the property that ![\[f(x-f(y))=f(f(x))-f(y)-1\]](http://latex.artofproblemsolving.com/f/2/5/f25cc1e8ae0be1fd02b347fd94be4fab88af1d46.png)
holds for all 
.
be the set of positive integers. Find all functions 
such that![\[ m^2 + f(n) \mid mf(m) +n \]](http://latex.artofproblemsolving.com/2/f/4/2f409d1de993f1af8fd839bb8e9f87a57e1b8608.png)
and .
board with a number written in each cell. Every two neighbour rows sum up to at least 
, and every two neighbour columns sum up to at most 
. Find the sum of all numbers on the board.
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?
with no parallel sides is inscribed in a circle 
. Circles 
are inscribed in triangles 
, respectively. Common external tangents are drawn between 
and 
, and 
, and 
, and and , not containing any sides of quadrilateral . A quadrilateral whose consecutive sides lie on these four lines is inscribed in a circle 
. Prove that the lines joining the centers of and , and , and the centers of and all intersect at one point.
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)
, the length of the lateral side 
is 
cm, the bisector of angle 
intersects the lateral side 
in its midpoint , the length of the segment 
is 
cm. Find the length of the segment 
.
.
.
, this value must be equal 
,
.
, solving 
.
.
and 
, 
.
.
Prove that 
and 
Prove that
,
and 
and so forth.
.
