Related papers: The error term in the prime number theorem
We study the Ramanujan-prime-counting function along the lines of Ramanujan's original work on Bertrand's Postulate. We show that the number of Ramanujan primes between x and 2x tends to infinity with x. This analysis leads us to define a…
For the pure biharmonic equation and a biharmonic singular perturbation problem, a residual-based error estimator is introduced which applies to many existing nonconforming finite elements. The error estimator involves the local…
We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.
In this note we study the eigenvalue problem for a quadratic form associated with Strichartz estimates for the Schr\"{o}dinger equation, proving in particular a sharp Strichartz inequality for the case of odd initial data. We also describe…
Upon re-examining Arnold's established lemma for explaining his famous limit problem, we have determined that while the lemma itself is correct, there is a defect in the original geometric proof. In this paper, we prove the correctness of…
Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is…
We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…
An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…
We establish a Pythagorean theorem for the absolute values of the blocks of a partitioned matrix. This leads to a series of remarkable operator inequalities.
We give an exposition of some connections between Fourier optimization problems and problems in number theory. In particular, we present some recent conditional bounds under the generalized Riemann hypothesis, achieved via a Fourier…
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 solve some famous conjectures on the distribution of primes. These conjectures are to be listed as Legendre's, Andrica's, Oppermann's, Brocard's, Cram\'{e}r's, Shanks', and five Smarandache's conjectures. We make use of both…
We prove a local analogue of a theorem of J. Martinet about the absolute norm of the relative discriminant ideal of an extension of number fields. The result can be seen as a statement about 2-primary units. We also prove a similar…
In this paper, we derive a variant of the Taylor theorem to obtain a new minimized remainder. For a given function $f$ defined on the interval $[a,b]$, this formula is derived by introducing a linear combination of $f'$ computed at $n+1$…
The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…
In this paper we shall consider some famous means such as arithmetic, harmonic, geometric, root square mean, etc. Considering the difference of these means, we can establish. some inequalities among them. Interestingly, the difference of…
We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct…
In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…