![]()
1. Average velocity.
It is at
.
The total distance travelled is
2. Smoking and heart disease.
Let the total number of people be 1000x. Then 20x
have heart disease, and of these, 12x are smokers. There are
980x with no heart disease, of which 196x are
smokers. Thus 12x of the 208x smokers have heart
disease, and the fraction called for is 12/208=3/52.
3. Too large a rectangle.
If the rectangle does not extend above the curve, then it is contained
in some rectangle inscribed in the region between the curve and the
x-axis
with base on the x-axis, so it suffices to show that the maximum
area of such a rectangle is less than 257. It is, in fact, 256, as we show.
Let (x, 80-x4) be the upper right corner of a
rectangle inscribed in the region described. Then the area of the rectangle
is at most
Second solution, courtesy of Charles McCarthy (U.MN-TC)
It suffices to show that 257/x > 80-x4
for all x>0; equivalently, that
If
,
then
so
.
If 0<x<3, then
.
4. Limit of a fraction.
The limit is
.
If
and g is continuous, then by the Fundamental Theorem of Calculus,
.
In particular here, if
,
then we have
.
Then

and
.
Second solution
If we call the numerator F(h), then
.
By L'Hôpital's Rule, the limit of the fraction is
5. Evenly spaced roots.
The only such k is
.
Let f(x)=(x2-1)(x2-4)-k.
Since f(-x)=f(x), the roots are of the
form -b, -a, a, b, with b>a>0.
For these to be equally spaced we need b-a=a-(-a),
so b=3a. Thus,
f(x)=(x-a)(x+a)(x-3a)(x+3a);
By comparing coefficients of x2 we see that a2=1/2,
and by comparing constant terms, that 4-k=9a4=9/4,
so that k=4-9/4=7/4.
6. Final ones.
Yes. We prove by induction that for every positive integer
m
there is an integer n ending in 1 for which n3
ends in m ones. With m=1 we may use 13=1. Suppose
that n is an integer ending in 1 for which n3
ends in m ones; say
where there are m final ones. Then if k is any positive integer we have

where A is a positive integer and there are m ones in
the final group. This number will end in m+1 ones provided that
3kn2+r ends in 1. Since n ends in 1, 3kn2
has the same final digit as 3k, so it suffices that 3k+r
end in 1. For every positive integer r such a k exists, since
3 has an inverse modulo 10, (
,
and the proof is complete.
7. Simplify this sum.
The sum is
.

8. Trigonometric inequality. (Solution by Ron Rietz, Gustavus Adolphus College)
By the AM,GM inequality,
![\begin{displaymath}\null\,\vcenter{\openup1\jot \ialign{\strut\hfil$\displayst......]\cr&={1\over2}[4-(1-\cos x)^2-(1-\cos y)^2]\le2.\cr\crcr}}\,\end{displaymath}](img30.gif)
Second solution, courtesy of Charles McCarthy
.
9. Perimeter 6 and integral area.
There is just one such triangle. Its legs are
and
,
and its area is ab/2=1. Here is a proof. For a right triangle with
legs a and b to have perimeter 6 and integral area it is
necessary and sufficient that
where n is a positive integer. From
we have
which simplifies to
There are various ways to obtain an upper bound on n. E.g., 3<a+b<4because
the two legs must account for more than half and less than 2/3 of the perimeter.
Then (3) yields 9<9+n<12, so n=1 or 2. But if n=2
then
,
and substituting
into (1) yields only nonreal values for a. Thus n=1 is the
only possibility. Then from (3) and (2) we have a+b=10/3
and ab=2, which leads to
The roots are
.
When
then
,
so both yield the same triangle.
10. Bigger than 2000 for large n. Solution by Macalester
Team 4.
Any integer n>e2000 suffices. For,

and
when n>e2000.
Second solution, by Carleton A team
We claim that n=24000 suffices. With this value
of n, (omitting the term
),
