[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem gcd-loop
GCD_loop(; N, M){let Done = false, X = 0, Y = 0 in while ¬ Done do {X := N; Y := M; if X = Y then Done := true else if X < Y then M := Y - X}}
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
verification
,
Proof exists?: No