Hostname: page-component-76fb5796d-skm99 Total loading time: 0 Render date: 2024-04-28T09:19:08.749Z Has data issue: false hasContentIssue false

Powerful numbers in short intervals

Published online by Cambridge University Press:  17 April 2009

Jean-Marie De Koninck
Affiliation:
Départment de Mathématiques, Université Laval, Québec G1K 7P4, Canada, e-mail: jmdk@mat.ulaval.ca
Florian Luca
Affiliation:
Instituto de Matemáticas, Universidad Nacional Autónoma de México, C.P. 58180, Morelia, Michoacán, México, e-mail: fluca@matmor.unam.mx
Igor E. Shparlinski
Affiliation:
Department of Computing, Macquarie University, Sydney, NSW 2109, Australia, e-mail: igor@ics.mq.edu.au
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let κ ≥ 2 be an integer. We show that there exist infinitely many positive integers N such that the number of κ-full integers in the interval (Nκ, (N + 1)κ) is at least (log N)1/3+ο(1). We also show that the ABC-conjecture implies that for any fixed δ > 0 and sufficiently large N, the interval (N, N + N1−(2+δ)/κ) contains at most one κ-full number.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2005

References

[1]Bateman, P. and Grosswald, E., ‘On a theorem of Erdös and Szekeres’, Illinois J. Math. 2 (1958), 8898.CrossRefGoogle Scholar
[2]Halberstam, H. and Richert, H.-E., Sieve methods (Academic Press, London, 1974).Google Scholar
[3]De Koninck, J.-M. and Luca, F., ‘Sur la proximité des nombres puissants’, Acta Arith. 114 (2004), 149157.CrossRefGoogle Scholar
[4]Loxton, J.H., ‘Some problems involving powers of integers’, Acta Arith. 46 (1986), 113123.CrossRefGoogle Scholar
[5]Schmidt, W.M., Diophantine approximation (Springer-Verlag, Berlin, 1980).Google Scholar
[6]Stewart, C.L. and Yu, K.R., ‘On the abc conjecture, II’, Duke Math. J. 108 (2001), 169181.CrossRefGoogle Scholar