On computing the density of integers of the form 2ⁿ + p
From MaRDI portal
Publication:5113672
DOI10.1090/MCOM/3537zbMATH Open1450.11103OpenAlexW3009935525MaRDI QIDQ5113672FDOQ5113672
Authors: Gianna M. Del Corso, Ilaria Del Corso, Francesco Romani, Roberto Dvornicich 
Publication date: 15 June 2020
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3537
Recommendations
Cites Work
- Accuracy and Stability of Numerical Algorithms
- Algorithms for Computing the Sample Variance: Analysis and Recommendations
- Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers"
- Title not available (Why is that?)
- On Romanoff's constant
- The Romanoff theorem revisited
- On integers of the form p+2k
- Title not available (Why is that?)
- A note on Romanov's constant
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Title not available (Why is that?)
- A Remark on a Paper of Bateman and Horn
- On some theorems of additive number theory
- On the integers of the form \(p^2+b^2+2^n\) and \(b_1^2+b_2^2+2^{n^2}\)
- Title not available (Why is that?)
- Computations concerning primes and powers of two
Cited In (9)
- On integers of the form \(p + 2^{k_1^{r_1}} + \cdots + 2^{k_t^{r_t}}\)
- Some computational results on a conjecture of de Polignac about numbers of the form \(p + 2^k\)
- Computations concerning primes and powers of two
- On the density of odd integers of the form \((p-1)2^{-n}\) and related questions
- Density Problems for p (n )
- ON THE DENSITY OF INTEGERS OF THE FORM (p−1)2−n IN ARITHMETIC PROGRESSIONS
- On a problem of Romanoff type
- On integers of the form p+2k
- Metrical results on sums of squares and prime values of the integer parts of sequences
Uses Software
This page was built for publication: On computing the density of integers of the form \(2^n + p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113672)
