Analyzing the Setup
Imagine standing before a massive wall of 100 brackets, all lined up: P(x)=(x−1)(x−2)(x−3)…(x−100). This is a polynomial of degree 100 because each of the 100 brackets contributes exactly one x to the product.
If you were to multiply them all out, the highest power you could possibly form is x100. Today, we are hunting for the coefficient of x99.
The Combinatorial Logic
To understand how the x99 term is born, we must think like a combinatorialist. When you expand a product of brackets, you are essentially making a choice for every single bracket.
From each bracket, you must pick either the x or the constant term. To end up with x99, you must choose the x from exactly 99 brackets. This leaves you with exactly one bracket from which you must choose the constant term.
There are 100 brackets. You can choose the constant from the first bracket (−1), or the second (−2), or the third (−3), and so on, all the way to the 100th (−100). Each of these choices creates a term of the form −k⋅x99.
The Summation
If we sum all these individual contributions, we get:
(−1)x99+(−2)x99+(−3)x99+⋯+(−100)x99
By factoring out the x99, we are left with the negative sum of the first 100 natural numbers:
This is where the beauty of Vieta's relations shines. Vieta's formulas tell us that for any monic polynomial, the coefficient of the second-highest power is always the negative sum of the roots. Here, our roots are 1,2,3,…,100.
The Final Calculation
Now, we calculate the sum of the first 100 integers using the elegant formula for the sum of an arithmetic progression:
Substituting n=100, we get:
2100(100+1)=2100×101=50×101=5050
Since our coefficient is the negative of this sum, the final coefficient of x99 is −5050. This is a clean, satisfying result that emerges from the deep symmetry of the polynomial.