{"id":"palomar/PALOMAR-2026-11-19-000034","url":"https://github.com/rivkalipko/erdos-878-asymptotics/tree/4c47e6de8732037482450e83c71869aad107c1f4","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000034-v1.json","repo":"https://github.com/rivkalipko/erdos-878-asymptotics","tags":["math.NT","msc:11N37","msc:11N35"],"score":0,"title":"An asymptotic equivalent for the harmonic sum in Erdős Problem 878(v)","trust":"high","domain":"math.NT","source":"palomar","authors":["Rivka Lipkovitz"],"reviews":0,"subject":"math.NT","summary":"Let f(n) be the sum over prime divisors p of n of the greatest power of p at most n. The weighted sum of f(n)/n over 1 ≤ n < x is asymptotic to an explicit sum over primes p ≤ (log x)^2. Each prime contributes a term depending on the remainder of log x modulo log p. The proof combines a finite harmonic-sum estimate with a uniform short-interval prime bound.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-19","reactions":{},"formalized":true}