Greatest common divisor - Rosetta Code
33 49865 ∨ 77 69811 11 9973 If you're interested in how you'd write GCD in Dyalog, if Dyalog didn't have a primitive for it, (i.e. using other algorithms mentioned on this page: iterative, recursive, binary recursive), see different ways to write GCD in D...