Related papers: Accurate Computations of Euler Products over Prime…
For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…
In this paper, we study the formulae for a product of two product Euler polynomials. From this study, we derive some formulae for the integral of the product of two or more Ruler polynomials.
In 1997 the author found a criterion for the Riemann hypothesis for the Riemann zeta function, involving the nonnegativity of certain coefficients associated with the Riemann zeta function. In 1999 Bombieri and Lagarias obtained an…
We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of…
We analytically continue the Euler prime product for $\Re(s)>\tfrac{1}{2}$ (except for its pole $s=1$) assuming (RH) by introducing a new factor to the Euler product. We also discuss how to recover the Mertens's 3rd Theorem at $s=1$ case,…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
Many Dirichlet series of number theoretic interest can be written as a product of generating series $\zeta_{\,d,a}(s)=\prod\limits_{p\equiv a\pmod{d}}(1-p^{-s})^{-1}$, with $p$ ranging over all the primes in the primitive residue class…
Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
In this paper we evaluate sums and integrals of products of Fubini polynomials and have new explicit formulas for Fubini polynomials and numbers. As a consequence of these results new explicit formulas for p-Bernoulli numbers and…
This paper is devoted to study some expressions of the type $\prod_{p} p^{\lfloor\frac{x}{f(p)}\rfloor}$, where $x$ is a nonnegative real number, $f$ is an arithmetic function satisfying some conditions, and the product is over the primes…
The generating series of a number of different objects studied in arithmetic statistics can be built out of Euler products. Euler products often have very nice analytic properties, and by constructing a meromorphic continuation one can use…
We study the explicit formula of Euler numbers and polynomials of higher order
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
Let X be a smooth proper curve over a finite field of characteristic p. We prove a product formula for p-adic epsilon factors of arithmetic D-modules on X. In particular we deduce the analogous formula for overconvergent F-isocrystals,…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive…
Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…