The Waring-Goldbach problem: one square and five cubes (Q457025)

From MaRDI portal
Revision as of 01:50, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The Waring-Goldbach problem: one square and five cubes
scientific article

    Statements

    The Waring-Goldbach problem: one square and five cubes (English)
    0 references
    0 references
    26 September 2014
    0 references
    Suppose that \(p_1, p_2, p_3, p_4, p_5\) are prime numbers and a natural number \(x\) has at most 36 prime factors, counted according to multiplicity. Let \(R(N)\) denote the number of solutions of the following equation \[ N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^3. \] The author proves that \[ R(N)\geq c\, N^{\frac{19}{18}}/(\log N)^6, \] for an even and sufficiently large integer \(N\) with some absolute constant \(c\).
    0 references
    Waring-Goldbach problem
    0 references
    Hardy-Littlewood method
    0 references
    almost prime number
    0 references
    sieve method
    0 references
    number of solutions
    0 references
    lower bound
    0 references

    Identifiers