Solutions
-
31.
-
Let
,
,
be positive real numbers
for which
. Find the minimum
value of
Solution 1. [S. Niu] Let
,
and
. Then
,
,
are positive, and the problem
becomes to minimize
subject to
. Since
we have that
. Thus,
so
with equality if and only if
, or
. The desired result follows.
Solution 2. We have that
by the Arithmetic-Geometric Means Inequality. Equality holds
if and only if
, which is equivalent to
. Hence
if and only if
.
-
32.
-
The segments
and
are altitudes of the
acute triangle
, where
and
are points on the
segments
and
, respectively.
is
inscribed in the circle Q with centre
. Denote the
orthocentre of
by
, and the midpoints of
and
be
and
, respectively. Let
.
-
-
(a) Prove, that the quadrilateral
is a
square.
-
-
(b) Prove that the midpoint of both diagonals
of
is also the midpoint of the segment
.
-
-
(c) Find the length of
, if the radius of
Q has length 1 unit.
Solution 1. (a) Since
is the hypotenuse of
right triangles
and
,
. Since
is the hypotenuse of each of the right triangles
and
, we have that
.
Since
, triangles
,
and
are isosceles right triangles, so
and
,
.
Consider a
rotation with centre
that takes
. Then
,
,
so
and
.
Hence
and
.
But
and
, so
is an equilateral
quadrilateral with one right angle, and hence is a square.
(b) Consider a
rotation (half-turn) about the
centre of the square. It takes
,
and
. By part
(a),
and
.
Since
(by the half-turn),
.
Since
,
, so that
is a right isosceles triangle and
. Thus,
. Since
,
must be the centre of the circle through
. Hence
. Since
is the image of
by a half-turn about the
centre of the square, this centre is the midpoint of
as well as of the diagonals.
(c)
.
Solution 2. [M. Holmes] (a) Consider a Cartesian plane
with origin
and
axis along the line
.
Let the vertices of the triangle be
,
,
. Since the triangle is acute,
. The point E is at the intersection of the
line
(
) and a line through
with
slope
, so that
.
is the intersection point of the
lines
and
, so
is at
;
is the
midpoint of
, so
is at
;
is the midpoint of
, so
is at
. It can be checked that the midpoints of
and
are both at
.
The slope of
is
and that of
is the
negative reciprocal of this, so that
.
It is straightforward to check that the lengths of
and
are equal, and we deduce that
is a
square.
(b)
is the intersection point of the right bisectors of
,
and
. The line
is the right bisector
of
and the abscissae of points on the right bisector of
are all
.
Hence
is at
. It can be checked that
the midpoint of
agress with the joint midpoint of
and
.
(c) This can be checked by using the coordinates of points
already identified.
Comment. One of the most interesting theorems in
triangle geometry states that for each triangle there
exists a circle that passes through the following
nine special points: the three midpoints of the
sides; the three intersections of sides and
altitudes (pedal points); and the three midpoints
of the segments connecting the vertices to the
orthocentre. This circle is called the
nine-point circle. If
is the orthocentre and
is the circumcentre, then the centre of the
nine-point circle is the midpoint of
. Note that
in this problem, the points
belong to the
nine-point circle.
-
33.
-
Prove the inequality
,
if the numbers
,
,
are the lengths of the sides
of a triangle with perimeter 2.
Solution 1. Let
,
and
, so that
,
and
. Then
are all positive and
. The difference of the right and left sides
multiplied by 4 is equal to
as desired.
Solution 2. [L. Hong] The perimeter of the triangle
is
. We have that
Since
,
and
,
it follows that
,
,
, from which
the result follows.
-
34.
-
Each of the edges of a cube is 1 unit in length,
and is divided by two points into three equal parts.
Denote by K the solid with vertices at these points.
-
-
(a) Find the volume of K.
-
-
(b) Every pair of vertices of K is
connected by a segment. Some of the segments are
coloured. Prove that it is always possible to find
two vertices which are endpoints of the same number
of coloured segments.
Solution. (a) The solid figure is obtained by slicing
off from each corner a small tetrahedron, three of whose
faces are pairwise mutually perpendicular at one vertex;
the edges emanating from that vertex all have length
1/3, and so the volume of each tetrahedron removed is
.
Since there are eight such tetrahedra removed, the
volume of the resulting solid is
.
(The numbers of vertices, edges and faces of the solid
are respectively 24, 36 and 14.)
(b) The polyhedron has
vertices.
Each edge from a given vertex is joined to 23 vertices. The possible number
of coloured segments emanating from a vertex is one of the
twenty-four numbers, 0, 1, 2,
, 23. But it is not
possible for one vertex to be joined to all 23 others and
another vertex to be joined to no other vertex. So there
are in effect only 23 options for the number of coloured
segments emanating from each of the 24 vertices. By the
Pigeonhole Principle, there must be two vertices with the
same number of coloured segments emanating from it.
-
35.
-
There are
points on a circle whose
radius is 1 unit. What is the greatest number of
segments between two of them, whose length exceeds
?
Solution. [O.Bormashenko] The side of the equilateral
triangle inscribed in a circle of unit radius is
. So the segment with length
is a
chord subtending an angle of
at the centre.
Therefore, there is no triangle with three vertices on
the circle each of whose sides are longer than
.
Consider the graph whose vertices are all
given points
and whose arcs all have segments longer than
.
This graph contains no triangles.
Recall Turan's theorem (see the solution of problem 23
in Olymon 1:4: Let
be a graph with
vertices. Denote by
the number of its edges
and
the number of triangles contained in the graph.
If
, then
.
>From this theorem, it follows that the number of
segments with chords exceeding
is at most
.
To show that this maximum number can be obtained, first
construct points
on the circle, so that
the disjoint arcs
and
subtend angles of
at the
centre. If
is odd, place
points on the
arc
and
points on the arc
. Any segment
containing a point in
to a point in
must
subtend an angle exceeding
, so its
length exceeds
. There are exactly
such segments.
If
is even, place
points in each of the
arcs
and
, so that there are exactly
such segments.
In either case, the maximum number of segments
whose length exceeds
is
.
-
36.
-
Prove that there are not three rational
numbers
,
,
such that
Solution. Suppose the
,
and
, where
is the least common multiple of
the denominators of
,
and
. Then,
multiplying the given equation by
yields
A further multiplication by 4 and a rearrangement of
terms yields
This is of the form
for integers
.
Suppose that
is even. Then, considering the equation
modulo 4, we deduce that
must also be even.
We can divide the equation by 4 to obtain another
equation of the form (*) with smaller numbers.
We can continue to do this as long as the resulting
turns out to be even. Eventually, we
arrive at an equation for which
is odd, so that
the right side is congruent to 7 modulo 8. But there
is not combination of integers
,
and
for which
(mod 8), so that the equation is
impossible.