Representing Sets with Sums of Triangular Numbers

From MaRDI portal



Abstract: We investigate here sums of triangular numbers f(x):=sumibiTxi where Tn is the n-th triangular number. We show that for a set of positive integers S there is a finite subset S0 such that f represents S if and only if f represents S0. However, computationally determining S0 is ineffective for many choices of S. We give an explicit and efficient algorithm to determine the set S0 under certain Generalized Riemann Hypotheses, and implement the algorithm to determine S0 when S is the set of all odd integers.






Describes a project that uses

Uses Software






This page was built for publication: Representing Sets with Sums of Triangular Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396254)