Related papers: An efficient algorithm for the computation of Bern…
We prove formulas for the Bernoulli numbers by using the Newton-Girard identities to evaluate the Riemann zeta function at positive even integers. To do this, we define a sequence of positive integers, a sequence of polynomials, and a…
The Bernoulli numbers b_0,b_1,b_2,.... of the second kind are defined by \sum_{n=0}^\infty b_nt^n=\frac{t}{\log(1+t)}. In this paper, we give an explicit formula for the sum \sum_{j_1+j_2+...+j_N=n,…
Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…
Assuming the Riemann Hypothesis we study negative moments of the Riemann zeta-function and obtain asymptotic formulas in certain ranges of the shift in $\zeta(s)$. For example, integrating $|\zeta(1/2+\alpha+it)|^{-2k}$ with respect to $t$…
We show the zero-density estimate \[ N(\zeta_{\mathcal{P}}; \alpha, T) \ll T^{\frac{4(1-\alpha)}{3-2\alpha-\theta}}(\log T)^{9} \] for Beurling zeta functions $\zeta_{\mathcal{P}}$ attached to Beurling generalized number systems with…
We present new algorithms for computing the low $n$ bits or the high $n$ bits of the product of two $n$-bit integers. We show that these problems may be solved in asymptotically 75% of the time required to compute the full $2n$-bit product,…
We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the path integral Monte Carlo method. For a general simplicial complex, the running time of our algorithm is…
A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order $0$ as well as evaluating Schl\"{o}milch and Fourier--Bessel expansions in $\mathcal{O}(N(\log N)^2/\log\!\log N)$ operations. The…
We obtain the expected asymptotic formula for the number of primes $p<N=2^n$ with $r$ prescribed (arbitrarly placed) binary digits, provided $r<cn$ for a suitable constant $c>0$. This result improves on our earlier result where $r$ was…
In the paper, the authors provide four alternative proofs of an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
The classical Bernoulli numbers $B_m$ can be expressed using Stirling numbers of the second kind, and M. Kaneko extended this framework by defining poly-Bernoulli numbers ${\mathbb B}_m^{(k)}$, for which explicit formulas using the Stirling…
In this didactic note, we describe a procedure to derive successive approximations of $\pi$ using Euler Beta functions. It is an interesting exercise for undergraduate students, since it involves polynomial roots, integral calculations,…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should…
The secondary zeta function $Z(s)=\sum_{n=1}^\infty\alpha_n^{-s}$, where $\rho_n=\frac12+i\alpha_n$ are the zeros of zeta with $\Im(\rho)>0$, extends to a meromorphic function on the hole complex plane. If we assume the Riemann hypothesis…