This directory contains the proof that a number n can be written as the sum of two square numbers if and only if each prime factor $p$ of $n$ that is equal to 3 modulo 4 has its exponent in the decomposition of n that is even.

A note on the development is available at here

To build the directory, type

make all

Laurent Thery thery@sophia.inria.fr