On certain sums involving the largest prime factor over integer sequences

Abstract

Given an integer $ n \geq 2 $, its prime factorization is expressed as $ n = \prod p_i^{a_i} $. We define the function $ f(n) $ as the smallest positive integer satisfying the following condition: \[ \nu_{p}\left(\frac{f(n)!}{n}\right) \geq 1, \quad \forall p \in \{p_1, p_2, \dots, p_s\}, \] where $ \nu_{p}(m) $ denotes the $ p $-adic valuation of $ m $. The main objective of this paper is to derive an asymptotic formula for both sums $ \sum_{n\leq x} f(n) $ and $ \sum_{n \leq x, n \in S_k} f(n) $, where $ S_k $ denotes the set of all $ k $-free integers.

Categories