We will show that two classical extremal problems concerning polynomials are equivalent. One is the problem of finding the extremal growth of a polynomial which is bounded by one on a prefixed compact set and the other is a problem of optimal statistical designs. Both problems were studied more than half a century ago. The connection of both problems allows us to improve on some problem of Erdös. This is joint work with N. Levenberg and L. Bos.