On computing the density of integers of the form $2^n+p$

DOI10.1090/mcom/3537zbMath1450.11103OpenAlexW3009935525MaRDI QIDQ5113672

Gianna M. Del Corso, Francesco Romani, Ilaria Del Corso, 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

zbMATH Keywords

odd integerssums of primes and powers

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32)

Related Items (2)

On a problem of Romanoff type ⋮ On integers of the form \(p + 2^{k_1^{r_1}} + \cdots + 2^{k_t^{r_t}}\)

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computations concerning primes and powers of two
• A note on Romanov's constant
• On Romanoff's constant
• 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}}$
• Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers"
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• The Romanoff theorem revisited
• Algorithms for Computing the Sample Variance: Analysis and Recommendations
• Accuracy and Stability of Numerical Algorithms
• On integers of the form p+2^k
• A Remark on a Paper of Bateman and Horn

This page was built for publication: On computing the density of integers of the form $2^n+p$