Navigation Panel: (These buttons explained below)

International Mathematical Talent Search

# Round 20

Problem 1/20. Determine the number of points (x,y) on the hyperbola
2xy - 5x + y = 55
for which both x and y are integers.

Problem 2/20. Find the smallest value of n for which the following statement is true: Out of every set of n positive integers one can always choose seven numbers whose sum is divisible by 7.

Problem 3/20. The husbands of 11 mathematicians accompany their wives to a meeting. Sometimes the husbands pass one another in the halls, but once any particular pair have passed each other once, they never pass each other again. When they pass one another, either only one of them recognizes the other, or they mutually recognize each other, or neither recognizes the other. We will refer to the event of one husband recognizing another one as a "sighting", and to the event of them mutually recognizing each other as a "chat", since in that case they stop for a chat. Note that each chat accounts for two sightings.

If 61 sightings take place, prove that one of the husbands must have had at least two chats.

Problem 4/20. Suppose that a and b are positive integers such that the fractions a/(b-1) and a/b, when rounded (by the usual rule; i.e., digits 5 and larger are rounded up, while digits 4 and smaller are rounded down) to three decimal places, both have the decimal value .333.

Find, with proof, the smallest possible value of b.

Problem 5/20. In the figure shown below, the centres of the circles , , and are collinear, A and B are the points of intersection of and , and C is a point of intersection of and the extension of AB. Prove that the two small circles shown, tangent to , and BC, and to , and BC, respectively, are congruent to one another.

Solve as many of the problems as you can (you need not solve them all), and mail your solutions to:

Professor E. J. Barbeau
Department of Mathematics
University of Toronto
Toronto, ON M5S 3G3