Primes and mod-n into the fold (#47)

This commit is contained in:
Patrick Stevens
2019-10-02 18:59:46 +01:00
committed by GitHub
parent 00ce1dfdf8
commit 21ee0f899d
10 changed files with 48 additions and 39 deletions

View File

@@ -8,8 +8,8 @@ open import Orders
open import Rings.Definition
open import Numbers.Naturals.Naturals
open import Numbers.Integers.Integers
open import PrimeNumbers
open import IntegersModN
open import Numbers.Primes.PrimeNumbers
open import Numbers.Modulo.IntegersModN
module Rings.Examples.Proofs where
nToZn' : (n : ) (pr : 0 <N n) (x : ) n n pr