How to overwrite BigRational.gcd() ?

[axkr]

In the BigRational#gcd(a,b) method I would like to implement a GCD which gives the greatest rational number r for which all the a/r and b/r are integers and which should be used in the polynomial GCD methods.

• https://github.com/kredel/java-algebra-system/blob/8f040b29fc4faaa2ac6d12b993769aa6bb78fd66/src/edu/jas/arith/BigRational.java#L1146

Example:

GCD( 2/5, 3/7)  ==>  1/35

Is this possible? For example with a "global flag" which could be set to true?

See:

• https://math.stackexchange.com/a/151431
• https://math.stackexchange.com/questions/151081/gcd-of-rationals

[axkr]

The same (derivated ?) behaviour can also be reproduced in

GreatestCommonDivisorAbstract<BigRational>#gcd(GenPolynomial<BigRational> P, GenPolynomial<BigRational> S)

• https://github.com/kredel/java-algebra-system/blob/255fe6b2d26cef4e89ea64d931dd738bea8f8624/src/edu/jas/ufd/GreatestCommonDivisorAbstract.java#L411

GreatestCommonDivisorAbstract<BigRational>#lcm(GenPolynomial<BigRational> P, GenPolynomial<BigRational> S)

• https://github.com/kredel/java-algebra-system/blob/255fe6b2d26cef4e89ea64d931dd738bea8f8624/src/edu/jas/ufd/GreatestCommonDivisorAbstract.java#L438

In Wolfram language

• PolynomialGCD[1/2,2] returns 1/2, whereas JAS returns 1
• PolynomialLCM[1/2,2] returns 2, whereas JAS returns 1