Thun/docs/reference/gcd.md

18 lines
285 B
Markdown

------------------------------------------------------------------------
## gcd
Function
Take two integers from the stack and replace them with their Greatest
Common Denominator.
### Definition
> true \[[tuck] [mod] [dup] 0 [>]\] [loop] [pop]
### Discussion
Euclid's Algorithm