Related papers: Prime Number Error Terms

We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) =…

This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…

In this paper we prove parts of a conjecture of Herzog giving lower bounds on the rank of the free modules appearing in the linear strand of a graded $k$-th syzygy module over the polynomial ring. If in addition the module is…

In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

In this paper we deal with optimality conditions that can be verified by a nonlinear optimization algorithm, where only a single Lagrange multiplier is avaliable. In particular, we deal with a conjecture formulated in [R. Andreani, J.M.…

In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…

Assuming the Riemann hypothesis, we prove estimates for the variance of the real and imaginary part of the logarithm of the Riemann zeta-function in short intervals. We give three different formulations of these results. Assuming a…

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

The first result of our article is another proof of Mertens' third theorem in the number field setting, which generalises a method of Hardy. The second result concerns the sign of the error term in Mertens' third theorem. Diamond and Pintz…

This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…

We give a conjectural description of the vanishing order and leading Taylor coefficient of the Zeta function of a proper, regular arithmetic scheme $\mathcal{X}$ at any integer $n$ in terms of Weil-\'etale cohomology complexes. This extends…

Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…

We prove quantitative estimates for averages of the von Mangoldt and M\"obius functions along polynomial progressions $n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials $P_i$. The error terms obtained save an arbitrary power of…

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…