Erdős–Borwein Constant

The sum of the reciprocal of the prime numbers of the form M_n = 2ⁿ - 1. (Mersenne Numbers). It is named after the mathematicians Paul Erdos and Peter Borwein and hence the name Erdős–Borwein has arrived. It can be defined as Σ_{n = 1 to ∞} 1 / 2ⁿ - 1.

The sum of the reciprocal of the prime numbers of the form M_n = 2ⁿ - 1. (Mersenne Numbers). It is named after the mathematicians Paul Erdos and Peter Borwein and hence the name Erdős–Borwein has arrived. It can be defined as Σ_{n = 1 to ∞} 1 / 2ⁿ - 1.

It is approximately equal to 1.60669 51524 15291 76378 33015 23190 92458. This constant is used in average case analysis of the heapsort algorithm.

It is approximately equal to 1.60669 51524 15291 76378 33015 23190 92458. This constant is used in average case analysis of the heapsort algorithm.