  We examine the maximal number of zeros a polynomial of degree at most n with
constrained coefficients may have at 1. Our results are essentially sharp and
extend earlier results of this variety. An interesting connection to certain
extensions of the Coppersmith-Rivlin inequality is explored.
