No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
Let $b\,>\,1$ be an integer. We prove that for almost all $n$, the sum of the digits in base $b$ of the numerator of the Bernoulli number ${{B}_{2n}}$ exceeds $c$ log $n$, where $c\,:=\,c\left( b \right)\,>\,0$ is some constant depending on $b$.