Solutions
-
73.
-
Solve the equation:
Solution 1. By inspection, we find that
satisfies the equation. We show that no other value of
does so. Observe that
.
When
, the second term of the left side exceeds 1
while the right side is less than 1, so the equation is
not satisfied. Henceforth, let
and let
and
.
Note that, if
, then
is an increasing function of
. Thus,
is increasing and
is decreasing as
increases. If
, then
, while if
, then
. The desired result follows.
Solution 2. The equation can be rewritten in
the form
where
and
.
Note that
, so that each term is a
strictly decreasing function of
. Thus,
assumes each of its values at most once, and since
, we find that
is the only solution.
Solution 3. Observe that
and
The equation becomes
This holds for
. If
, then
and so
with a similar inequality for the sine function.
Thus, when
, the left side is less than 1.
Similarly, it can be shown that when
,
the left side exceeds 1. Hence the unique solution
is
.
Comment. Generally, the solutions involved a function
similar to that used in Solution 2, and it was shown that
it was impossible for there to be more than one solution.
Some students came up with the use of trigonometry as in
Solution 3.
-
74.
-
Prove that among any group of
natural numbers, there can be found two
numbers so that their sum or their difference is
divisible by
.
Solution 1. For
, let
be the subset of numbers
among the
numbers
for which
differs from either
or
by a
multiple of
. Since there are
numbers and
only
subsets, the Pigeonhole Principle provides
that some subset must contain at least two numbers
and
, say. Either
and
both leave the
same remainder upon division by
and so differ
by a multiple of
, or else one of them
differs from
by a multiple of
while the other
differs from
by a multiple of
. In the
latter case,
is a multiple of
.
Solution 2. [A. Fink] Consider an arbitrary set of
natural numbers. If any two are congruent modulo
, then their difference is divisible by
and
the result follows. Suppose otherwise, that all numbers
have distinct residues modulo
. Apportion these
residues into the
sets:
,
,
,
,
,
. Since there are
numbers, at least one of these sets must
contain two residues, and so the two numbers
involved must sum to a multiple of
.
-
75.
-
Three consecutive natural numbers, larger than
3, represent the lengths of the sides of a triangle. The
area of the triangle is also a natural number.
-
-
(a) Prove that one of the altitudes ``cuts'' the triangle
into two triangles, whose side lengths are natural numbers.
-
-
(b) The altitude identified in (a) divides the side
which is perpendicular to it into two segments. Find the
difference between the lengths of these segments.
Solution 1. Let the side lengths be
,
,
. By Heron's formula, the area
of the triangle
is given by
Since
is an integer,
must be even and
must be the square of a multiple of
.
Hence for some integer
, we have that
or
.
(Comment. This is a Pell's equation and it has
infinitely many solutions
given
by
and
.
(a) The area
of the triangle is
where
is even and
.
The altitude to the side of length
is
,
an integer. This is the desired altitude.
(b) The triangle is subdivided by the altitude in (a) into
two right triangles whose hypotenuses have lengths
and
. Hence, the side of length
is split into
two parts of lengths
and
The difference between the lengths of these segments is
4. (Note that the sum is
. as expected.)
(Exercise. Give some numerical examples.)
Solution 2. [L. Tchourakov] With the above notation,
we find that
, so that the
length of the altitude to the side of length
is
. If
were odd, then
the numerator of the fraction for
would be odd and
not an integer. Hence
is even, and so is the
altitude. Let
be one of the two parts of the side
cut off by the altitude. By the pythagorean theorem,
so that
. Since
is even,
is an
integer. The altitude cuts the side into parts of
length
and
, and so (b) follows.
-
76.
-
Solve the system of equations:
(The logarithms are taken to base 10.)
Solution 1. Let
,
and
. Note that
is nonzero.
The equations become
Squaring and adding the equations
and
yields
, or
. We can also write the system
as
which can be solved to yield
Hence
The two relevant solutions are
and
.
When
,
, which leads to
.
When
,
, so that
.
The desired solutions are
.
Solution 2. With the same notation as (1), we can
write the given equations in terms of
and
.
Multiply the first equation by
and the second by
and add them to obtain the equation
,
whereupon
. Eliminating
from the
second equation yields
, whereupon
or
. The remaining part of the solution
is easily completed.
-
77.
-
points are chosen from the circumference or
the interior of a regular hexagon with sides of
unit length, so that the distance between
any two of them is not less than
. What is the largest
natural number
for which this is possible?
-
78.
-
A truck travelled from town
to town
over several days. During the first day, it covered
of the total distance, where
is a natural number.
During the second day, it travelled
of the
remaining distance, where
is a natural number.
During the third day, it travelled
of the distance
remaining after the second day, and during the fourth day,
of the distance remaining after the third day.
Find the values of
and
if it is known that, by the
end of the fourth day, the truck had travelled
of the distance between
and
. (Without loss of
generality, assume that
.)
Solution. [R. Furmaniak, J. Rin]
Let
be the distance remaining at the
beginning of a two-day period. The distance remaining at the
end of the period is
Thus, every two days the remaining distance is reduced by
a factor of
. (Note that
this is symmetric in
and
.) After four days, the
distance remaining is reduced by a factor of
; it
is given in the problem that this is
. Hence
.
Hence
Since
and
are positive integers with
,
we must have
and
, i.e.,
.