Sunday, June 24, 2007

Greatest Common Divisor

Although quite simple, this is one of my favourite new features for 0.8. One will now be able to calculate the greatest common divisor of an unlimited amount of numbers. This way, we can now write

gcd( 675; 633312; -57618; 243 )

This is particularly useful if you are adding fractions by hand and they all have different denominators, but has certainly a whole bunch of other applications.

No comments: