Sums of four polygonal numbers with coefficients
Xiang-Zi Meng, Zhi-Wei Sun

TL;DR
This paper investigates representations of large integers as sums of four polygonal numbers with specific coefficients, confirming a conjecture by Z.-W. Sun and identifying conditions for universal representation.
Contribution
It establishes new conditions under which sums of four polygonal numbers with coefficients can represent all sufficiently large integers, including confirming Sun's conjecture.
Findings
Confirmed Sun's conjecture for order 6 polygonal numbers.
Identified conditions for coefficients (a,b) to ensure universal representation.
Proved that certain linear combinations of polygonal numbers can represent all large integers.
Abstract
Let be an integer. The polygonal numbers of order are given by . A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of polygonal numbers of order . For , we study whether any sufficiently large integer can be expressed as with nonnegative integers. We show that the answer is positive if , or , or . In particular, we confirm a conjecture of Z.-W. Sun which states that any natural number can be written as with nonnegative integers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and Theory of Mathematics · Analytic Number Theory Research · Advanced Mathematical Identities
