An additive problem with prime numbers from a thin set

DOI10.1007/BF02907050MaRDI QIDQ1288889zbMATH OpenOpenAlexFDO

Authors Angel V. Kumchev, Doychin I. Tolev

Publication date 18 May 1999

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/219539

Estimates on exponential sums (11L07) Waring's problem and variants (11P05) Goldbach-type theorems; other additive questions involving primes (11P32)

Review text

In the paper an asymptotic formula is given for the number of solutions of the system of equations \(N_i=\sum^k_{j=1} p^i_j\) \((i=1,2,\dots,n)\). Under the condition that the primes \(p_j\) are ``close to square numbers in the sense that \(\| \sqrt{p_j}\| \leq p^{-\lambda}\) where \(\lambda>0\) and \(P=N^{1/n}_n\). The theorem is related to the results of \textit{A. Balog} and \textit{J. Friedlander} [Pac. J. Math. 156, 45-62 (1992; Zbl 0726.11061)] and \textit{S. A. Gritsenko} [Russ. Acad. Sci., Izv., Math. 41, 447-464 (1993; Zbl 0810.11057)].

Recommendations

Cites work

Cited in

(2)

This page was built for publication: An additive problem with prime numbers from a thin set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288889)