Go backward to Verification (Continued)Go up to TopGo forward to Logic Evaluator |

More knowledge:

(0')forallminN,n!= 0: gcd(m,n) = gcd(m,mmodn)

Function definition (with recursion term `m`+`n`):

Euclid'( m,n) :=ifm= 0thennelse ifn= 0thenmelse ifn<=mthenEuclid'(mmodn,n)elseEuclid'(m,nmodm)

Author: Wolfgang Schreiner

Last Modification: November 24, 1999