Slični zadaci
Regard a plane with a Cartesian coordinate system; for each point with integer coordinates, draw a circular disk centered at this point and having the radius
.
a) Prove the existence of an equilateral triangle whose vertices lie in the interior of different disks;
b) Show that every equilateral triangle whose vertices lie in the interior of different disks has a sidelength 96.
Radu Gologan, Romania
Remark
[The " 96" in (b) can be strengthened to " 124". By the way, part (a) of this problem is the place where I used the well-known "Dedekind" theorem.]

a) Prove the existence of an equilateral triangle whose vertices lie in the interior of different disks;
b) Show that every equilateral triangle whose vertices lie in the interior of different disks has a sidelength 96.
Radu Gologan, Romania
Remark
[The " 96" in (b) can be strengthened to " 124". By the way, part (a) of this problem is the place where I used the well-known "Dedekind" theorem.]
Let
be an isosceles triangle with
, whose incentre is
. Let
be a point on the circumcircle of the triangle
lying inside the triangle
. The lines through
parallel to
and
meet
at
and
, respectively. The line through
parallel to
meets
and
at
and
, respectively. Prove that the lines
and
intersect on the circumcircle of the triangle
.
comment
(According to my team leader, last year some of the countries wanted a geometry question that was even easier than this...that explains IMO 2003/4...)
[Note by Darij: This was also Problem 6 of the German pre-TST 2004, written in December 03.]
Edited by Orl.





















comment
(According to my team leader, last year some of the countries wanted a geometry question that was even easier than this...that explains IMO 2003/4...)
[Note by Darij: This was also Problem 6 of the German pre-TST 2004, written in December 03.]
Edited by Orl.
In the coordinate plane consider the set
of all points with integer coordinates. For a positive integer
, two distinct points
,
will be called
-friends if there is a point
such that the area of the triangle
is equal to
. A set
will be called
-clique if every two points in
are
-friends. Find the least positive integer
for which there exits a
-clique with more than 200 elements.
Proposed by Jorge Tipe, Peru














Proposed by Jorge Tipe, Peru