instance method
Integer#gcdlcm
(::Integer) -> [ ::Integer, ::Integer ]
int.gcdlcm(other_int) → array
rational.c
View on GitHub ↗
VALUE
rb_gcdlcm(VALUE self, VALUE other)
{
other = nurat_int_value(other);
return rb_assoc_new(f_gcd(self, other), f_lcm(self, other));
}
Returns an array with the greatest common divisor and the least common multiple of the two integers, [gcd, lcm].
Example
36.gcdlcm(60) #=> [12, 180] 2.gcdlcm(2) #=> [2, 2] 3.gcdlcm(-7) #=> [1, 21] ((1<<31)-1).gcdlcm((1<<61)-1) #=> [1, 4951760154835678088235319297]