Consider the following congruences:
(1) $x \equiv 3\pmod 4$
(2) $x \equiv 11\pmod{8}$
(3) $x \equiv 13\pmod{16}$
Then
(A). (1) and (2) have a common solution but (1) and (3) do not have a common solution.
(B). (1) and (2) have a common solution but (2) and (3) do not have a common solution.
(C). (1) and (3) have a common solution but (1) and (2) do not have a common solution.
(D). (1) and (3) have a common solution but (2) and (3) do not have a common solution.
(E). (2) and (3) have a common solution but (1) and (2) do not have a common solution.
(F). (2) and (3) have a common solution but (1) and (3) do not have a common solution.
(G). All the three congruences have a common solution.
(H). Any two of the congruences have a common solution.
We know that if the integers $m_i$ where $i = 1,2,3,...,n$ are relatively prime in pairs then then congruences $x \equiv a_i\pmod m_i$ where $a_i$ are integers have one and only one common solution congruent $\pmod M$ where $M = m_1m_2...m_n$. But here $m_1 = 4, m_2 = 8, m_3 = 16$ are not relatively primes. So Chinese Remainder theorem is not applicable here. How we can solve the problem ?