Calculus and Computation for Geometric Series with Binomial Coefficients

15 July 2022, Version 16
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

In today’s world, the growing complexity of mathematical and computational modelling demands the simplicity of mathematical, combinatorial, and numerical equations for solving today’s scientific problems and challenges. Combinatorics involves integers, factorials, binomial expansions, geometric series with binomial coefficients, and computation for finding solutions to the problems in computing and engineering science. This paper presents computational techniques and differential and integral calculus for the summation of geometric series with binomial coefficients in an innovative way. Also, it presents theorems, binomial expansions, and relationship between the binomial expansions and geometric series. These computing techniques refer to the methodological advances which are useful for researchers who are working in computational science. Computational science is a rapidly growing multi-and inter-disciplinary area where science, engineering, computation, mathematics, and collaboration use advance computing capabilities to understand and solve the most complex real life problems.

Keywords

computation
combinatorics
calculus
binomial expansions

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.