Problem #PRU-35154

Problems Methods Examples and counterexamples. Constructive proofs Pigeonhole principle Pigeonhole principle (other) Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

Prove that multiplying the polynomial (x+1)n1 by any polynomial different from zero, we obtain a polynomial having at least n nonzero coefficients.