On the almost Goldbach problem of Linnik (Q1809044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4182608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes and powers of 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum of ``A note on the exceptional set for Goldbach's problem in short intervals'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5816783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5819542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of powers of 2 in a representation of large even integers. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of powers of 2 in a representation of large even integers. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair correlation hypothesis and the exceptional set in Goldbach's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3235865 / rank
 
Normal rank

Latest revision as of 10:46, 29 May 2024

scientific article
Language Label Description Also known as
English
On the almost Goldbach problem of Linnik
scientific article

    Statements

    On the almost Goldbach problem of Linnik (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 February 2002
    0 references
    In 1953 \textit{Yu. V. Linnik} [Mat. Sb., Nov. Ser. 32 (74), 3-60 (1953; Zbl 0051.03402)] showed that every large even integer can be written as a sum of two odd primes and a bounded number of powers of 2. Assuming the generalized Riemann hypothesis, the authors show that, for \(k\geq 200\), every even \(N\geq N_k\) can be written as a sum of two odd primes and at most \(k\) powers of 2. They follow the original argument of Linnik, combined with a careful treatment of the numerical constant.
    0 references
    0 references
    0 references
    almost Goldbach problem
    0 references
    generalized Riemann hypothesis
    0 references
    0 references