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.
be a point inside a triangle 
such that![\[ \angle APB - \angle ACB = \angle APC - \angle ABC.
\]](http://latex.artofproblemsolving.com/a/6/e/a6e3dc27d0457682fa22af4f918f58d9cd8403bc.png)
, 
be the incenters of triangles 
, 
, respectively. Show that the lines 
, 
, 
meet at a point.
cups labeled 
, where the 
-th cup has capacity liters. In total, there are liters of water distributed among these cups such that each cup contains an integer amount of water. In each step, we may transfer water from one cup to another. The process continues until either the source cup becomes empty or the destination cup becomes full.
Prove that from any configuration where each cup contains an integer amount of water, it is possible to reach a configuration in which each cup contains exactly 1 liter of water in at most 
steps.
Prove that in at most 
steps, one can go from any configuration with integer water amounts to any other configuration with the same property.
for which 
divides 
.
and 
, 
cannot be a power of 
.
of natural numbers such that for every pair of natural numbers 
and 
, the following inequality holds:![\[
\frac{1}{2} < \frac{\gcd(a_r, a_s)}{\gcd(r, s)} < 2
\]](http://latex.artofproblemsolving.com/1/6/7/167679c1707b957d87311298ea5b72347a9bdc45.png)
such that 
for all 
such that for all real numbers 
and 
,![\[f(xf(y))+f(y)=f(x+y)+f(xy).\]](http://latex.artofproblemsolving.com/d/2/f/d2ff6ed448cf39e7ec9bce6b944965d5e89b9878.png)
table filled with natural numbers, we say it is a divisor table if:
-th row are exactly all the divisors of some natural number 
,
-th column are exactly all the divisors of some natural number 
,
for every 
.
is given. Determine the smallest natural number 
, divisible by , such that there exists an divisor table, or prove that such does not exist.
, a line 
to tangent , and another circle 
disjoint from such that and lie on opposite sides of . The tangents to from a variable point 
on meet at 
and 
. Prove that, as varies over , the circumcircle of 
is tangent to two fixed circles.
be a triangle and let 
be its incircle. Denote by 
and 
the points where is tangent to sides 
and 
, respectively. Denote by 
and 
the points on sides and , respectively, such that 
and 
, and denote by 
the point of intersection of segments 
and 
. Circle intersects segment at two points, the closer of which to the vertex 
is denoted by 
. Prove that 
.
![\begin{align*}
\frac{a}{c} &= b-\sqrt{b}+c \\
\sqrt{\frac{a}{c}} &= \sqrt{b}+1 \\
\sqrt[4]{\frac{a}{c}} &=\sqrt[3]{b}-1
\end{align*}](http://latex.artofproblemsolving.com/0/c/d/0cd22d36acedbcb10d76d1b884aa35418273ed52.png)
be positive integers. Prove that the expression![\[\frac{\gcd(a+b,ab)}{\gcd(a,b)}\]](http://latex.artofproblemsolving.com/1/b/7/1b78a2027c3b7156fbb566901d2cfd088cc09f00.png)
is always a positive integer, and determine all possible values it can take.
be a convex pentagon such that 
, 
, and 
. Prove that the perpendicular line from 
to and the line segments and 
are concurrent.
,we get 
. Now just with a simple example we can see that 
goes to infinity. Take 
to get smaller than 
,but sufficiently large sum which can be higher 
.
,we can use the AM-GM theorem, to have ![$3 \geq ab+bc+ca \geq 3\sqrt[3]{a^2b^2c^2}$](http://latex.artofproblemsolving.com/9/0/b/90bb6793e43c09da96db20110614929a5d33cc6f.png)
.So, 
.With the example below,we can get that limit of goes to zero in positive numbers:
and 
satisfying
Prove
Find the range of values that can be taken by :
are positive reals.
and 
Prove that
and ![$ab+bc+ca \geq 3\sqrt[3]{a^2b^2c^2}$](http://latex.artofproblemsolving.com/f/1/1/f115c481a345f3ef53d5e39d4cca4248e32aab63.png)
finishes.