Intended for: September 22, 2012
Timetable
- First draft entered by Frank Ellerman on September 22, 2011 ✓
- Draft reviewed by Charles Greathouse on September 23, 2011 ✓
- Draft approved by Alonso del Arte on April 1, 2012 ✓
The line below marks the end of the <noinclude> ... </noinclude> section.
A079614: Bertrand’s constant.
-
Bertrand’s postulate shows that for each
there is at least one prime
. Likewise for
there is at least one prime
. Therefore a constant
exists where
⌊ 2 b⌋ , ⌊ 2 2 b⌋ , …, ⌊ 2 2 ⋰ 2 b⌋ , … |
are all
primes (cf.
A051501). Finding more digits for
requires finding better bounds for the
prime counting function.