A hybrid of two theorems of Piatetski-Shapiro (Q2416347)

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 7058113
Language Label Description Also known as
default for all languages
No label defined
    English
    A hybrid of two theorems of Piatetski-Shapiro
    scientific article; zbMATH DE number 7058113

      Statements

      A hybrid of two theorems of Piatetski-Shapiro (English)
      0 references
      0 references
      0 references
      23 May 2019
      0 references
      Let \(0\leq\gamma\leq 1\) and let \[\mathcal N_{\gamma}=\{n\in\mathbb N| n=\lfloor m^{1/\gamma}\rfloor \;\; \text{for some}\;\; m\in\mathbb N\}.\] Following \textit{I. I. Piatetski-Shapiro} [Mat. Sb., Nov. Ser. 30(72), 105--120 (1952; Zbl 0047.28001)] the authors consider solubility in primes \(p_1,p_2,\ldots,p_s\) of the inequality \[|p_1^c+p_2^c+\ldots +p_s^c-N|\leq \varepsilon,\] where the exponent \(c\) is not an integer, \(\varepsilon\) is a fixed small positive number and \(N\) is a large real. Let \(c\geq 5\) not an integer, \(1-\rho\leq\gamma\leq 1\), where \(\rho=(8c^2+12c+12)^{-1}\). The main result states that for \(s \ge 4c\log c+\frac{4}{3}c+10\) and for sufficiently large \(N\) the inequality \[|p_1^c+p_2^c+\ldots +p_s^c-N|\leq (\log N)^{-1}\] has solutions in prime numbers \(p_1,p_2,\ldots,p_s\) belonging to \(\mathcal N_{\gamma}\). For \(s=2,3,4\) special statements are proved.
      0 references
      Diophantine inequalities
      0 references
      Piatetski-Shapiro primes
      0 references
      additive prime number theory
      0 references
      exponential sums over primes
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references