diff options
| author |  letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2011-06-24 15:50:06 +0000 |
|---|---|---|
| committer | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2011-06-24 15:50:06 +0000 |
| commit | 81c4c8bc418cdf42cc88249952dbba465068202c (patch) | |
| tree | 0151cc0964c9874722f237721b800076d08cef37 /theories/PArith/BinPosDef.v | |
| parent | 51c26ecf70212e6ec4130c41af9144058cd27d12 (diff) | |
Numbers: change definition of divide (compat with Znumtheory)
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14237 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/PArith/BinPosDef.v')
| -rw-r--r-- | theories/PArith/BinPosDef.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/PArith/BinPosDef.v b/theories/PArith/BinPosDef.v index 9b6081176..b6b7ab7a5 100644 --- a/theories/PArith/BinPosDef.v +++ b/theories/PArith/BinPosDef.v @@ -338,7 +338,7 @@ Definition sqrt p := fst (sqrtrem p). (** ** Greatest Common Divisor *) -Definition divide p q := exists r, p*r = q. +Definition divide p q := exists r, q = r*p. Notation "( p | q )" := (divide p q) (at level 0) : positive_scope. (** Instead of the Euclid algorithm, we use here the Stein binary |