We study the arithmetic function κm(n), defined as the largest m-power-free divisor of n. We establish its fundamental properties and solve several Diophantine equations involving κm(n) and Euler’s totient function φ(n). We prove that φ(n) = κm(n) has exactly m+1 solutions, characterize all solutions to φ(n)|κm(n), and provide a complete parametric description of solutions to κm(n)=d. Our results highlight the utility of the maximal divisor characterization in Diophantine analysis.
Download files
Citation rules
Licence

This work is licensed under a Creative Commons Attribution 4.0 International License.
The Copyright Holders of the submitted text are the Author and the Journal. The Reader is granted the right to use the pdf documents under the provisions of the Creative Commons 4.0 International License: Attribution (CC BY). The user can copy and redistribute the material in any medium or format and remix, transform, and build upon the material for any purpose.
You may also start an advanced similarity search for this article.
2026
Published: 2026-07-07
10.2478/amsil