Go backward to SpecificationGo up to TopGo forward to Verification |

New knowledge:

(0)forallminN,n<=m: gcd(m,n) = gcd(m-n,n).

Idea for recursive function definition (termination term `m`+`n`):

Euclid( m,n) :=ifm= 0thennelse ifn= 0thenmelse ifn<=mthenEuclid(m-n,n)elseEuclid(m,n-m).

Author: Wolfgang Schreiner

Last Modification: November 24, 1999