Related papers: Refactorisation of the Dirichlet convolution

A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.

We study the asymptotic behaviour of the prime pair counting function $\pi_{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the…

The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…

Using a different approach, we derive integral representations for the Riemann zeta function and its generalizations (the Hurwitz zeta, $\zeta(-k,b)$, the polylogarithm, $\mathrm{Li}_{-k}(e^m)$, and the Lerch transcendent,…

In this paper, we introduce and study the Dirichlet series enumerating (proper) equivalence classes of full rank subforms/sublattices of a given quadratic form/lattice, focusing on the positive definite binary case. We obtain formulas…

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

Let $\zeta(s)$ and $Z(t)$ be the Riemann zeta function and Hardy's function respectively. We show asymptotic formulas for $\int_0^T Z(t)\zeta(1/2+it)dt$ and $\int_0^T Z^2(t) \zeta(1/2+it)dt$. Furthermore we derive an upper bound for…

Some problems involving the classical Hardy function $$ Z(t) := \zeta(1/2+it)\bigl(\chi(1/2+it)\bigr)^{-1/2}, \quad \zeta(s) = \chi(s)\zeta(1-s) $$ are discussed. In particular we discuss the odd moments of $Z(t)$, the distribution of its…

The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

Let M be an N-function satisfying the $\Delta_2$- condition, let $\omega, \vp$ be two other functions, $\omega\ge 0$. We study Hardy-type inequalities \[ \int_{\rp} M(\omega (x)|u(x)|) {\rm exp}(-\vp (x))dx \le C\int_{\rp} M(|u'(x)|) {\rm…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…

For the Tornheim double zeta function T(s1,s2,s3) of complex variables,we obtain its functional equations,which are new.Using the calculus of r-th order derivative of zeta(s,alpha) as a function of alpha(developed in author[7])as the…

By employing contour integration the derivation of a generalized double finite series involving the Hurwitz-Lerch zeta function is used to derive closed form formulae in terms of special functions. We use this procedure to find special…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…

We present some novelties on the Riemann zeta function. Using an extended formula created for the polylogarithm in a previous paper, $\mathrm{Li}_{k}(e^{z})$, the zeta function's Dirichlet series is analytically continued from $\Re(k)>1$ to…

We present a new proof of Euler's formulas for $\zeta(2k)$, where $k = 1,2,3,...$, which uses only the defining properties of the Bernoulli polynomials, obtaining the value of $\zeta(2k)$ by summing a telescoping series. Only basic…

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…