Computing Method for Sum of Geometric Series and Binomial Expansions

22 June 2022, Version 2
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

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.

Keywords

binomial coefficient
geometric series
computation
summation

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.