Solutions
-
109.
-
Suppose that
Find, in terms of
, the value of the expression
Solution 1. Simplifying, we obtain that
and, by extension, that
Continuing on, we find that
Comment. R. Barrington Leigh defined a formula
for
which he then applied to
.
-
110.
-
Given a triangle
with an area of 1.
Let
be a natural number. Suppose that
is a point on the side
with
,
is a point on the side
with
, and
is a point on the side
with
.
Suppose also that
,
and
, where
signifies that the singleton
is the intersection of the indicated segments. Find the
area of the triangle
in terms of
.
Solution 1. [R. Furmaniak, Y. Ren] The area of a triangle
will be denoted by
. Consider the triangle
and the line
that intersects
at
,
at
and
at the external point
. By Menelaus' Theorem
for the triangle
and transversal
,
Observe the triangles
and
. Since the heights from
to the opposite sides
and
coincide, then
Examining triangles
and
, we similarly find that
Since the heights of triangles
and
from
to
and
coincide, it follows that
Similarly,
Now
Solution 2. [M. Butler] Using Menelaus' Theorem with
triangle
and transversal
, we find that
so that
Thus,
whence
Therefore
Solution 3. Let
,
,
,
,
,
and
. Then
using
,
,
and
Analogously, from
and
, we get
and
whence
and
>From
,
we find that
whence
Solution 4. Since the ratio of areas remains invariant
under shear transformations and dilations, we may assume that
the triangle is right isosceles. Assign coordinates:
,
,
,
,
Then
and
A computation of the area of
now yields the result.
Comment. Considering how reasonable the result it, H. Lee
noted that when
, then
, so that
as expected, and also noted that when
, we
get the special case of the medians that intersect in a common
point and yield
.
-
111.
-
(a) Are there four different numbers, not exceeding
10, for which the sum of any three is a prime number?
-
-
(b) Are there five different natural numbers such
that the sum of every three of them is a prime number?
Solution. [R. Barrington Leigh] (a) Yes, there are four
such numbers. The three-member sums of the set
are the primes 11, 13, 17, 19.
(b) No. We prove the statement by contradiction. Suppose that there
are five different natural numbers for which every sum of three is
prime. As the numbers are distinct and positive, each such sum must
be at least
, and so cannot be a multiple of 3.
Consider the five numbers, modulo 3. If there are three in the same
congruent class, their sum is a multiple of 3. If there is one
each congruent to 0, 1, 2 modulo 3, then the sum of these three is
a multiple of 3. Otherwise, there are only two congruence classes
represented with at most two numbers in each, an impossibility.
Hence in all cases, there must be three who sum to a multiple of 3.
Comment. Part (b) need not be framed as a contradiction.
One could formulate it as follows: Let five positive integers be
given. Argue that either each congruent class modulo 3 is
represented or that some class is represented by at least three
of the numbers. Then note that therefore some three must sum to
a multiple of 3. Observe that 3 itself is not a possible sum.
Hence, among every five positive integers, there are three who
add to a nonprime multiple of 3, and simply say that the answer to
the question is ``no''.
-
112.
-
Suppose that the measure of angle
in the
triangle
is equal to
. A line passing through
the vertex
is perpendicular to the angle bisector of
and intersects the line
at the point
.
Find the other two angles of the triangle
in terms of
, if it is known that
.
Solution. Let
be the line through
perpendicular to
the bisector of angle
; this line bisects the external angle
at
. The possibility that
is parallel to
is precluded
by the condition that it intersects
at
. Let
and
, Since
is not parallel
to
,
is not equal to
.
Case i. Suppose that
. Then
intersects
so that
lies between
and
. Let
be produced to
so that
. Since
,
and so
(exterior angle). Since
,
.
Since
produced bisects
,
produced right
bisects
and so
. Therefore
whence
. Therefore,
and
Case ii. Supppose that
. Then
intersects
so that
lies between
and
. Let
be produced to
so that
. Since
bisects
, it right
bisects
and so triangle
is isosceles. Then
. Since
,
. Since
(exterior angle),
,
so that
and
.
Question. Why cannot you just say the second case can be
handled as the first case, by symmetry?
-
113.
-
Find a function that satisfies all of the following
conditions:
-
-
(a)
is defined for every positive integer
;
-
-
(b)
takes only positive values;
-
-
(c)
;
-
-
(d)
Solution. [R. Barrington Leigh] The function for which
for every positive integer
satisfies the condition.
[
Exercise: establish this by induction.] We now show that
this is the only example. Substituting
into (d) and
noting that
, we find that
, whence
. Applying (d) to two consecutive values of the argument
yields that
whence
Substituting
and
into this and noting that
and
, we find that
and
whence
Since the first and third factors are positive for all postive
possibilities for
, we must have
. As
we can prove by induction that
for all positive integers
.
-
114.
-
A natural number is a multiple of 17. Its binary
representation (i.e., when written to base 2) contains
exactly three digits equal to 1 and some zeros.
-
-
(a) Prove that there are at least six digits equal
to 0 in its binary representation.
-
-
(b) Prove that, if there are exactly seven digits equal
to 0 and three digits equal to 1, then the number must be even.
Solution 1. (a) If there are fewer than six digits equal to
0 in its binary representation, then the number must have at
most eight digits and be of the form
where
. The first eight powers of
2 with nonnegative exponent are congruent to
modulo 17, and the sum of any three of these
cannot equal to zero and must lie between
and
.
Hence it is not possible for three powers of 2 among the first
eight to sum to a multiple of 17. Hence, the number must have
at least nine digits, including three zeros.
(b) Suppose that the number is equal to
where
. If this number has exactly 10 digits
and is odd, then
and
, so that the number is
equal to
(mod 17).
But there is no value of
that will make this vanish, modulo
17. Hence, a 10-digit number divisible by 17 must be even.
An example is
.
Solution 2. [R. Furmaniak] (a) Since
, any
binary number
with four or fewer digits multiplied by 17
will yield
. Since the first and last four digits are
the same, there must be an even number of 1s. Thus, any multiple
of 17 with exactly three binary digits must be a product of 17 and
a number that has at least 5 binary digits. Every such product must
have at least 9 digits, and so at least three digits equal to 0.
(b) As in Solution 1.