id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
8111,gcd of rationals is trouble,pdehaye,AlexGhitza,"The following was solved along the way. We add a doctest.
The GCD of rationals is still unclear (see trac 3214), and leads to definite problems with reduce().
{{{
K.= QQ[];
print(gcd(64,256))
print(gcd(K(64),K(256)))
print(gcd(64*k^2+128,64*k^3+256))
frac = (64*k^2+128)/(64*k^3+256)
frac.reduce()
print(frac)
}}}
gives
{{{
64
1
1
(64*k^2 + 128)/(64*k^3 + 256)
}}}
The last line in particular is false, according to me.",task,needs_review,minor,sage-9.3,basic arithmetic,,sd109,,,Jonathan Kliem,,N/A,,public/8111,bed3abb1364df5a4e0588953f535b3cc9b563766,,todo