(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(** gcd. Greatest common divisor.  @author Olga Caprotti and Martijn Oostdijk @version $Revision$ *)
(** * Linear combinations. *)
Definition LinComb (c x y : Z) :=
exists a : Z, (exists b : Z, c = (x * a + y * b)%Z).
Definition LinCombMod (c x y : Z) (n : nat) :=
exists a : Z, (exists b : Z, Mod c (x * a + y * b) n).
Definition ZLinCombMod (c x y n : Z) :=
exists a : Z, (exists b : Z, ZMod c (x * a + y * b) n).
(** * Greatest common divisor. *)
Definition common_div (x y : Z) (d : nat) :=
Divides d (Z.abs_nat x) /\ Divides d (Z.abs_nat y).
Definition gcd (x y : Z) (d : nat) :=
common_div x y d /\ (forall e : nat, common_div x y e -> e <= d).
(** * Euclid's theorem. *)

Lemma euclid_gcd1 :
forall (d : nat) (x y q r : Z), gcd x y d -> x = (q * y + r)%Z -> gcd r y d.