1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
<!-- manual page source format generated by PolyglotMan v3.0.8+X.Org, -->
<!-- available at http://polyglotman.sourceforge.net/ -->
<html>
<head>
<title>matho-sumsq(1) manual page</title>
</head>
<body bgcolor='#efefef' text='black' link='blue' vlink='#551A8B' alink='red'>
<a href='#toc'>Table of Contents</a><p>
<p>
<h2><a name='sect0' href='#toc0'>Name</a></h2>
matho-sumsq - Find the minimum sum of the squares for integers
<p>
<h2><a name='sect1' href='#toc1'>Synopsis</a></h2>
<b>matho-sumsq</b>
[<i>numbers</i>]<i></i>
<p>
<h2><a name='sect2' href='#toc2'>Description</a></h2>
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.
<p> 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.
<p> This program is part of the <a href='mathomatic.1.html'><b>mathomatic(1)</b></a>
package.
<p>
<h2><a name='sect3' href='#toc3'>See Also</a></h2>
<a href='mathomatic.1.html'>mathomatic(1)</a>
, <a href='matho-pascal.1.html'>matho-pascal(1)</a>
, <a href='matho-primes.1.html'>matho-primes(1)</a>
<p>
<h2><a name='sect4' href='#toc4'>Bugs</a></h2>
Please report
bugs to George Gesslein II <georgegesslein@gmail.com>. <p>
<hr><p>
<a name='toc'><b>Table of Contents</b></a><p>
<ul>
<li><a name='toc0' href='#sect0'>Name</a></li>
<li><a name='toc1' href='#sect1'>Synopsis</a></li>
<li><a name='toc2' href='#sect2'>Description</a></li>
<li><a name='toc3' href='#sect3'>See Also</a></li>
<li><a name='toc4' href='#sect4'>Bugs</a></li>
</ul>
</body>
</html>
|
