Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T14:18:47.683Z Has data issue: false hasContentIssue false

The divisor problem for (k, r) — integers1

Published online by Cambridge University Press:  09 April 2009

M. V. Subbarao
Affiliation:
Department of MathematicsUniversity of AlbertaEdmonton, Canada
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 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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1973