The finite test set conjecture for sums of triangular numbers representing odd integers

From papers

Let ffcolon be a sum of triangular numbers, and say that ff represents an integer nn when there is an admissible choice of variables for which f=nf=n. The claim concerns representation of the set of all odd positive integers.

Finite test set conjecture. A sum of triangular numbers ff represents all odd integers if and only if it represents the integers

1,5,7,9,11,13,17,19,25,29,35,49,89.1,5,7,9,11,13,17,19,25,29,35,49,89.

This conjecture proposes an explicit finite test set for odd integers; the surrounding theorem establishes only the general existence of some finite subset, while the displayed set is supported by a computer calculation and its sufficiency remains to be proved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ben Kane, “Representing Sets with Sums of Triangular Numbers”, arXiv:0903.3026 (2009).

Solutions 0

No solutions have been posted yet.