Representing Sets with Sums of Triangular Numbers
From MaRDI portal
Abstract: We investigate here sums of triangular numbers where is the -th triangular number. We show that for a set of positive integers there is a finite subset such that represents if and only if represents . However, computationally determining is ineffective for many choices of . We give an explicit and efficient algorithm to determine the set under certain Generalized Riemann Hypotheses, and implement the algorithm to determine when is the set of all odd integers.
Recommendations
Cited in
(5)- An algorithmic approach to some problems on the representation of natural numbers as sums without repetitions
- scientific article; zbMATH DE number 3979071 (Why is no real title available?)
- The triangular theorem of eight and representation by quadratic polynomials
- Almost universal sums of triangular numbers with one exception
- Even universal sums of triangular numbers
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)