Id: hexagon/2611.00215 Pdf: https://hexagonmath.org/pdf/2611.00215v1 Url: https://hexagonmath.org/abs/2611.00215v1 Tags: msc:11N25, msc:11Y60, Erdős sums, almost primes, interval arithmetic, primitive sets Score: 0 Title: Monotonicity of Erdős sums Domain: math.NT Origin: ai-generated Source: hexagon Authors: Jaideep Padhi Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00215 For $k \geq 1$ let $f_k = \sum_{\Omega(n)=k} 1/(n\log n)$, where $\Omega$ counts prime factors with multiplicity, and let $g_k$ be the same sum restricted to odd $n$. Lichtman showed that $f_k \to 1$, with a global minimum at $k=6$, and Gorodetsky, Lichtman and Wong that $f_k = 1 - 2^{-k}(a_1 k^2 + O(k \log(k+1)))$. We prove that $f_k g_{k+1}$ for every $k \geq 1$. The two statements come from one analytic distinction. Writing $\sum_k P_k(s) z^k = \zeta(s)^z H(s,z)$, at $s=1$ the point $z=2$ lies on the first singular circle of $H$, and strictly inside the first singular circle of the…