We study the problem of determining the minimal degree d(m) of a polynomial that has all coefficients in {0, 1} and a zero of multiplicity m at -1. We show that a greedy solution is optimal precisely ...