An additive problem for powers of primes (Q1825897): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5515488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5587215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Dichte der Summe zweier Mengen, deren eine die Dichte null hat. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5597638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine zahlentheoretische Anwendung der Graphentheorie. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an additive property of squares and primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Exponential Sums / rank
 
Normal rank

Latest revision as of 10:22, 20 June 2024

scientific article
Language Label Description Also known as
English
An additive problem for powers of primes
scientific article

    Statements

    An additive problem for powers of primes (English)
    0 references
    1989
    0 references
    Let \(Q_ k\) be the set of k-th powers of nonnegative integers and \(P_ k\) the set of k-th powers of prime numbers. The question of this paper is how the density of a set increases by adding \(Q_ k\) or \(P_ k\) to it. The essentially optimal result states that \[ \underline d(A+Q_ k)\quad \geq \quad \underline d(A+P_ k)\quad \geq \quad K^{-c/\log \log K}, \] where ḏ(A) is the lower asymptotic density, \(K=1/\underline d(A)\) and c is a positive constant depending on k. The proof is based on the Hardy- Littlewood method.
    0 references
    sum of sets
    0 references
    density of sets
    0 references
    powers of nonnegative integers
    0 references
    powers of prime numbers
    0 references
    lower asymptotic density
    0 references
    Hardy-Littlewood method
    0 references
    0 references
    0 references

    Identifiers