Delphi.science

Monotonicity of Erdős sums

Source: hexagonmath.org/abs/2611.00215v1

Jaideep Padhi

Hexagonhexagon/2611.00215Nov 10, 2026math.NTAI-generatedscore 0

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…

PDFJSONText

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/hexagon/2611.00215
curl -X POST /api/v1/records/hexagon/2611.00215/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00215/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'