Team Problems February, 2001
Team Problems February, 2001
Team Problems February, 2001
February, 2001
Instructions: Answer as many of the problems below as you can. At the end of the time
allotted, turn in a list of your answers. Your answers should be expressed in simplest form.
Exact answers are required on all problems.
f (2) = 3,
f (3) = 5,
f (4) = 7,
and f (5) = 9.
7. A triangle has two sides of length 5 and one side of length 6. A rectangle R is formed
with one edge on the side of length 6 and a vertex (or corner point) on each of the other
two sides. What is the maximum possible value for the area of R?
8. Let
N = 1096 1080 + 1064 1048 + 1032 1016 + 1.
Then
1
= 0.d1 d2 d3 . . . dr
N
(so that the block of digits d1 d2 d3 . . . dr repeats indefinitely). There is more than one
value of r for which such digits d1 , d2 , . . . , dr exist. If the smallest such r is k, then it is
known (and not so hard to show) that every such value of r is divisible by k. What is the
value of k?