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.![$f \in C^1([0,1]), g \in C^2(f([0;1]))$](http://latex.artofproblemsolving.com/f/5/2/f52369171ef8571734950120c43aacac10154fcd.png)
.
?
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.
and 
.
with multiplication of matrixes operation is making an isomorphic-group structure with 
.
.
plane centered on the 
axis which are tangent to both the parabola 
and the line 
. Determine the lengths of the circles' diameters.
by 
and 
for all 
, where 
Show that 
is an integer for all 
.
is not a field, the problem is faulty
is a finite field for all primes .
and 
.
. The geometric multiplicity is 1.
and 
. If we take instead 1 of column 4 and 3 of column 5, which means we have to take none of column 2. So another vector in this kernel is 
.
. We can take instead 1 of column 3 and 2 of column 4. In that case, we can take 1 of column 1 and 3 of column 2. This gives us 
.
, 
, 
, 
, and 
where:
, 
, 
:
instead of 