RosettaCodeData/Task/Greatest-common-divisor/Factor/greatest-common-divisor.factor

: gcd ( a b -- c )
    [ abs ] [
        [ nip ] [ mod ] 2bi gcd
    ] if-zero ;