Related papers: An Asymptotic Formula for the Chebyshev Theta Func…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…

Let $\bar{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic higher order $\log$-concavity property of the overpatition function in a similar framework done by Hou and Zhang for the partition function. This…

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…

We consider a sequence $(p_n)_{n=1}^\infty$ of polynomials with uniformly bounded zeros and $\deg p_1\geq 1$, $\deg p_n\geq 2$ for $n\geq 2$, satisfying certain asymptotic conditions. We prove that the function sequence $\left(\frac{1}{\deg…

We prove asymptotic formulas for the complex coefficients of $(\zeta q;q)_\infty^{-1}$, where $\zeta$ is a root of unity, and apply our results to determine secondary terms in the asymptotics for $p(a,b,n)$, the number of integer partitions…

In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods…

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

It is known that $|\zeta(1+ it)|\ll (\log t)^{2/3}$. This paper provides a new explicit estimate, viz.\ $|\zeta(1+ it)|\leq 3/4 \log t$, for $t\geq 3$. This gives the best upper bound on $|\zeta(1+ it)|$ for $t\leq 10^{2\cdot 10^{5}}$.

Let x(s), s in R^d be a Gaussian self-similar random process of index H. We consider the problem of log-asymptotics for the probability p(T) that x(s), x(0)=0 does not exceed a fixed level in a star-shaped expanding domain TxG as T>>1. We…

We improve on previous upper bounds for the $q$th norm of the partial sums of the Riemann zeta function on the half line when $0<q\leqslant 1$. In particular, we show that the 1-norm is bounded above by $(\log N)^{1/4}(\log\log N)^{1/4}$.

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…

We study the value distribution of the Riemann zeta function near the line $\Re s = 1/2$. We find an asymptotic formula for the number of $a$-values in the rectangle $ 1/2 + h_1 / (\log T)^\theta \leq \Re s \leq 1/2+ h_2 /(\log T)^\theta $,…

We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the…

Let $\theta(x) = \sum_{p\leq x} \log p$. We show that $\theta(x)<x$ for $2<x< 1.39\cdot 10^{17}$. We also show that there is an $x<\exp(727.951332668)$ for which $\theta(x) >x.$

In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…

We continue to study the distribution of prime numbers $p$, satisfying the condition $\{ p^{\alpha} \} \in I \subset [0; 1)$, in arithmetic progressions. In the paper, we prove an analogue of Bombieri-Vinogradov theorem for $0 < \alpha <…

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…