Claims

../

2026_01_13_chojecki: Two ulam.ai notes of 13 and 14 January 2026 by Przemyslaw Chojecki claimed that the truncated greedy reciprocal sum diverges in both formulations; the author withdrew the claim as a reduction after the curator noted the gap.

2026_01_14_chojecki: In both formulations the truncated greedy sum is at least the rough sum f(n), whose mean over n up to N is at least a constant times log log N, so the truncated sum is unbounded; the limit is left open.

---