A Derivation of Finite Sum Identity of Combinatorial Geometric Series

This paper establishes a rigorous mathematical proof of the identity for the finite sum of a combinatorial geometric series. By decomposing the series into its infinite generating function and a remainder term, it provides a closed-form expression that relates figurate numbers of order k to a polynomial correction. This result is particularly useful in discrete probability, stochastic modeling, and the analysis of algorithms.