{"paper":{"title":"On universal sums of polygonal numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2009-05-05T18:59:03Z","abstract_excerpt":"For $m=3,4,\\ldots$, the polygonal numbers of order $m$ are given by $p_m(n)=(m-2)\\binom n2+n\\ (n=0,1,2,\\ldots)$. For positive integers $a,b,c$ and $i,j,k\\ge3$ with $\\max\\{i,j,k\\}\\ge5$, we call the triple $(ap_i,bp_j,cp_k)$ universal if for any $n=0,1,2,\\ldots$ there are nonnegative integers $x,y,z$ such that $n=ap_i(x)+bp_j(y)+cp_k(z)$. We show that there are only 95 candidates for universal triples (two of which are $(p_4,p_5,p_6)$ and $(p_3,p_4,p_{27})$), and conjecture that they are indeed universal triples. For many triples $(ap_i,bp_j,cp_k)$ (including $(p_3,4p_4,p_5),(p_4,p_5,p_6)$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0635","kind":"arxiv","version":22},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}