Summing the largest prime factor over integer sequences
DOI:
https://doi.org/10.33044/revuma.3154Abstract
Given an integer $n\ge 2$, let $P(n)$ stand for its largest prime factor. We examine the behaviour of $\displaystyle{\sum_{n\le x \atop n\in A} P(n)}$ in the case of two sets $A$, namely the set of $r$-free numbers and the set of $h$-full numbers.
Downloads
References
K. Alladi and P. Erdős, On an additive arithmetic function, Pacific J. Math. 71 no. 2 (1977), 275–294. DOI MR Zbl
J.-M. De Koninck and A. Ivić, The distribution of the average prime divisor of an integer, Arch. Math. (Basel) 43 no. 1 (1984), 37–43. DOI MR Zbl
A. Ivić and P. Shiu, The distribution of powerful integers, Illinois J. Math. 26 no. 4 (1982), 576–590. MR Zbl
I. Niven, H. S. Zuckerman, and H. L. Montgomery, An introduction to the theory of numbers, fifth ed., John Wiley & Sons, New York, 1991. MR Zbl
F. Pappalardi, A survey on $k$-freeness, in Number theory, Ramanujan Math. Soc. Lect. Notes Ser. 1, Ramanujan Math. Soc., Mysore, 2005, pp. 71–88. MR Zbl
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Jean-Marie De Koninck, Rafael Jakimczuk
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. The Journal may retract the paper after publication if clear evidence is found that the findings are unreliable as a result of misconduct or honest error.
