Square-full numbers in short intervals
Published online by Cambridge University Press: 24 October 2008
Extract
A positive integer n is called square-full if p2|n for every prime factor p of n. Let Q(x) denote the number of square-full integers up to x. It was shown by Bateman and Grosswald [1] that
Bateman and Grosswald also remarked that any improvement in the exponent would imply a ‘quasi-Riemann Hypothesis’ of the type for . Thus (1) is essentially as sharp as one can hope for at present. From (1) it follows that, for the number of square-full integers in a short interval, we have
when and y = o (x½). (It seems more suggestive) to write the interval as (x, x + x½y]) than (x, x + y], since only intervals of length x½ or more can be of relevance here.)
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 110 , Issue 1 , July 1991 , pp. 1 - 3
- Copyright
- Copyright © Cambridge Philosophical Society 1991
References
REFERENCES
- 8
- Cited by