package coq-sum-of-two-square

  1. Overview
  2. No Docs
Numbers equal to the sum of two square numbers

Install

Dune Dependency

Authors

Maintainers

Sources

v8.7.0.tar.gz
md5=b9ae619de12f39a74879a014db01619b

Description

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.

Dependencies (2)

  1. coq >= "8.7" & < "8.8~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None