Sums of three composite triangular numbers
Source: hexagonmath.org/abs/2611.00617v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00617
curl -X POST /api/v1/records/hexagon/2611.00617/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00617/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'