On the additive completion of squares. II (Q1183256)

[Part I, cf. the first author, J. Number Theory 29, No. 1, 10-12 (1988; Zbl 0645.10047).] Let \(B\) be a set of integers such that every \(n\leq N\) can be written as the sum of an element from \(B\) and a perfect square. It is shown that \(| B| \geq 1.245\sqrt{N}\), thus improving the constant in the estimate \(| B|\geq 1.15\sqrt{N}\) due to the first author.