Return to Revisions

3 of 3

Commonmark migration

edited Jun 17, 2020 at 9:04

MATL, 7 bytes

pG1$Zm/

Try it Online!

Explanation

Since we can't explicitly use the builtin GCD function (Zd in MATL), I have exploited the fact that the least common multiple of a and b times the greatest common denominator of a and b is equal to the product of a and b.

p % Grab the input implicitly and multiply the two elements
G % Grab the input again, explicitly this time
1$Zm % Compute the least-common multiple
/ % Divide the two to get the greatest common denominator

answered Apr 8, 2016 at 0:14

Suever

11.2k
1
24
52