The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Hi-index | 0.00 |
In this paper we prove the following similar two-sided estimations 1/2√n+1 n - l and 1/2√n+1 n , where an = (Σl=1 n 1/√k) - 2√n+1, bn = (Σ l=1 n 1/√k) - 2√n, and l = lim n→∞ an = lim n→∞ bn= ζ(1/2) = -1,46035... (ζ(1/2) being considered in the sense of analytic continuation). These sequences are adjacent. We give a definition of adjacence. Classification Subject AMS: 26D15, 30B10, 33F05, 40A05.