Abstract
This paper present a computing technique for sum of the summation of geometric series in an innovative. The sum of geometric series with exponents of two plays a vital role in the field of combinatorics including binomial coefficients. The multiple summations of series of binomial coefficients or computation of multiple binomial expansions are equal to the exponents of two. This computing method is introduced in this article.



![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)