The saved clock uses residues zero through five when the modulus is six. Seven equals one plus one complete lap of six, so the pointer rests at one. Thirteen equals one plus two laps of six and lands at the same residue. The two bars show the actual lengths seven and thirteen, with lap boundaries every six units. Adding a full modulus changes the quotient while preserving the residue. Negative inputs need a nonnegative remainder. Minus one divided by six has floor quotient minus one, so minus one equals five minus six. Its residue is five. The source first takes the language remainder, adds the modulus, and reduces again. Base pointer and result remainder are different fields: starting at seven and adding six keeps both at one, while adding two gives result three without changing the base pointer field. A modular inverse reverses multiplication, not addition. Modulo six, five times five is twenty-five, which leaves remainder one. Therefore five is its own inverse. Six has greatest common divisor six with the modulus and has no inverse. The source runs the extended Euclidean algorithm and reports the inverse only when the greatest common divisor is one. These paired lengths twenty-five and twenty-four show the one-unit remainder.