Problem #PRU-35154

Problems Methods Examples and counterexamples. Constructive proofs Pigeonhole principle Pigeonhole principle (other) Set theory and logic Algorithm Theory Algorithm Theory

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.