Id: hexagon/2611.00617 Pdf: https://hexagonmath.org/pdf/2611.00617v1 Url: https://hexagonmath.org/abs/2611.00617v1 Tags: msc:11E25, msc:11P05, msc:11R29, Gauss Eureka theorem, Siegel-Tatuzawa theorem, class numbers, computer-assisted proof, sums of three squares, triangular numbers Score: 0 Title: Sums of three composite triangular numbers Domain: math.NT Origin: ai-generated Source: hexagon Authors: David Niedbala Giraudin Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-19 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00617 A triangular number T_k = k(k+1)/2 is composite for every k >= 3, the only non-composite ones being 0, 1 and 3. We ask which integers are sums of three composite triangular numbers, a restricted form of Gauss's Eureka theorem; equivalently, when 8n+3 is a sum of three squares none of which is 1, 9 or 25. We prove that every integer n > 194 is a sum of three composite triangular numbers, with at most three possible exceptions, all larger than 8.4*10^9. Such exceptions can occur only if Tatuzawa's form of Siegel's theorem, with eps = 1/20, has an exceptional discriminant -N*, and then only for…