Related papers: Updating the error term in the prime number theore…

We show how the error term for the Trapezium Rule can be estimated, by solving an initial value problem using a Runge-Kutta method. The error term can then be added to the Trapezium approximation, yielding a much more accurate result. We…

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

We improve the error term in the van der Corput transform for exponential sums \sum_{a \le n \le b} g(n) exp(2\pi i f(n)). For many functions g and f, we can extract the next term in the asymptotic, showing that previous results, such as…

For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a…

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…

We give an explicit $O(x/T)$ error term for the truncated Riemann--von Mangoldt explicit formula. For large $x$, this provides a modest improvement over previous work, which we demonstrate via an application to a result on primes between…

In large-scale modern data analysis, first-order optimization methods are usually favored to obtain sparse estimators in high dimensions. This paper performs theoretical analysis of a class of iterative thresholding based estimators defined…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Let $a>1$. Denote by $l_a(p)$ the multiplicative order of $a$ modulo $p$. We look for an estimate of sum of $\frac{l_a(p)}{p-1}$ over primes $p\leq x$ on average. When we average over $a\leq N$, we observe a statistic of $C\mathrm{Li}(x)$.…

One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.

In this paper, we present an approach to enhance interpolation and approximation error estimates. Based on a previously derived first-order Taylor-like formula, we demonstrate its applicability in improving the $P_1$-interpolation error…

Let $\Delta(x)$ be the error term of the Dirichlet divisor problem. An asymptotic formula with the error term $O(T^{53/28+\epsilon})$ is established for the integral $\int_1^T\Delta^4(x)dx.$ Similar results are also established for some…

Let $\Delta(x)$ be the error term of the Dirichlet divisor problem. The asymptotic formula of the integral $\int_1^T\Delta^k(x)dx$ is established for any integer $3\leq k\leq 9$ by an unified method. Similar results are also established for…