The divisor fits 3 whole times with 2 left over.
Next stepUse the Euclidean convention to guarantee a non-negative remainder, which is required in many cryptography and hash functions.