Romanoff theorem in a sparse set (Q625829): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11425-010-3084-x / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-010-3084-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990484074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Romanoff's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integers of the form p+2<sup>k</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Romanoff theorem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Romanov's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of Artin's Constant and the Twin-Prime Constant / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11425-010-3084-X / rank
 
Normal rank

Latest revision as of 22:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Romanoff theorem in a sparse set
scientific article

    Statements

    Romanoff theorem in a sparse set (English)
    0 references
    25 February 2011
    0 references
    Let \(A\) be a set of positive integers and \(A(x)\) the number of elements of \(A\) not exceeding \(x\). The author proves that the number of positive integers which are less than \(x\) and of the form \(2^k+p\) with \(k\in A\) and \(p\) a prime number is greater than \(0.030996A(\log_2 x)\pi(x)\) for all sufficiently large \(x\). The number of positive integers which are less than \(x\) and of the form \(p-2^k\) with \(k\in A\) and \(p\) a prime number is greater than \(0.030996A(\log_2 x)\pi(x)\) for all sufficiently large \(x\). Four related open problems and one conjecture are posed.
    0 references
    Romanoff theorem
    0 references
    asymptotic density
    0 references
    0 references

    Identifiers