package coq-mathcomp-sum-of-two-square
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
A proof of Fermat's theorem on sum of two squares. It is the proof that uses gaussian integers. This is done in ssreflect. It contains two file :
Install
Dune Dependency
Authors
Maintainers
Sources
v1.0.1.zip
md5=1633745a81e8e3941d00ffb7e6e89883
Description
gauss_int.v : the definition of gaussian integers
fermat2.v : the proof of Fermat's theorem
The final statement reads:
===================================================
From mathcomp Require Import all_ssreflect.
From mathcomp.contrib.sum_of_two_square Require Import gauss_int fermat2. Check sum2stest.
sum2stest : forall n : nat, reflect (forall p : nat, prime p -> odd p -> p %| n -> odd (logn p n) -> p %% 4 = 1) (n \is a sum_of_two_square)
===================================================
Dependencies (5)
-
coq-mathcomp-field
>= "1.7"
-
coq-mathcomp-algebra
>= "1.7"
-
coq-mathcomp-ssreflect
>= "1.7" & < "1.9~"
-
coq
>= "8.8"
- ocaml
Dev Dependencies
None
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page