Please send your solutions to
Professor E.J. Barbeau
Department of Mathematics
University of Toronto
Toronto, ON M5S 3G3
no later than October 31, 2001.

Notes. A unit cube (tetrahedron) is a cube (tetrahedron) all of whose side lengths are 1.

Let m be a positive integer, and let f(m) be the smallest value of n for which the following statement is true:
given any set of n integers, it is always possible to find a subset of m integers whose sum is divisible by m
Determine f(m).
[Comment. This problem is being reposed, as no one submitted a complete solution to this problem the first time around. Can you conjecture what f(m) is? It is not hard to give a lower bound for this function. One approach is to try to relate f(a) and f(b) to f(ab) and reduce the problem to considering the case that m is prime; this give access to some structure that might help.]

Determine a value of the parameter θ so that

f(x)cos2 x+cos2 (x+θ)-cosxcos(x+θ)

is a constant function of x.

Prove that there exists exactly one sequence { xn } of positive integers for which

x1 =1, x2 >1, xn+1 3 +1= xn xn+2

for n1.

Prove that within a unit cube, one can place two regular unit tetrahedra that have no common point.

Find all pairs (x,y) of positive real numbers for which the least value of the function

f(x,y)= x4 y4 + y4 x4 - x2 y2 - y2 x2 + x y + y x

is attained. Determine that minimum value.

Given positive numbers ai with a1 < a2 << an , for which permutation ( b1 , b2 ,, bn ) of these numbers is the product

Πi=1 n ( ai + 1 bi )


Determine all real-valued functions f(x) of a real variable x for which

f(xy)= f(x)+f(y) x+y

for all real x and y for which x+y0.