Decomposes Positive Integer either as Sum of Triangular or Square Numbers
Change downloaded file extension from .zipped to .zip, and change Acorn filetype to 'Archive'.
Demonstrates that any Positive Integer can be represented as a Sum of either (up to) three Triangular Numbers (of the form n.(n+1)/2, for some n), or (up to) four Square Numbers (of the form n.n, for some n). User supplies chosen numbers (for Triangular or Square representation), clicks on the appropriate button/s, and !SumTriSqr does the rest! (Representation may not be unique).