相关论文: An efficient algorithm for the computation of Bern…
For the Bergman projection operator $P$ we prove that $ \|P\|_{{L^1(B,d\lambda)\rightarrow B_1}}= \frac {(2n+1)!}{n!}.$ Here $\lambda$ stands for the invariant metric in the unit ball $B$ of $\mathbf{C}^n$, and $B_1$ denotes the Besov space…
The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work…
Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…
We present here an approach to a computation of $\zeta(2)$ by changing variables in the double integral using hyperbolic trig functions. We also apply this approach to present $\zeta(n)$, when $n>2$, as a definite improper integral of…
Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…
In a recent work, Dancs and He found an Euler-type formula for $\,\zeta{(2\,n+1)}$, $\,n\,$ being a positive integer, which contains a series they could not reduce to a finite closed-form. This open problem reveals a greater complexity in…
We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
A new short clear proof of the asymptotics for the number $c_n$ of real roots of the Bernoulli polynomials $B_n(x)$, as well as for the maximal root $y_n$: $$y_n=\frac{n}{2\pi e}+\frac{\ln(n)}{4\pi e}+O(1)\quad\text{and}\quad…
We obtain asymptotic formulae for the second discrete moments of the Riemann zeta function over arithmetic progressions $\frac{1}{2} + i(a n + b)$. It reveals noticeable relation between the discrete moments and the continuous moment of the…
The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…
We show how the Binomial Theorem can be used to continue the Riemann Zeta Function to the left hand half-plane. This method yields the explicit values of the function at non-positive integers in terms of the Bernoulli numbers.
We present several formulae for the large $t$ asymptotics of the Riemann zeta function $\zeta(s)$, $s=\sigma+i t$, $0\leq \sigma \leq 1$, $t>0$, which are valid to all orders. A particular case of these results coincides with the classical…
A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…
Euler discovered a formula for expressing the value of the Riemann zeta function for all even positive integer arguments. A closed-form expression for the Riemann zeta function for all odd integer arguments, based on the values of the…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…
We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers.…
We present highlights of computations of the Riemann zeta function around large values and high zeros. The main new ingredient in these computations is an implementation of the second author's fast algorithm for numerically evaluating…
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
Bernoulli numbers are usually expressed in terms of their lower index numbers (recursive). This paper gives an explicit formula for Bernoulli numbers of even index. The formula contains a remarkable sequence of determinants.