Related papers: Exact formulas for partial sums of the M\"obius fu…

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…

Let $\chi$ be a primitive Dirichlet character whose conductor $q$ is a prime number. For the certain averages of values of $\log |L(s, \chi)|$ in $q$-aspect at a fixed $s=\sigma>1/2$, under Generalized Riemann Hypothesis (GRH), we explain…

Let $\Lambda\left(n\right)$ be the Von Mangoldt function, let \[ r_{G}\left(n\right)=\underset{{\scriptstyle m_{1}+m_{2}=n}}{\sum_{m_{1},m_{2}\leq n}}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right), \] \[…

We study \emph{unimodular fake} $\mu's$, i.e. multiplicative functions $\mathfrak f: \N \to \mathbb{S}^1 \cup \{0\} $ determined by a fixed sequence $\{\varepsilon_k\}_{k\ge 0} \subset \mathbb{S}^1 \, \cup \, \{0\}$ via the rule $\mathfrak…

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

We use discrete Morse theory to determine the M\"obius function of generalized factor order. Ordinary factor order on the Kleene closure A* of a set A is the partial order defined by letting u\leq w if w contains u as a subsequence of…

A new definition for the Dirichlet beta function for positive integer arguments is discovered and presented for the first time. This redefinition of the Dirichlet beta function, based on the polygamma function for some special values,…

An important line of research is the investigation of the laws of random variables known as Dirichlet means as discussed in Cifarelli and Regazzini(1990). However there is not much information on inter-relationships between different…

An interesting line of research is the investigation of the laws of random variables known as Dirichlet means. However, there is not much information on interrelationships between different Dirichlet means. Here, we introduce two…

Dirichlet's $L$-functions are natural extensions of the Riemann zeta function. In this paper we first give a brief survey of Ap\'ery-like series for some special values of the zeta function and certain $L$-functions. Then, we establish two…

A Lambert series generating function is a special series summed over an arithmetic function $f$ defined by \[ L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \sum_{m \geq 1} (f \ast 1)(m) q^m. \] Because of the way the left-hand-side…

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

The Mellin transform and several Dirichlet series related with the Riemann zeta function are used to deduce some identities similar to the classical M\"untz formula [4]. These formulas are derived in the critical strip and in the half-plane…

Let $2 \leq y \leq x$ such that $\beta := \frac{\log x}{\log y} \rightarrow \infty$. Let $\omega_y(n)$ denote the number of distinct prime factors $p$ of $n$ such that $p \leq y$, and let $\mu_y(n) := \mu^2(n)(-1)^{\omega_y(n)}$, where…

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

We evaluate the asymptotic size of various sums of G\'al type, in particular $$S( \mathcal{M}):=\sum_{m,n\in\mathcal{M}} \sqrt{(m,n) \over [m,n]},$$ where $\mathcal{M}$ is a finite set of integers. Elaborating on methods recently developed…

Two elementary formulae for Mertens function $M(n)$ are obtained. With these formulae, $M(n)$ can be calculated directly and simply, which can be easily implemented by computer. $M (1) \sim M (2 \times 10^7) $ are calculated one by one.…

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

We establish an integral representation for the Dirichlet generating function of the coefficients of Euler's pentagonal number theorem. The Bromwich-type integral enables analytic continuation to the entire complex plane, filling a gap in…