In the plane,
red points and
blue points are marked so that no three of the marked points are collinear. One needs to draw
lines not passing through the marked points and dividing the plane into several regions. The goal is to do it in such a way that no region contains points of both colors.
Find the minimal value of
such that the goal is attainable for every possible configuration of
points.



Find the minimal value of


Let
be an integer. Consider all circular arrangements of the numbers
; the
rotations of an arrangement are considered to be equal. A circular arrangement is called beautiful if, for any four distinct numbers
with
, the chord joining numbers
and
does not intersect the chord joining numbers
and
.
Let
be the number of beautiful arrangements of
. Let
be the number of pairs
of positive integers such that
and
. Prove that









Let







Let
be an acute-angled triangle with orthocenter
, and let
be a point on side
. Denote by
and
the feet of the altitudes from
and
, respectively. Denote by
the circumcircle of
, and let
be the point on
which is diametrically opposite to
. Analogously, denote by
the circumcircle of
, and let
be the point on
which is diametrically opposite to
. Prove that
,
and
are collinear.




















