On the Greatest Prime Divisor of the Sum of Two Squares of Primes

One of the most famous theorems in number theory states thatthere are infinitely many positive prime numbers (namely p =2 and the primes p 1 mod4) that can be represented in the formx²₁+x²₂, where x₁ and x₂ are positive integers. In a recentpaper, Fouvry and Iwaniec 2] have shown that this statementremains valid even if one of the variables, say x₂, is restrictedto prime values only. In the sequel, the letter p, possiblywith an index, is reserved to denote a positive prime number.As p²₁=p²₂ = p is even for p₁, p₂ > 2, it is reasonable toconjecture that the equation p²₁=p²₂ = 2p has an infinity ofsolutions. However, a proof of this statement currently seemsfar beyond reach. As an intermediate step in this direction,one may quantify the problem by asking what can be said aboutlower bounds for the greatest prime divisor, say P(N), of thenumbers p²₁=p²₂, where p₁, p₂ N, as a function of the realparameter N 1. The well-known Chebychev–Hooley methodcombined with the Barban–Davenport–Halberstam theoremalmost immediately leads to the bound P(N) N^1–, if N N_o(); here, denotes some arbitrarily small fixed positivereal number. The first estimate going beyond the exponent 1has been achieved recently by Dartyge 1, Théorème1], who showed that P(N) N^10/9–. Note that Dartyge'sproof provides the more general result that for any irreduciblebinary form f of degree d 2 with integer coefficients the greatestprime divisor of the numbers |f(p₁, p₂)|, p₁, p₂ N, exceedsN^_d–, where _d = 2 – 8/(d = 7). We in particular wantto point out that Dartyge does not make use of the specificfeatures provided by the form x²₁+x²₂. By taking advantage ofsome special properties of this binary form, we are able toimprove upon the exponent ₂ = 10/9 considerably.