On the estimate for a mean value relative to 4/p=1/n1+1/n2+1/n3

Abstract

For the positive integer n, let f(n) denote the number of positive integer solutions (n1, n2, n3) of the Diophantine equation 4 n=1 n1+1 n2+1 n3. For the prime number p, f(p) can be split into f1(p)+f2(p), where fi(p)(i=1, 2) counts those solutions with exactly i of denominators n1, n2, n3 divisible by p. Recently Terence Tao proved that Σp< xf1(p) x(c x x) with other results. In this paper we shall improve it to Σp< xf1(p) x5x2x.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…