17th Austrian-Polish 1994

------
1.  f is a real-valued function on the reals such that f(x + 19) ≤ f(x) + 19 and f(x + 94) ≥ f(x) + 94 for all x. Show that f(x + 1) = f(x) + 1 for all x.
2.  The sequences a0, a1, a2, ... and b0, b1, b2, ... are defined by a0 = 1/2, an+1 = 2an/(1 + an2), b0 = 4, bn+1 = bn2 - 2bn + 2. Show that an+1bn+1 = 2b0b1 ... bn.
3.  Each cell of a 2 x 15 board is made into a room. The 43 interior walls are labeled from 1 to 43. Wall n has dn doors, where dn = 0, 1, 2 or 3. The doors are arranged so that each room has a total of three doors and it is possible to get from any room to any other room. How many possible arrangements are there for (d1, d2, ... , d43).
4.  P is a regular (n+1)-gon. One vertex is labeled 0. There are n! ways of labeling the other vertices 1, 2, ... , n. For each such labeling take the sum of the (positive) difference between the labels at the end of each side. For example, if n = 5 and the vertices are labeled 0, 3, 1, 4, 2, 5, then the sum is 3 + 2 + 3 + 2 + 3 + 5 = 18. Find the smallest possible such sum f(n) and the number of possible labelings which give it.
5.  Find all integer solutions to (a + b)(b + c)(c + a)/2 + (a + b + c)3 = 1 - abc.
6.  n is an odd integer and the non-negative integers a1, a2, ... , an satisfy:
(a2 - a1)2 + 2(a2 + a1) + 1 = n2
(a3 - a2)2 + 2(a3 + a2) + 1 = n2
...
(a1 - an)2 + 2(a1 + an) + 1 = n2.
Show that there are two consecutive ai which are equal (we treat an and a1 as consecutive).
7.  Find all two digit numbers n = ab such that (xa - xb) is divisible by n for all integers x.
8.  Let R be the reals. For each real a, b, find all functions f: R2 → R which satisfy f(x, y) = a f(x, z) + b f(y, z) for all x, y, z.
9.  The points A, B, C, D lie on a line in that order, with AB = a, BC = b, CD = c. Show that a point P exists such that ∠APB = ∠BPC = ∠CPD iff (a + b)(b + c) < 4ac. If the point exists, show how to construct it.

To avoid possible copyright problems, I have changed the wording, but not the substance, of the problems.

APMC home
 
© John Scholes
jscholes@kalva.demon.co.uk
18 Dec 2002
Last corrected/updated 18 Dec 2002