rosetta/greatest_common_divisor.bruijn

Problem description

:import std/Combinator .
:import std/Number .

gcd y [[[=?0 1 (2 0 (1 % 0))]]]

:test ((gcd (+2) (+4)) =? (+2)) ([[1]])
:test ((gcd (+10) (+5)) =? (+5)) ([[1]])
:test ((gcd (+3) (+8)) =? (+1)) ([[1]])