English
Related papers

Related papers: A Conditional Explicit Result for the Prime Number…

200 papers

Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.

Number Theory · Mathematics 2016-06-07 Alessandro Languasco , Alessandro Zaccagnini

I give some claims on primorial prime numbers for interested readers in number theory.

General Mathematics · Mathematics 2007-05-23 Turker Ozsari

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

Number Theory · Mathematics 2016-12-07 Michael Mueger

We extend Riemann's rearrangement theorem on conditionally convergent series of real numbers to multiple instead of simple sums.

Classical Analysis and ODEs · Mathematics 2011-11-08 Jurgen Grahl , Shahar Nevo

Assuming the Riemann Hypothesis, we provide explicit upper bounds for moduli of $S(t)$, $S_1(t)$, and $\zeta\left(1/2+\mathrm{i}t\right)$ while comparing them with recently proven unconditional ones. As a corollary we obtain a conditional…

Number Theory · Mathematics 2021-10-14 Aleksander Simonič

In the paper, we first prove a sufficient condition for the Riemann hypothesis which involves the order of magnitude of the partial sum of the Liouville function. Then we show a formula which is curiously related to the proved sufficient…

General Mathematics · Mathematics 2011-09-13 Hisanobu Shinya

We give a simple Tauberian proof of the Prime Number Theorem using only elementary real analysis. Hence, the analytic continuation of Riemann's zeta function $\zeta$ and its non-vanishing value on the whole line $\{z\in {\mathbb…

Number Theory · Mathematics 2024-04-22 Philippe Angot

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

Number Theory · Mathematics 2026-05-22 Cheng-TIng Wang

We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an…

Number Theory · Mathematics 2017-03-10 Korneel Debaene

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

In this paper, we will give some estimation for the average error of the prime number theorem.

General Mathematics · Mathematics 2022-06-23 An-Ping Li

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…

Number Theory · Mathematics 2021-01-05 Jesse Elliott

We consider an analog of a conjecture of Montgomery and Soundararajan on the moments of primes in short intervals in number fields; this analog was discussed and heuristically derived in a paper of the second author, Rodgers, and…

Number Theory · Mathematics 2023-06-16 Régis de la Bretèche , Vivian Kuperberg

Nicolas criterion for the Riemann Hypothesis is based on an inequality that Euler totient function must satisfy at primorial numbers. A natural approach to derive this inequality would be to prove that a specific sequence related to that…

Number Theory · Mathematics 2010-12-20 Youngju Choie , Michel Planat , Patrick Solé

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

Number Theory · Mathematics 2007-05-23 Chunlei Liu

We give an explicit version of Brun-Titchmarsh theorem applicable for arbitrary moduli and arbitrary intervals. For example, we show that $\pi(x+y; k, a)-\pi(x; k, a)<2y/(\varphi(k)(\log (y/k)+0.8601))$ for any relatively prime positive…

Number Theory · Mathematics 2023-12-27 Tomohiro Yamada

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

Assuming the Riemann Hypothesis, we provide effective upper and lower estimates for $\left|\zeta(s)\right|$ right to the critical line. As an application we make explicit Titchmarsh's conditional bound for the Mertens function and…

Number Theory · Mathematics 2021-10-14 Aleksander Simonič

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

Number Theory · Mathematics 2022-06-15 Daniel R. Johnston

Assuming the Riemann hypothesis, we obtain upper and lower bounds for moments of the Riemann zeta-function averaged over the extreme values between its zeros on the critical line. Our bounds are very nearly the same order of magnitude. The…

Number Theory · Mathematics 2021-08-09 Micah B. Milinovich
‹ Prev 1 3 4 5 6 7 10 Next ›