Abstract
In the paper, the authors establish explicit formulas for asymptotic and power series expansions of the exponential and the logarithm of asymptotic and power series expansions. The explicit formulas for the power series expansions of the exponential and the logarithm of a power series expansion are applied to find explicit formulas for the Bell numbers and logarithmic polynomials in combinatorics and number theory.
Highlights
Throughout this paper, we understand an empty sum to be 0 and regard an empty product as 1
We observe that the constant term did not appear in (1.2) in Theorem 1.5 and that the formulas (1.3) and (1.4) are recurrences
We will apply Theorems 4.1 and 4.2, respectively, to the Bell numbers and logarithmic polynomials which are extensively studied in combinatorics and number theory
Summary
Throughout this paper, we understand an empty sum to be 0 and regard an empty product as 1. Let us recall definitions for an asymptotic expansion. In which the sum of the first n + 1 terms is Sn(z), is said to be an asymptotic expansion of a function f (z) for a given range of values of arg z, if the expression. The composition B(x) = eA(x) has the asymptotic expansion where b0 = 1 and. ∞ n=0 cn xn be a given asymptotic expansion. We observe that the constant term did not appear in (1.2) in Theorem 1.5 and that the formulas (1.3) and (1.4) are recurrences. 2 of this paper, we will add a constant term into (1.2) and acquire a modified version of Theorem 1.5. The function E(x) = eD(x) has the asymptotic expansion.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.