matho-sumsq(1) manual page

Table of Contents

## Name

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

## Synopsis

matho-sumsq [numbers]

## Description

This program 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.

This program is part of the mathomatic(1) package.

## See Also

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

## Bugs

Please report bugs to George Gesslein II <gesslein@panix.com>.

Table of Contents

- Name
- Synopsis
- Description
- See Also
- Bugs