Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-25T12:53:38.270Z Has data issue: false hasContentIssue false

On sums of two squarefull numbers

Published online by Cambridge University Press:  24 October 2008

R. C. Baker
Affiliation:
Department of Mathematics, Brigham Young University, Provo, Utah 84602, U.S.A.
J. Brüdern
Affiliation:
Mathematisches Institut, Bunsenstrasse 3–5, D-W-3400 Göttingen, Germany

Extract

A natural number n is said to be squarefull if p|n implies p2|n for primes p. The set of all squarefull numbers is not much more dense in the natural numbers than the set of perfect squares but their additive properties may be rather different. We are more precise only in the case of sums of two such integers as this is the problem with which we are concerned here. Let U(x) be the number of integers not exceeding x and representable as the sum of two integer squares. Then, according to a theorem of Landau [4],

as x tends to infinity.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Atkin, A. O. L.. On pseudo-squares. Proc. London Math. Soc. (3) 14 (1965), 2227.CrossRefGoogle Scholar
[2]Davenport, H.. The higher arithmetic. (London, 1968).Google Scholar
[3]Halberstam, H. and Richert, H. E.. Sieve methods (London, 1974).Google Scholar
[4]Landau, E.. Handbuch der Lehre von der Verteilung der Primzahlen, 2 Bd. (Leipzig, 1909).Google Scholar
[5]Montgomery, H. L. and Vaughan, R. C.. The large sieve. Mathematika 20 (1973), 119134.CrossRefGoogle Scholar
[6]Odoni, R. W. K.. On a problem of Erdös on sums of two squarefull numbers. Acta Arith. 39 (1981), 145162.CrossRefGoogle Scholar