相关论文: On the estimate $M(x)=o(x)$ for Beurling generaliz…

This is the first installment in a series of papers devoted to examining certain aspects of the asymptotic value distribution and distribution of zeros manifested by members of a broad class of linear combinations of L-functions in the…

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Summation arithmetic functions of Mertens and Liouville are investigated in the paper. It is proved that the limiting distribution of these functions is the normal. It is also shown that the estimating of standard deviation of these…

The validity of the Riemann Hypothesis (RH) on the location of the non-trivial zeros of the Riemann $\zeta$-function is directly related to the growth of the Mertens function $M(x) \,=\,\sum_{k=1}^x \mu(k)$, where $\mu(k)$ is the M\"{o}bius…

We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{\substack{n \leq x \\ P(n) > \sqrt{x}}} f(n), \] where…

Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend…

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

Beurling slow variation is generalized to Beurling regular variation. A Uniform Convergence Theorem, not previously known, is proved for those functions of this class that are measurable or have the Baire property. This permits their…

We show that Hal\'{a}sz's theorem holds for Beurling numbers under the following two mild hypotheses on the generalized number system: existence of a positive density for the generalized integers and a Chebyshev upper bound for the…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

We find asymptotics for $S_{K,c}(x)$, the number of positive integers below $x$ whose number of prime factors is $c \; \mathrm{mod}\; K$. We study this question in the context of Beurling integers.

We relax the continuity assumption in Bloom's uniform convergence theorem for Beurling slowly varying functions \phi. We assume that \phi has the Darboux property, and obtain results for \phi measurable or having the Baire property.

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

We use M\"obius inversion and the Bernoulli polynomials to prove inequalities between the logarithmic summatory function of the M\"obius function and weighted averages of its ordinary summatory function.

We prove that the M\"obius function is orthogonal to polynomials over $\mathbb{F}_q[x]$ (up to a characteristic condition). We use this orthogonality property to count prime solutions to affine-linear equations of bounded complexity in…