Let n ∈ Z {\displaystyle n\in \mathbb {Z} } . Prove that n ≡ 3 ( mod 5 ) {\displaystyle n\equiv 3{\pmod {5}}} if and only if 3 n + 1 {\displaystyle 3n+1} is divisible by 5 {\displaystyle 5} .
