Summing the largest prime factor over integer sequences

• Jean-Marie De Koninck ^[1] ; Rafael Jakimczuk ^[2]
  1. [1] Laval University

     Laval University

     Canadá

     
  2. [2] Universidad Nacional de Luján

     Universidad Nacional de Luján

     Argentina

     
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 67, Nº. 1, 2024, págs. 27-35
• Idioma: inglés
• DOI: 10.33044/revuma.3154
• Enlaces
  • Texto completo
• Resumen

  • Given an integer n≥2n≥2, let P(n)P(n) stand for its largest prime factor. We examine the behaviour of ∑n≤xn∈AP(n)∑n≤xn∈AP(n) in the case of two sets AA, namely the set of rr-free numbers and the set of hh-full numbers.

• Referencias bibliográficas
  • 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...
  • 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....
  • F. Pappalardi, A survey on k-freeness, in Number theory, Ramanujan Math. Soc. Lect. Notes Ser. 1, Ramanujan Math. Soc., Mysore, 2005, pp....