If $f(a)$ is divisible by either $101$ or $107$ for each $a\in\Bbb{Z}$, then $f(a)$ is divisible by at least one of them for all $a$ I've been struggling with this problem for a while, I really don't know where to start:

Let $f(x) \in \mathbb{Z}[X]$ be a polynomial such that for every value of $a \in \mathbb{Z}$, $f(a)$ is always a multiple of $101$ or $107$. Prove that $f(a)$ is always divisible by $101$ for all values of $a$, or that $f(a)$ is divisible by 107 for all values of $a$.


If neither of the statements "$f(x)$ is always divisible by $101$" or "$f(x)$ is always divisible by $107$" is true, then there exist $a,b\in{\bf Z}$ so that $107\nmid f(a)$ and $101\nmid f(b)$. It follows from hypotheses that
$$\begin{cases} f(a)\equiv 0\bmod 101 \\ f(a)\not\equiv0\bmod 107\end{cases}\qquad \begin{cases}f(b)\not\equiv 0\bmod 101 \\ f(b)\equiv 0\bmod 107\end{cases}$$
Let $c\in{\bf Z}$ be $\equiv a\bmod 107$ and $\equiv b\bmod 101$. Is $f(c)$ divisible by $101$ or $107$?
