Upper bounds for prime gaps related to Firoozbakht's conjecture

zbMATH Open1390.11105arXiv1506.03042MaRDI QIDQ3457645FDOQ3457645

Authors: Alexei Kourbatov 

Publication date: 16 December 2015

Abstract: We study two kinds of conjectural bounds for the prime gap after the k-th prime $p_k$: (A) $p_{k+1}<(p_k{)}^{1+1/k}$ and (B) $p_{k+1}-p_k<lo{g}^2{p}_k-log{p}_k-b$ for $k>9$. The upper bound (A) is equivalent to Firoozbakht's conjecture. We prove that (A) implies (B) with $b=1$; on the other hand, (B) with $b=1.17$ implies (A). We also give other sufficient conditions for (A) that have the form (B) with $bo1$ as $koinfty$.

Full work available at URL: https://arxiv.org/abs/1506.03042

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Using Bonse's inequality to find upper bounds on prime gaps
• Laguerre's Method Applied to the Matrix Eigenvalue Problem
• Publication:4729869
• scientific article; zbMATH DE number 4093552
• Gaps between consecutive primes (after Goldston, Pintz, Yıldırım et al.)

zbMATH Keywords

prime gapFiroozbakht conjectureCramér conjecture

Mathematics Subject Classification ID

Distribution of primes (11N05)

Cited In (3)

• Golomb’s Conjecture on Prime Gaps
• Using Bonse's inequality to find upper bounds on prime gaps
• Prime gaps and the Firoozbakht conjecture

Uses Software

• OEIS

This page was built for publication: Upper bounds for prime gaps related to Firoozbakht's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457645)