By definition it is:
It can be proven that the following forms all sum to the same constant:
where σ0(n) = d(n) is the divisor function, a multiplicative function that equals the number of positive divisors of the number n. To prove the equivalence of these sums, note that they all take the form of Lambert series and can thus be resummed as such.
The Erdős–Borwein constant comes up in the average case analysis of the heapsort algorithm, where it controls the constant factor in the running time for converting an unsorted array of items into a heap.
- The first of these forms is given by Knuth (1998), ex. 27, p. 157; Knuth attributes the transformation to this form to an 1828 work of Clausen.
- Erdős, P. (1948), "On arithmetical properties of Lambert series", J. Indian Math. Soc. (N.S.) 12: 63–66, MR 0029405.
- Borwein, Peter B. (1992), "On the irrationality of certain series", Mathematical Proceedings of the Cambridge Philosophical Society 112 (1): 141–146, doi:10.1017/S030500410007081X, MR 1162938.
- Knuth (1998) observes that calculations of the constant may be performed using Clausen's series, which converges very rapidly, and credits this idea to John Wrench.
- Crandall, Richard (2012), "The googol-th bit of the Erdős–Borwein constant", Integers 12: A23, doi:10.1515/integers-2012-0007.
- Knuth, D. E. (1998), The Art of Computer Programming, Vol. 3: Sorting and Searching (2nd ed.), Reading, MA: Addison-Wesley, pp. 153–155.