Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Waring-Goldbach problem in short intervals (1912.02310v2)

Published 4 Dec 2019 in math.NT

Abstract: Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions, can be written as $$ n=p_1k+\cdots+p_sk, $$ where $p_i(1\leq i\leq s)$ are primes in the interval $((\frac{n}{s}){\frac{1}{k}}-n{\frac{\theta}{k}},(\frac{n}{s}){\frac{1}{k}}+n{\frac{\theta}{k}}]$. The second result of this paper is to show that if $s>\frac{k(k+1)}{2}$ and $\theta>0.55$, then almost all integers $n$, subject to certain congruence conditions, have above representation.

Summary

We haven't generated a summary for this paper yet.