Abstract
We investigate here sums of triangular numbers where T n is the nth triangular number. We show that for a set of positive integers S, there is a finite subset S 0 such that f represents S if and only if f represents S 0 . However, computationally determining S 0 is ineffective for many choices of S. We give an explicit and efficient algorithm to determine the set S 0 under certain generalized Riemann hypotheses, and implement the algorithm to determine S 0 when S is the set of all odd integers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
