I have a number $m = p\cdot q$, where $p,q$ are (odd) prime numbers. Is there any relation between $a \bmod{m}$ and $a \bmod p$ (or $a \bmod q$)?
P.S: Actually, I want to see is it possible to calculate modulo $m$ faster or not.
I have a number $m = p\cdot q$, where $p,q$ are (odd) prime numbers. Is there any relation between $a \bmod{m}$ and $a \bmod p$ (or $a \bmod q$)?
P.S: Actually, I want to see is it possible to calculate modulo $m$ faster or not.