Abstract
This paper explores the combinatorial system developed by Chinnaraji Annamalai, focusing on his definition of a generalized binomial coefficient and its application in deriving the Combinatorial Geometric Series (CGS). The CGS serves as the generating function for this sequence of coefficients, successfully confirming a fundamental, known result in a compact, closed-form expression. This framework is significant for its emphasis on the intrinsic recursive and product relationships of the coefficients, offering a valuable alternative perspective on established principles of combinatorial enumeration.



![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png)