two sum Algorithm

In number theory, the sum of two squares theorem says when an integer N > 1 can be write as a sum of two squares, that is, when N = a2 + b2 for some integers a, b. An integer greater than one can be write as a sum of two squares if and only if its prime decomposition contains no prime congruent to raised to an odd power. This theorem supplements Fermat's theorem on sums of two squares which says when a prime number can be write as a sum of two squares, in that it also covers the case for composite numbers.

two sum source code, pseudocode and analysis

COMING SOON!