>Sergey Mechveliani writes:
>> Here we keep in mind that for the Rationals and "the like domains",
>> gcd is trivial:
>> if a /= 0 then gcd(a,b) = 1.
>And [EMAIL PROTECTED] writes:
>> I'm a bit hazy about how gcd behaves on Q (the rationals).
For two rationals p1/q1 and p2/q2, why we cannot define
gcd(p1/q1,p2/q2) = gcd(p1,p2)/lcm(q1,q2) ??
q1,q2 can always be taken to be positive integers.
Hence no problem in finding lcm(q1,q2).
-- Manoranjan Satpathy
United Nations University
Macau
