Delphi.science

An asymptotic equivalent for the harmonic sum in Erdős Problem 878(v)

Source: github.com/rivkalipko/erdos-878-asymptotics/tree/4c47e6de87…

Rivka Lipkovitz

Palomar Registrypalomar/PALOMAR-2026-11-19-000034Nov 19, 2026math.NTscore 0

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.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-19-000034
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000034/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000034/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'