Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the ternary Estermann problem with almost proportional summands

Published 7 Oct 2025 in math.NT | (2510.05602v1)

Abstract: For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+mn=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the conditions $$ \left|p_k-\mu_kN\right|\le H, \quad k=1,2,\qquad \left|mn-\mu_3N\right|\le H,\qquad H \ge N{1-\frac1{n(n-1)}} {\mathscr{L}}{\frac{2{n+1}}{n-1}+n-1},$$ for $\mu_1+\mu_2+\mu_3=1, \ \ \mu_i >0, \mathscr{L} = \ln{N}. $ Keywords: Estermann problem, almost proportional summands, short exponential sum of G. Weyl, small neighborhood of centers of major arcs. Bibliography: 20 titles.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.