The Chinese Remainder Theorem · Easy problem

Solving a CRT system by substitution needs a modular inverse. Find the integer $k$ with $0 \le k < 7$ such that $5k \equiv 1 \pmod 7$, the inverse of $5$ modulo $7$.