Home
Hostname: page-component-cf9d5c678-m9wwp Total loading time: 0.227 Render date: 2021-07-30T12:00:50.398Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

# The Number of Unitarily k-Free Divisors of An Integer

Published online by Cambridge University Press:  09 April 2009

## Extract

Let k be a fixed integer ≧ 2. A positive integer n is called unitarily k-free, if the multiplicity of each prime factor of n is not a multiple of k; or equivalently, if n is not divisible unitarily by the k-th power of any integer > 1. By a unitary divisor, we mean as usual, a divisor d> 0 of n such that (d, n/d) = 1. The interger 1 is also considered to be unitarily k-free. The concept of a unitarily k-free integer was first introduced by Cohen (1961; §1). Let denote the set of unitarily k-free integers. When k = 2, the set coincides with the set Q* of exponentially odd integers (that is, integers in whose canonical representation each exponent is odd) discussed by Cohen himself in an earlier paper (1960; §1 and §6). A divisor d > 0 of the positive integer n is called a unitarily k-free divisor of n if d. Let (n) denote the number of unitarily k-free divisors of n.

Type
Research Article
Information
Journal of the Australian Mathematical Society , February 1976 , pp. 19 - 35

## References

Cohen, E. (1960), ‘Arithmetical functions associated with the unitary divisors of an integer’, Math. Z. 74, 6680.CrossRefGoogle Scholar
Cohen, E. (1961), ‘Some sets of integers related to the k-free integers’, Acta Sci. Math. (Szeged) 22, 223233.Google Scholar
Hardy, G. H. and Wright, E. M. (1960), An Introduction to the Theory of Numbers (Clarendon Press, Oxford, 4th ed. 1960).Google Scholar
Kolesnik, G. A. (1969), ‘An improvement of the remainder term in the divisors problem’, Mat. Zametki 6, 545554 = Math. Notes 6, 784–791.Google Scholar
Suryanarayana, D. and Prasad, V. Siva Rama (1973), ‘The number of k-free and k-ary divisors of m which are prime to n., J. Reine Angew Math., 264, 5675.Google Scholar
Suryanarayana, D. and Rao, R. Sita Rama Chandra (1975), ‘Distribution of unitarily k-free integers’, J. Austral. Math. Soc. 20, 129141.CrossRefGoogle Scholar
Suryanarayana, D. and Rao, R. Sita Rama Chandra (to appear), ‘The number of bi-unitary divisors of an integer-II’, J. Indian Math. Soc.Google Scholar
You have Access

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The Number of Unitarily k-Free Divisors of An Integer
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

The Number of Unitarily k-Free Divisors of An Integer
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

The Number of Unitarily k-Free Divisors of An Integer
Available formats
×
×