I have two fractions I want to find the "MOD" between them. Is the answer another fraction?
I chose: Since integer mod is sort of the opposite of integer division. I found the mod of the first fractions numerator and denominator and arbitrarily assigned it as the numerator of the new fraction The same for the second fraction and assigned to the denominator of the new fraction.
Both fractions have already been through euclid's algorithm and are in GCD form.
I have seen many trying to explain it in the terms of ax + by = d or something like that. What are the variables as they relate to the fractions. Is this even the correct direction?