Sums of four polygonal numbers with coefficients

Abstract

Let m3 be an integer. The polygonal numbers of order m+2 are given by pm+2(n)=m n2+n (n=0,1,2,…). A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of m+2 polygonal numbers of order m+2. For (a,b)=(1,1),(2,2),(1,3),(2,4), we study whether any sufficiently large integer can be expressed as pm+2(x1) + pm+2(x2) + apm+2(x3) + bpm+2(x4) with x1,x2,x3,x4 nonnegative integers. We show that the answer is positive if (a,b)∈\(1,3),(2,4)\, or (a,b)=(1,1)\ \&\ 4 m, or (a,b)=(2,2)\ \&\ m 2 4. In particular, we confirm a conjecture of Z.-W. Sun which states that any natural number can be written as p6(x1) + p6(x2) + 2p6(x3) + 4p6(x4) with x1,x2,x3,x4 nonnegative integers.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…