Babylon    1576  bytes  ;Babylon algorithm's to approximate 2
Fact48      471  bytes  ;Computes the factorials of 0 to 48
Factorial  1167  bytes  ;Test of iterative an recursive factorial functions
GCD        1019  bytes  ;Iterative an recursive algorithms to search the GCD
Q          1433  bytes  ;Library to work in Q (incomplete, by far)
Reverse    2128  bytes  ;Reverse the stack (also has the EXCHG function)
Squares     392  bytes  ;Computes squares by using adds only
Sum         495  bytes  ;Recursively compute 1+2+...+n = n*(n+1)/2
