When programming, there are surprisingly many situations where you want to know not only the "answer (quotient)" of a division but also the "remainder (modulus)" at the same time. "How many minutes ...

If GCD(a,b) = 1, then for any remainder ra modulo a and any remainder rb modulo b there exists integer n, such that n = ra (mod a) and n = ra(mod b). If n1 and n2 are ...