Numbers equal to the sum of two square numbers. A 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.

opam install coq-sum-of-two-square.8.6.0

- homepage
- https://github.com/coq-contribs/sum-of-two-square
- license
- LGPL 2.1
- bugs tracker
- https://github.com/coq-contribs/sum-of-two-square/issues
- dependencies
- coq (>= 8.6 & < 8.7~)
- source
- https://github.com/coq-contribs/sum-of-two-square/archive/v8.6.0.tar.gz
- package
- https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-sum-of-two-square/coq-sum-of-two-square.8.6.0