doc-src/Tutorial/Recdef/gcd
author paulson
Wed, 14 Feb 2001 12:16:32 +0100
changeset 11115 285b31e9e026
parent 9255 2ceb11a2e190
permissions -rw-r--r--
a new theorem from Bryan Ford

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))"