1ax^0
1ax^1 + 1bx^0
1ax^2 + 2bx^1 + 1cx^0
1ax^3 + 3bx^2 + 3cx^1 + 1dx^0
1ax^4 + 4bx^3 + 6cx^2 + 4dx^1 + 1ex^0,
with their coefficients multiplied by entries drawn from Pascal's triangle. Makes everything nicer.
a(x + r)^n.
So in this case. all the roots coincide: all n of them are equal to -r = -b/a.
[(x + s)^n]a,
where s^2 means "do s twice," and s^3 means "do s three times," etc.
ax^2 + 2bx + c = (ax + b)x + (bx + c),
which makes it particularly easy to compute
a(ax^2 + 2bx + c) - (ax + b)^2,
which is the the polynomial counterpart of ac - b^2.
Well,
a(ax^2 + 2bx + c) = (ax + b)(ax) + a(bx + c),
so
a(ax^2 + 2bx + c) - (ax + b)^2 =
a(bx + c) - b(ax + b).
a(bx + c) - b(ax + b) = ac - b^2.
That is, we conclude that, in general,
a(ax^2 + 2bx + c) - (ax + b)^2 = ac - b^2.
This is what is known as "completing the square." Since
a(ax^2 + 2bx + c) = (ax + b)^2 + ac - b^2.
If ac - b^2 > 0, then both sides are > 0.
a(ax^2 + 2bx + c) - (ax + b)^2 = ac - b^2
means that the polynomial analog of ac - b^2 turns out to have no x dependence -- and, indeed, is just ac - b^2 itself.
In particular, the next step is to compute
a(ax^3 + 3bx^2 + 3cx + d) - (ax + b)(ax^2 + 2bx + c),
which, it turns out, is equally lovely.
a^2(ax^3 + 3bx^2 + 3cx + d) =
(ax + b)^3 +
3(ac - b^2)(ax + b) +
a(ad - bc) - 2b(ac - b^2).
And this "depressed" cubic in ax + b has for its coefficients polynomials in ac - b^2 and ad - bc -- both zero in the geometric case.
ax + b = cbrt[(ac - b^2)(ar + b)] + cbrt[(ac - b^2)(as + b)],
where r, s are the roots of
(ac - b^2)x^2 + (ad - bc)x + (bd - c^2) = 0.