Papers
Topics
Authors
Recent
Search
2000 character limit reached

Waring's problem with almost proportional summands

Published 9 Nov 2024 in math.NT | (2411.06153v1)

Abstract: For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1, r}$, satisfying the conditions $$ |x_in-\mu_iN|\le H,\qquad H\ge N{1-\theta(n,r)+\varepsilon},\qquad \theta(n,r)=\frac2{(r+1)(n2-n)}, $$ where $\mu_1, \ldots, \mu_r$ are positive fixed numbers, and $\mu_1 + \ldots + \mu_n = 1$. This result strengthens the theorem of E.M.Wright.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.