3 ms·
It's not circular reasoning - it's bootstrapping the rational implementation atop the integer implementation.
by yarg 6y ago
It's not circular reasoning - it's bootstrapping the rational implementation atop the integer implementation.
- yarg 6y agoThe euclidean algorithm can compute the GCD of the factors of the naive rational form, repeated subtraction (down to zero) of the GCD from the denominator and numerator can be used to find them in their reduced forms.