Two Sum Algorithm

In number theory, the sum of two squares theorem relates the prime decomposition of any integer N > 1 to whether it can be write as a sum of two squares, such that N = a2 + b2 for some integers a, b. 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!