Solutions
-
49.
-
Find all ordered pairs
that are solutions
of the following system of two equations (where
is a
parameter):
Find all values of the parameter
for which the solutions of
the system are two pairs of nonnegative numbers. Find the
minimum value of
for these values of
.
Solution. We need to assume that
.
Substitute
into the second equation to
obtain
This can be manipulated to
from which we find that
For
and
to be nonnegative for both solutions, we require
all of the four inequalities:
The last two equations entail that
or
.
When
, the first two inequalities fail to hold, while
if
, all four equations hold. Thus, the solutions
are two pairs of nonnegative numbers when
.
When both
and
are nonnegative, then
.
When
, we obtain the solutions
and
,
and in the latter case,
. Hence the minimum value of
is 2.
Comment. The minimum of
can be also obtained
with more effort directly from the solutions in terms of
.
Now
. Since
for
,
assumes its minimum
value of 6 when
. Since
for
,
assumes its minimum value
of 2 when
. Hence the minimum possible value of
is 2.
-
50.
-
Let
be a natural number exceeding 1, and let
be the set of all natural numbers that are
not relatively prime with
(i.e.,
.
Let us call the number
magic if for each two numbers
, their sum
is also an element of
(i.e.,
for
).
-
-
(a) Prove that 67 is a magic number.
-
-
(b) Prove that 2001 is not a magic number.
-
-
(c) Find all magic numbers.
Solution. [O. Bormashenko] (a) 67 is prime, so that
all numbers that are not relatively prime with 67 and are
elements of
are the multiples of 67. The sum
of two such numbers is also a multiple of 67, and hence
belongs to
. Therefore 67 is a magic number.
(b)
. Now 3 and 23 belong to
, but 26 = 3 + 23 does not, because
gcd (26, 2001) is equal to 1. Thus, 2001 is not a magic number.
(c) First, let us prove that all prime powers are magic numbers.
Suppose that
for some prime
and positive integer
. Then the numbers not relatively prime to
are
precisely those that are divisible by
(as this is the
only prime that can divide any divisor of
). The sum of
any two such numbers is also divisible by
, so that
is closed under addition and
is magic.
Now suppose that
is not a power of a prime. Then
,
where
and
are two relatively prime numbers exceeding 1.
Clearly,
and
belong to
. However, gcd
= gcd
= 1, and gcd
= gcd
= 1, so that
is relatively prime to both
and
, and hence to
. Thus,
, so that
is not magic.
We conclude that the set of prime powers equals the set of
magic numbers.
-
51.
-
In the triangle
,
,
and
. Prove that, for this triangle, the angle bisector
from
, the median from
and the altitude from
are
concurrent (i.e., meet in a common point).
Solution. [K. Ho] Denote by
the intersection
of
with the median from
(so that
is the
midpoint of
), by
the intersection of
with the altitude from
(so that
),
by
the intersection of
and the bisector from
, and by
the length of
. Then
. By the angle-bisector theorem,
. By the pythagorean
theorem for the triangles
and
,
.
Thus,
and
, so that
. Since
, Ceva's
theorem tells us that
,
and
are concurrent.
-
52.
-
One solution of the equation
is
. Given that
and
are rational
numbers, determine its other two solutions.
Solution 1. [R. Barrington Leigh] Since
satisfies the given equation,
Since
and
are rational, this is possible only when
, or
.
The equation is thus
.
By inspection, we find that 2 is a root, and so the three
roots turn out to be
,
and
.
Comment. Once 2 and
are known to be roots,
we can get the third root by noting that the sum of the roots
is
.
Solution 2. A more structural way of getting the
result is to note that the mapping that takes a
surd
(with
and
rational) to its
surd conjugate
preserves addition,
subtraction and multiplication (i.e., the
surd conjugate of the sum (resp. product) or two
surds is equal to the sum (resp. product) of the
surd conjugates. The surd conjugate of a rational
is the rational itself. Tranforming all the elements
of the equation to their surd conjugates, gives the
same equation with
replaced by its surd conjugate.
Thus, the surd conjugate
of
also satisfies the equation.
The quadratic with these as roots is
, and this quadratic must be a factor
of the given cubic. Since
, we must have
, whence
,
and
and the third root is 2.
-
53.
-
Prove that among any 17 natural numbers chosen from
the sets
, it is always possible
to find two whose product is a perfect square.
Solution. [K. Ho] Consider the following 16 sets:
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
. In any of the
sets with more than one element, the product of any two
elements is a perfect square. Any choice of 17 numbers from
among these sets must, by the Pigeonhole Principle,
yield at least two from the same set. The product of these
two must be a square. The desired result follows.
-
54.
-
A circle has exactly one common point with each of the
sides of a
sided polygon. None of the vertices of the
polygon is a point of the circle. Prove that at least one of the
sides is a tangent of the circle.
Solution. [J.Y. Jin] Assume that none of the sides is
tangent to the circle. Let
be
the consecutive vertices of a
sided polygon. Each side
of the polygon has exactly one common point with the circle, none
of the vertices lies on the circle and, by assumption, none of
the sides is tangent to the circle. Therefore, for each side,
one of the endpoints lies inside the circle and the second
endpoint lies outside the circle. Colour the vertices inside
the circle blue and the ones outside the circle red. Apparently,
the colours of the consecutive vertices alternate (
i.e.,
blue, red, blue, red, etc.). Since there are
vertices,
and
must have the same colour. However,
these two vertices are the endpoints of a side of the polygon
and so they cannot have the same colour. Thus, the assumption
leads to a contradiction, and so at least one of the
sides is tangent to the circle.