Question 15
Given two relatively prime natural numbers $r$ and $s$, call an integer good if it can be represented as $mr + ns$ with $m, n$ non-negative integers and bad otherwise. Prove that we can find an integer $c$, such that just one of $k$, $c - k$ is good for any $k$. How many bad numbers are there?