**(Discrete Mathematics Techniques III)**

**Abstract**

We find a **direct** closed-form solution, i.e. one that does **not** require iteration, for the general case of the finite-summation-of-integer-powers problem . Having established in Part 2 that the closed-form solution is a polynomial, the summation is here rewritten as the sum of the independent monomials (), where the are unknown coefficients. Using the recurrence relation , we obtain a linear combination of the monomials, which reduces to an easily solvable -by- triangular linear system in the unknown coefficients of the closed-form polynomial solution. Maxima and Octave/Matlab codes for directly computing the closed-form solutions are included in the Appendices.