Computations concerning primes and powers of two

DOI10.1007/BF02576468MaRDI QIDQ797630zbMATH OpenOpenAlexFDO

Authors Francesco Romani

Publication date 1983

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02576468

zbMATH Keywords

asymptotic densitynumerical computationsrepresentation of integerssum of prime and power of two

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Goldbach-type theorems; other additive questions involving primes (11P32) Additive number theory; partitions (11P99) Software, source code, etc. for problems pertaining to number theory (11-04)

Recommendations

• On computing the density of integers of the form \(2^n + p\)
• The number of powers of 2 in a representation of large even integers. II
• A note on Romanov's constant
• Remarks on a problem in the ``Elemente
• Density of two squares of primes and powers of 2

Cites work

• Numerical methods for solving linear least squares problems
• Primes and powers of 2

Cited in

(7)

• scientific article; zbMATH DE number 653244 (Why is no real title available?)
• On Romanov's constant
• On computing the density of integers of the form \(2^n + p\)
• Primes and power-primes
• An effective version of the Bombieri-Vinogradov theorem, and applications to Chen's theorem and to sums of primes and powers of two
• Some computational results on a conjecture of de Polignac about numbers of the form \(p + 2^k\)
• Computing the permanent modulo a prime power

This page was built for publication: Computations concerning primes and powers of two

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