Article contents
The divisor problem for (k, r) — integers1
Published online by Cambridge University Press: 09 April 2009
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 k and r be fixed integers such that 1 < r < k. It is well-known that a positive integer is called r-free if it is not divisible by the r-th power of any integer > 1. We call a positive integer n, a (k, r)-integer, if n is of the form n = a kb, where a is a positive integer and b is a r-free integer. In the limiting case, when k becomes infinite, a (k, r)-integer becomes a r-free integer and so one might consider the (k, i) integers as generalized r-free integers.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1973
References
[1]Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers Fourth edition, (Oxford, 1965).Google Scholar
[2]Kolesnik, G. A., ‘An improvement of the remainder term in the divisor problem’, Mat. Zametki 6 (1969), 545–554 = Mathematical Notes of Sciences of the USSR 6 (1969), 784–791.Google Scholar
[3]Subbarao, M. V. and Suryanarayana, D., ‘On the order of the error function of the (k, r)-integers’, J. Number theory (to appear).Google Scholar
[4]Suryanarayana, D. and Prasad, V. Siva Rama, ‘The number of k-free divisors of an integer’, Acta Arithmetica, 17 (1971), 345–354.CrossRefGoogle Scholar
[6]Walfisz, A., Weylsche Exponentialsummen in der neueran Zahlentheorie (Berlin, 1963).Google Scholar
- 1
- Cited by