[Haskell-cafe] Re: gcd

Achim Schneider barsoap at web.de
Sat May 2 18:17:22 EDT 2009

Steve <stevech1097 at yahoo.com.au> wrote:

> "It is useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then
> the natural numbers become a complete distributive lattice with gcd
> as meet and lcm as join operation. This extension of the definition
> is also compatible with the generalization for commutative rings
> given below."
Ouch. Speak of mathematicians annoying programmers by claiming that 0
isn't divisible by any of [1..], and further implying that 0 is bigger
than all of those, not to mention justifying all that with long words.

Damn them buggers.

(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring, renting,
performance and/or quoting of this signature prohibited.

More information about the Haskell-Cafe mailing list