Table of Contents
Fetching ...

Waring's problem with almost proportional summands

Zarullo Rakhmonov, Firuz Rakhmonov

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 = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1, r}$, satisfying the conditions $$ |x_i^n-μ_iN|\le H,\qquad H\ge N^{1-θ(n,r)+\varepsilon},\qquad θ(n,r)=\frac2{(r+1)(n^2-n)}, $$ where $μ_1, \ldots, μ_r$ are positive fixed numbers, and $μ_1 + \ldots + μ_n = 1$. This result strengthens the theorem of E.M.Wright.

Waring's problem with almost proportional summands

Abstract

For , an asymptotic formula is derived for the number of representations of a sufficiently large natural number as a sum of summands, each of which is an -th power of natural numbers , , satisfying the conditions where are positive fixed numbers, and . This result strengthens the theorem of E.M.Wright.

Paper Structure

This paper contains 12 sections, 15 theorems, 197 equations.

Key Result

Theorem 1.1

Let $N$ be a sufficiently large natural number, $n\ge3$ be a natural number, $r=2^n+1$, and $\mu_1,\ldots,\mu_r$ be positive fixed numbers satisfying the condition $J_{n,r}(N,H)$ is the number of solutions to the Diophantine equation (Formula-x1n+...+xrn=N) under the conditions Then, for $H\ge N^{1-\theta(n,r)+\varepsilon}$, the following asymptotic formula holds: where $\gamma(n,r)$ is an abso

Theorems & Definitions (17)

  • Theorem 1.1
  • Corollary 1.1
  • Theorem 1.2
  • Corollary 1.2
  • Corollary 1.3
  • Theorem 1.3
  • Lemma 2.1
  • Lemma 2.2
  • Lemma 2.3
  • Lemma 2.4
  • ...and 7 more