Anonymous user
Greatest common divisor: Difference between revisions
→{{header|Mathematica}}
(Adding pattern matching example to Scala) |
|||
Line 1,121:
gcd(n, m) = (x asa x*y eq 0) fby eod;
end</lang>
=={{header|Maple}}==
To compute the greatest common divisor of two integers in Maple, use the procedure igcd.
<lang Maple>igcd( a, b )</lang>
For example,
<lang Maple>
> igcd( 24, 15 );
3
</lang>
=={{header|Mathematica}}==
| |||