A density version of Waring-Goldbach problem (Q6969882)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8054363
Language Label Description Also known as
default for all languages
No label defined
    English
    A density version of Waring-Goldbach problem
    scientific article; zbMATH DE number 8054363

      Statements

      A density version of Waring-Goldbach problem (English)
      0 references
      0 references
      19 June 2025
      0 references
      Let \(k\) be a positive integer. We denote by \(v_p(k)\) the \(p\)-adic valuation of \(k\). Define \[ \varepsilon(k) = \begin{cases} 2, & \text{if \(k\) is even},\\\N1, & \text{if \(k\) is odd}. \end{cases} \] Set \[ R(k) = 2^{v_2(k) + \varepsilon(k)} \cdot \prod_{\substack{p\ \text{odd}\\\N(p-1)\mid k}} p^{v_p(k) + 1}. \] As usual, let \(\omega(k)\) denote the number of distinct prime divisors of \(k\). Define \(C(k)\) by \[ C(k) = \begin{cases} \lfloor k^2/2 \rfloor, & \text{if \(k \neq 4\)},\\\N7, & \text{if \(k = 4\)}. \end{cases} \] The main result of the paper reads: Theorem. Let \(s, k\) be positive integers with \(k > 1\), and suppose that \[ s > \max\bigl(16k\,\omega(k) + 4k + 3,\ 2C(k)\bigr). \] Let \(\delta > \tfrac{1}{2}\). Then, for every sufficiently large positive integer \(n\) satisfying \[ n \equiv s \pmod{R(k)}, \] there exist prime numbers \(p_1, \ldots, p_s\) belonging to a subset \(S\) of the primes such that \[ n = p_1^k + \cdots + p_s^k. \] The subset \(S\) satisfies \[ |S \cap [1, x]| = (1 + o(1))\,\frac{\delta x}{\log x} \] as \(x \to \infty\).
      0 references
      0 references
      Waring-Goldbach problem
      0 references
      transference principle
      0 references
      circle method
      0 references
      positive density
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references