ABOUT ONE ANALOG OF THE ADDITIVE DIVISOR PROBLEM WITH QUADRATIC FORMS

Abstract

In the number theory additive problems is very important. One of them is the Ingam binary additive divisor problem on the representation of natural number as the difference of product of numbers. Many mathematician like T. Esterman, D. I. Ismoilov, D. R. Heath-Brown, G. I. Arkhipov and V. N. Chubarikov, J.-M. Deshouillers and H. Iwaniec improved the remainder term in the asymptotic formula of the number of solution of this diophantine equation. In present paper one problem with quadratic forms is considered. This problem is analog of the Ingam binary additive divisor problem. Let d — negative square-free number, F = Q( √ d) — imaginary quadratic field, δF — discriminant of field F, Q1(m), Q2(k) — binary positive defined primitive quadratic forms with matrixes A1, A2, det A1 = det A2 = −δF , ε > 0 — arbitrarily small number; n ∈ N, h ∈ N. The asymptotical formula of the number of solution of diophantine equation Q1(m) − Q2(k) = h with weight coefficient exp ( −(Q1(m) + Q2(k))/n) is received. In this asymptotical formula discriminant of field δF is fixed and the remainder term is estimating as O(h εn 3/4+ε ), which not depend of δF . Moreover the parameter h grow as O(n) with growing on the main parameter n. Proof of the asymptotical formula based on circular method when sum, which is solution of diophantine equation, may be representing as integral. Interval of integration divided by numbers of Farey series. The taking weight coefficient allow to use the functional equation of the theta-function. Moreover the estimation of one sum with Gauss sums is important. Using the evident formula of some product of Gauss sums of the number which coprimes of discriminant of field this sum represented of Kloosterman’s sum which estimate by A. Weil.