On sums of k-th powers with almost equal primes

arXiv2204.07715MaRDI QIDQ6396643FDOQ6396643

Publication date: 16 April 2022

Abstract: For "almost all" sufficiently large

N,

satisfying necessary congruence conditions and

k g e q 2

, we show that there is an {�f asymptotic formula} for the number of solutions of the equation �egin{align*} �egin{split} &N=p_{1}^{k}+p_{2}^{k}+cdots+p_{s}^{k}, \ &left|p_{i}-( N/s)^{1/k} ight|leq (N/s)^{ heta/k}, (1leq ileq s) end{split} end{align*} with �egin{align*} sgeq frac{k(k+1)}{2}+1 extup{and} hetageq {�f 2/3}+varepsilon. end{align*} This enlarges the effective range of

s

for which can be obtained by the method of M"{a}tomaki and Xuancheng Shao cite{MS}. [Discorrelation between primes in short intervals and polynomial phase, Int. Math. Res. Not. IMRN 2021, no. 16, 12330-12355.] The idea is to avoid using the exponential sums (1.2) and Vinogradov mean value theorems in Lemma 2.4 simultaneously. And the main new ingredient is from Kumchev and Liu cite{KL} (see Lemma 2.2).

This page was built for publication: On sums of $k$-th powers with almost equal primes

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