Claims

../

2026_09_03_adamczewski: A Lean proof by a pre-release GPT-6 Astra, in Tom Adamczewski's repository: pairwise sums of n distinct naturals have at least about sqrt(n/3) distinct prime factors, so f(n)/log n tends to infinity; accepted on Lean built here.

2026_09_04_johnvictor36: A forum claim with a Lean repository and a draft write-up asserts that the pairwise sums of any n positive integers have at least sqrt(n/12) distinct prime factors; pending independent acceptance and proof review.

---