The Wayback Machine - https://web.archive.org/web/20110809074730/http://www.mathomatic.org/math/doc/matho-sumsq.1.html
Table of Contents

Name

matho-sumsq - Find the minimum sum of the squares for integers

Synopsis

matho-sumsq [numbers]

Description

This command-line utility is optionally part of the mathomatic(1) package. It finds the minimum number of positive integers that when squared and added together, equal the given number. There is a proof that no more than 4 squares summed together are required to represent any positive integer.

The command line may contain positive integers, less than 2147483648 (2^31), to find the squares of, otherwise the program counts up from 0. If the number of squares is 2, this program displays all possible combinations, otherwise it just displays the first combination it finds.

Author

George Gesslein II (gesslein@linux.com) at "http://www.mathomatic.org ".

Reporting Bugs

If you find a bug, please report it to the author or at "https://launchpad.net/mathomatic ".

See Also

mathomatic(1) , matho-pascal(1) , matho-primes(1)

Table of Contents

Morty Proxy This is a proxified and sanitized view of the page, visit original site.