<< remainder Arithmetic the_lcm >>

Scilab Scholar module for schools >> Arithmetic > the_gcd

the_gcd

returns the GCD of two numbers

Calling sequence

p = the_gcd(m,n)

Arguments

m

integer

n

integer

p

integer

Description

the_gcd(m,n) returns the greatest common divisor of m and n.

Examples

the_gcd(25,30)
the_gcd(-25,30)
the_gcd(123,35)

See Also

<< remainder Arithmetic the_lcm >>