International Mathematical Talent Search

2xy - 5x + y = 55for 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 C_0, C_1, and C_2 are collinear, A and B are
the points of intersection of C_1 and C_2, and C is a point of
intersection of C_0 and the extension of AB. Prove that the two
small circles shown, tangent to C_0, C_1 and BC, and to C_0,
C_2 and BC, respectively, are congruent to one another.

**** C * oo o |* * o o| o* * o o|o o* * oo o |o o* * xxx | ooo * x x |++++ * x +B + * *x + |x +* x + | x + **** = circle C_0 ---------@--@+--|-x-@----+--- @ = centre of circles C_0, C_1, and C_2 x + | x + xxxx = circle C_1 *x + |x +* ++++ = circle C_2 * x +A + * oooo = the two small circles mentioned x x |++++ * xxx | * * | * * | * * |* ***

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

Professor E. J. BarbeauMake sure that the front page of your solutions contains your

Department of Mathematics

University of Toronto

Toronto, ON M5S 3G3

These problems are made available through the quarterly journal

This page last updated: February 3, 1997

Original Web Site Creator / Mathematical Content Developer: Philip Spencer

Current Network Coordinator and Contact Person: Joel Chan - mathnet@math.toronto.edu

Navigation Panel:

Go backward to Round 19

Go up to Talent Search Index

Switch to graphical version (better pictures & formulas)

Access printed version in PostScript format (requires PostScript printer)

Go to University of Toronto Mathematics Network Home Page