The maximal \(k\)-full divisor of an integer (Q1147748)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3704686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximal \(k\)-full divisor of an integer |
scientific article; zbMATH DE number 3704686 |
Statements
The maximal k-full divisor of an integer (English)
0 references
The maximal \(k\)-full divisor of an integer (English)
0 references
1981
0 references
asymptotic formula
0 references
maximal k-free divisor
0 references
Let \(k\) be a fixed integer \(\ge 2\). A positive integer is called \(k\)-full if \(p^k\mid n\) for every prime factor \(p\) of \(n\). The integer 1 is also considered to be \(k\)-full. Let \(M_k(n)\) denote the maximal \(k\)-full divisor of \(n\). In this paper we deduce an asymptotic formula for \[ \sum_{n \leq x} \frac{1}{\gamma_k^*(n)}, \] where \(\gamma_k^*(n)\) denotes the maximal unitary \(k\)-free divisor of \(n\).
0 references