Putnam 1964 A1. Let D be the longest distance between any pair, and d the shortest distance. This part is divided by x n into two sub-intervals, lengths a n and b n . S is a finite set of collinear points. S is a finite set.
R is the reals.
Let a n be a strictly monotonic increasing sequence of positive integers. D is a disk. To avoid possible copyright problems, I have changed the wording , but not the substance , of all the problems. Out of print, but available in some university libraries.