Representations of positive integers by three almost-prime squares

Abstract

Let $P_r$ denote an integer with at most $r$ prime factors, counted with multiplicity. It is known that every sufficiently large integer $N$ satisfying $N \equiv 3 \pmod{24}$ and $5 \nmid N$, can be written in the form $N= x_1^2+x_2^2+x_3^2$ where $x_1,x_2,x_3$ are integers. In this paper, we prove that the above representation in the following two different forms (i) $x_1x_2x_3$ is a $P_{67}$-number; (ii) each $x_i$ is a $P_{27}$-number. This result improves on the previous result of Waibel\cite{Wa}, in which $P_{72}$ was obtained in place of $P_{67}$. The proofs combine the higher-dimensional sieve, a Richert-type weighted sieve method introduced by Cai \cite{Cai} with a Bombieri-Vinogradov type result given by Waibel\cite{Wa}. Applying the same method in a one dimensional sieve setting, we also show that every sufficiently large $N$ not of the form $4^k(8l+7)$ can be written in the form \[ N = x^{2} + y^{2} + (2^{a} z)^{2}, \] where $x,y,a,z$ are non-negative integers and $z$ is a $P_{18}$-number. This improves upon a result of Banerjee \cite{Ban} who obtained $P_{118}$ in place of $P_{18}$.