First establish the binomial theorem needed throughout this question. For integers , define the binomial coefficient to be the number of -element subsets of an -element set. Counting ordered selections and then forgetting their order gives
with the factorial convention . In the product of factors , choose from exactly factors and from the others. Each choice contributes , and there are choices. The distributive law therefore proves
for every complex number , including by the empty-product convention.
To evaluate the even-indexed sum, use the even part of a polynomial: averaging the binomial theorem at and cancels the odd powers. For ,
The two complex numbers satisfy . Their th powers are both , since . Thus the sum is
Differentiate the finite binomial theorem and set . For this gives
For the sum is directly.
For the alternating binomial moments, it is useful to differentiate in a form that introduces falling factorials. Write , with . Differentiating the binomial theorem times and multiplying by yields, for ,
At , the right side vanishes when , and equals when .
The polynomials have degrees and leading coefficient , so successive cancellation of leading terms expresses as a linear combination of them. If , every falling-factorial term has index and hence its alternating sum vanishes. If , the coefficient of is , and all lower-index terms still vanish. Therefore the alternating moments are
For , the latter identity uses the constant polynomial , so its value at is ; thus as well. This makes the edge-case convention explicit rather than treating as an unrelated numerical expression.

Articles by others on the same topic (0)

There are currently no matching articles.