Problem #PRU-35154

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

Problem

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