doc-src/Tutorial/Recdef/gcd
author paulson
Wed, 13 Sep 2000 18:47:30 +0200
changeset 9945 a0efbd7c88dc
parent 9255 2ceb11a2e190
permissions -rw-r--r--
more integer theorems, better simplification

recdef gcd "measure (%(m,n).n)"
  simpset "simpset() addsimps [mod_less_divisor]"
  "gcd (m, n) = (if n=0 then m else gcd(n, m mod n))"