![]()
1. Mind reading.
Let the three numbers be a, b and c. Then the result
of the calculation is
((5a + 7) 2 + b) 10 + c
which upon expansion may be written
If you subtract 140 from this result, you have the three digit number with digits a, b and c. Thus
(a) 401-140=261, so the numbers she rolled were 2, 6 and 1, in that order. (One still needs to show this solution is unique. To do so, look at the equation 100a+10b+c=261 modulo 10 to get c=1, subsitute this back in, divide by 10, etc.)(b) Subtract 140 from the announced result, and the three digits of the resulting number are the numbers on the dice, in order.
2. Function iteration.
The answer is
We
have
3. Unique factorization.
No, it is not unique. We show that (x+4)(x+5)=x2+3x+2
is a different factorization. Direct computation shows that this is a valid
factorization. Now, the only units in the ring R[x] are those
in
R, namely 1 and 5: 1 . 1 = 1and
5 . 5 = 1. Thus the only associates of (x+1)
are itself and 5(x+1)=5x+5, and of (x+2), itself
and 5(x+2)=5x+4. Thus (x+4)(x+5) is in
fact a different factorization of x2+3x+2.
4. An integral.
5. Every non-constant function?
Suppose on the contrary that for every x and h we have
Then
![]()
![]()
for every x, and therefore that f is constant.
Second solution
Here is a direct proof. Let a and b be points with a
<
b
and
and let
c =| f(b)-f(a) |. Given any positive integer n, partition
the interval [a,b] into n subintervals, each of length (b-a)/n
by the points a0 < a1 <
.
. . <
an = b, and write
![]()
so for some k we have

when

6. A double inequality.
We begin with the first inequality. Since 2a < b+c,
this
is equivalent to
ab+ac-2a2 < bc-a2;
i.e., to
Since a < c and (b-a)
> 0, (1) is true, so the desired inequality is likewise.
Note that because of the symmetry in band
c in the problem, we may assume without loss of generality
that
The second
inequality is then equivalent to
bc-a2 < b2+bc-2ab;
which is true because
Therefore the second inequality holds as well.
7. A pair of equations.
There are no solutions. For, these equations imply that a=1999
z/x
and b=1999 z/y, with
z/x + z/y = 1, so thatab=1999.
Since a andb are to be positive
integers, and 1999 is prime, one of a and b
must be 1; say, a=1.
But since
then
a=1999 z/x is impossible.
8. Least upper bound.
The least upper bound is 1/2. There are several ways to find it. One
way is to put
,
express | z4-5z2+6
| = | z2-3| |z2-2| as
a function of
and
use calculus to find its maximum value. Here is a shorter solution: By
the triangle inequality we have

the desired least upper bound is 21/42=1/2.
9. Sum the series.
The sum is
.
We
show more generally that

The key is to look at this series in tandem with the series

Then, since these series are absolutely convergent,

10. A nonnegative function.
If we put q(x) = p(x) - pn(x), then
the given condition can be written q(x) - q'(x)
.
We show first that this implies q(x)
,
for all x, and then (as we'll see) it is an easy step to show that
p(x)
for all x.
That q(x) - q'(x)
implies that q(x) - q'(x) , and therefore q(x)
itself, has even degree and positive leading coefficient. Thus q(x)
has an absolute minimum at some point, say at b. Since
q'(b) = 0 we have
This implies that p(x) - pn(x) = q(x) is a
polynomial of even degree with leading coefficient positive. Then
p(x)
itself is a polynomial of even degree with leading coefficient positive.
Therefore
p(x) has an absolute minimum value, say
at x=a. At a minimum point, the second derivative
satisfies p''(a)
.
Then for all
x we have