The Erdős–Borwein constant is the sum of the
reciprocals of the
Mersenne numbers. It is named after
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in ...
and
Peter Borwein.
By definition it is:
:
Equivalent forms
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.
Irrationality
Erdős in 1948 showed that the
constant ''E'' is an
irrational number. Later, Borwein provided an alternative proof.
Despite its irrationality, the
binary representation of the Erdős–Borwein constant may be calculated efficiently.
Applications
The Erdős–Borwein constant comes up in the
average case analysis
In computer science, best, worst, and average cases of a given algorithm express what the resource usage is ''at least'', ''at most'' and ''on average'', respectively. Usually the resource being considered is running time, i.e. time complexit ...
of the
heapsort algorithm, where it controls the constant factor in the running time for converting an unsorted array of items into a heap.
[.]
References
External links
*
{{DEFAULTSORT:Erdos-Borwein Constant
Mathematical constants
Irrational numbers
Borwein constant