1. Introduction
In 2010, Adegoke and Layeni published an interesting relation for derivatives of the arctangent function [
1]
Using this relation, they discovered a series expansion
Equations (
1) and (
2) have some restrictions. Specifically, when
n is even, equation (
1) remains valid only at
, while equation (
2) is valid only at
for
.
To resolve this problem, Lampret applied the signum function
and proved that for complete coverage
, the equations (
1) and (
2) can be modified as [
2]
and
respectively.
Equations (
3) and (
4) represent a theoretical interest. In particular, Lampret noticed that from equation (
3) it follows that [
2]
Comparing the following relation (see [
3] for detailed derivation procedure by induction)
with equation (
3), we can find the following identity
It is not difficult to see that the relation (
5) immediately follows from the identity (
7). Therefore, relation (
5) is just a specific case of the identity (
7) occurring at
.
Identity (
7) can be rewritten in form
Therefore, from equation (
4) it follows that
or
As we can see, this series expansion of the arctangent function is just a reformulation of equation (
4) that follows due to identity (
6).
In our previous publication [
3], using the identity (
6), we have derived the following series expansion of the arctangent function
from which at
we get a formula for
expressed in terms of the binomial coefficients
or
Later, using again the same identity (
6), we have also derived the following series expansion (see [
4] and literature therein)
where the expansion coefficients are computed by two-step iteration
such that
The series expansion (
8) requires no surd numbers in computation and it is rapid in convergence.
As further development, in this work we derive a generalized series expansion of the arctangent function. Such an approach may be used to improve further convergence in computation of the arctangent function.
2. Derivation
Change of the variable
in the equation (
6) results in
or
since
There is an enhanced midpoint integration (EMI) formula (see [
5] and literature therein for detailed derivation procedure)
It is interesting to note that if the upper summation bound associated with variable
n is an integer
, then we can also use
It is easy to show that, excluding all zero terms occurring at odd values of the variable
n, equation (
10) can be rewritten in a more convenient form
Although equation (
11) requires even derivatives of the integrand at the points
, where
, its application with help of the Computer Algebra System (CAS) may be very efficient in numerical integration. Specifically, such an approach may be especially useful for numerical integration for the highly oscillating functions. The interested readers can download the MATLAB code based on the integration formula (
11) on the MATLAB Central website [
6] (file ID #: 71037).
If an integrand represents a function of two variables
, then the integration formula (
11) reads as
The arctangent function can be given as an integral
Consequently, substituting the integrand from equation (
13)
into equation (
12) and using equation (
9) for differentiation, we can find that
Series expansion (
14) is rapid in convergence. However, it requires algebraic manipulations with complex numbers. Therefore, it is very desirable to exclude them. This can be achieved by induction based on two-step iteration
and
that transforms equation (
14) into the following series expansion
where the argument is
Equation (
15) is a generalization of the equation (
8). Consistency between these two equations can be observed by taking
. In particular, substitution
into series expansion (
15) of the arctangent function implies that
. Consequently, from equation (
15) we get equation (
8), where the expansion coefficients are
The following is a Mathematica code that generates graphs shown in
Figure 1 (this code can be copy-pasted directly to the Mathematica notebook):
Graphs in
Figure 1 are generated by using series expansion (
15) truncated at
. Blue, red and green curves correspond to integer
M taken to be 1, 2 and 3, respectively.
3. Convergence
Consider
Figure 2 showing approximation curves of the arctangent function
by using equations (
15), (
16) and (
17) truncated at
. The blue curve corresponding to the Maclaurin expansion series
diverges beyond
and 1 due to finite radius of convergence. Although one can resolve this issue by using an elementary relation
our objective is just to visualize the convergence. The red curve shows the Euler series expansion [
7,
8]
The green curve illustrates the series expansion (
15) at
. The black dashed curve depicts the original arctangent function for comparison. As we can see from
Figure 2, even at smallest
M the series expansion (
15) provides more rapid convergence as compared to the Euler series expansion (
17).
Figure 3 shows the logarithms of absolute difference
between the arctangent function and its approximations provided by equations (
15), (
16) and (
17). All curves are also computed with truncating integer
in all these equations. The blue and red curves correspond to equations (
16) and (
17) while the green, brown, gray, magenta and black curves correspond to equation (
15) when
M is equal to 1, 2, 3, 4 and 5, respectively. As we can see from this figure, increase of the integer
M leads to a rapid decrease of the absolute difference
by many orders of the magnitude. These results indicate that the series expansion (
15) provides increasing convergence with increasing
M. Consequently, the series expansion (
15) may be promising for efficient computation digits of
in the Machin-like formulas [
4,
9,
10,
11,
12,
13,
14,
15] without undesirable surd numbers since computation of any irrational numbers is itself a big challenge.
Our empirical results show that even using already known Machin-like formulas with sufficiently large integers in actangent arguments, the expansion series (
15) at any
can provide more than 17 digits of
at each increment by 1 of the variable
n. It is interesting to note that this convergence rate is faster than that of provided by Chudnovsky formula generating 14 to 16 digits of
per increment [
9,
12]. Nowadays, Chudnovsky formula remains most efficient for computing digits of
due to its rapid convergence and other advantages in algorithmic implementation. Historically, however, there were several records that appeared due to application of the Machin-like formulas in computing
and, in 2002, an algorithm, developed by Kanada on the basis of self-checking pair of the Machin-like formulas, beat the record providing more than a trillion digits of
for the first time [
10,
12]. Therefore, discovery of new Machin-like formulas and rapidly convergent series expansions of the arctangent function may be promising for computing digits of the constant
.
4. Conclusions
We derived a generalized series expansion (
15) of the arctangent function by using the EMI formula (
12). Computational test we performed reveals that such a generalization significantly improves convergence in computation of the arctangent function.
Author Contributions
S.M.A. developed the methodology, wrote the codes and prepared a draft version of the manuscript. R.S., R.K.J and B.M.Q. verified, reviewed and edited the manuscript. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Acknowledgments
This work is supported by National Research Council Canada, Thoth Technology Inc., York University and Epic College of Technology.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
EMI |
Enhanced midpoint integration |
CAS |
Computer algebra system |
References
- Adegoke, K.; Layeni, O. The higher derivatives of the inverse tangent function and rapidly convergent BBP-type formulas for pi. Appl. Math. E-Notes 2010, 10, 70–75. [Google Scholar] [CrossRef]
- Lampret, V. The higher derivatives of the inverse tangent function revisited. Appl. Math. E-Notes 2011, 11, 224–23. [Google Scholar]
- Abrarov, S.M.; Quine, B.M. A simple identity for derivatives of the arctangent function. Available online: https://doi.org/10.48550/arXiv.1605.02843 (accessed on 1 February 2023).
- Abrarov, S.M.; Siddiqui, R.; Jagpal, R.K.; Quine, B.M. A new form of the Machin-like formula for π by iteration with increasing integers. J. Integer Seq. 2022, 25((4)), 22.4.5. [Google Scholar] [CrossRef]
- Abrarov, S.M.; Quine, B.M. A formula for pi involving nested radicals. Ramanujan J. 2018, 46, 657–665. [Google Scholar] [CrossRef]
- Abrarov, S.M. Array numerical integration by enhanced midpoint rule (file ID: 71037). Available online: https://tinyurl.com/bdf8pt2m (accessed on 1 February 2023).
- Castellanos, D. The ubiquitous π. Math. Mag. 1988, 61(2), 67–98. [Google Scholar] [CrossRef]
- Chien-Lih, H. An elementary derivation of Euler’s series for the arctangent function. Math. Gaz. 2005, 89, 469–470. [Google Scholar] [CrossRef]
- Berggren, J.L.; Borwein, J.M.; Borwein, J. Pi: a source book, 3rd ed.; Springer: New York, USA, 2004. [Google Scholar]
- Calcut, J.S. Gaussian integers and arctangent identities for π. Amer. Math. Monthly 2009, 116(6), 515–530. [Google Scholar] [CrossRef]
- Nimbran, A.S. On the derivation of Machin-like arctangent identities for computing pi (π). Math. Student 2010, 79((1-4)), 171–186. [Google Scholar]
- Agarwal, R.P.; Agarwal, H.; Sen, K.S. Birth, growth and computation of pi to ten trillion digits. Adv. Differ. Equ. 2013, 100. [Google Scholar] [CrossRef]
- Wetherfield, M.R.; Chien-Lih, H. Computing pi: lists of Machin-type (inverse cotangent) identities for pi/4. Available online: http://www.machination.eclipse.co.uk (accessed on 1 February 2023).
- A Wolfram notebook playing with Machin-like formulas. Available online: https://www.wolframcloud.com/obj/exploration/MachinLike.nb (accessed on 1 February 2023).
- Gasull, A.; Luca, F.; Varona, J.L. Three essays on Machin’s type formulas. Available online: https://doi.org/10.48550/arXiv.2302.00154 (accessed on 2 February 2023).
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).