I came across a problem which asked to prove that $\mathbb Z\setminus 5\mathbb Z$ is countable. My first approach was to observe that $\mathbb Z\setminus 5\mathbb Z$ is an infinite subset of $\mathbb Z$ and hence is countable (as is shown here). However, since $\mathbb Z\setminus 5\mathbb Z$ is not too "ugly" I still wonder whether it is possible to have a somewhat more explicit bijection between $\mathbb Z$ and $\mathbb Z\setminus 5\mathbb Z$. I have no precise definition of explicit, but intuitively something not involving taking minima. I know this might be challenging, since the well ordering principle and induction are at the heart of arithmetic.
If the question were to find a bijection $f:\mathbb Z\to \mathbb Z\setminus 2\mathbb Z$ then $f(n)=2n+1$ would easily do the job. I don't see a way to adapt this reasoning to $\mathbb Z\setminus5\mathbb Z$ (or $\mathbb Z\setminus n\mathbb Z$ for any $n>2$ for that matter).