Abstract
Let γ=0.577215664… denote the Euler–Mascheroni constant, and let the sequence wn(a,b,c,d)=∑k=1n1k−ln(n+a+bn+cn2+dn3). The main aim of this paper is to determine the values a,b,c,d which provide the fastest sequence (wn)n≥1 approximating the Euler–Mascheroni constant.
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.