Hi everyone, If a is an integer mod m (and m is a positive integer), then the gcd of a and m is well defined; it's the gcd of A and m were A is any integer representing a mod m. Consider this transcript in sage:
sage: a = Mod(1,6) sage: b = Mod(3,6) sage: print gcd(a-b,6) # is this a bug? sage: print gcd(b-a,6) 4 2 sage seems to think that the gcd of 6 and (-2 mod 6) is -2 mod 6, which it converts to 4. A mathematician would say that the gcd is 2. Is this a bug, or does sage have a higher purpose here? Thanks, Ken -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
