Related papers: Primes in arithmetic progressions to smooth moduli…
Formulas of $\pi(x)$-fine structure are presented.
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
The growth of meromorphic solutions of linear difference equations containing Askey-Wilson divided difference operators is estimated. The $\varphi$-order is used as a general growth indicator, which covers the growth spectrum between the…
Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…
In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…
This first part of the paper describes the support of top graded local cohomology modules. As a corrolary one obtains a simple criteria for the vanishing of these modules and also the fact that they have finitely many minimal primes. The…
We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…
Let $\pi_{q,a}(x)$ denote the number of primes $\le x$ in the progression $a$ modulo $q$. We study subtle inequities in these functions, with $q$ fixed and variable $a$ (sometimes called 'prime race problems'). It is known unconditionally…
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…
In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…
Keating and Rudnick derived asymptotic formulas for the variances of primes in arithmetic progressions and short intervals in the function field setting. Here we consider the hybrid problem of calculating the variance of primes in…
We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…
We study the prime values of Ramanujan's tau function $\tau(n)$. Lehmer found that $n=251^2=63001$ is the smallest $n$ such that $\tau(n)$ is prime: $$\tau(251^2)=-80561663527802406257321747.$$ We prove that in most arithmetic progressions…
Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that…
Given the asymptotic expansion for the logarithmic integral $\int_0^n \frac{dt}{\ln(t)}$, obtained from repeated integration by parts until the expansion terms reach a minimum; approaching zero. Which determines a cut-off for the number of…
A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…
We derive an asymptotic formula for the divisor function $\tau(k)$ in an arithmetic progression $k\equiv a(\bmod \ q)$, uniformly for $q\leq X^{\Delta_{n,l}}$ with $(q,a)=1$. The parameter $\Delta_{n,l}$ is defined as $$…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
Eremenko and Lyubich proved that an entire function whose set of singular values is bounded is expanding at points where its image has large modulus. These expansion properties have been at the centre of the subsequent study of this class…