If you know what a number mod two different primes is (3 and 2) in this case, how can you tell what the mod is of the two products?
-
4? – user2345215 Feb 28 '14 at 01:43
-
If $x = 1 \mod 3$, what are the possibilities for what it could be mod 6? Try making some examples. Similarly, if $x = 0 \mod 2$, what are the possibilities for what it could be mod 6? Do any of these possibilities overlap? – dfan Feb 28 '14 at 02:17
-
For a more general solution, look up the Chinese Remainder Theorem. – Nate Eldredge Feb 28 '14 at 02:32
-
Duplicate of http://math.stackexchange.com/q/693474/18398 – JRN Feb 28 '14 at 04:21
5 Answers
Use Chinese remainder theorem.
$$x \equiv 1 \pmod 3 \implies x = 3k + 1$$ $$x \equiv 0 \pmod 3 \implies x = 2n$$
Now we have:
$$3k + 1 = 2k$$
Work modulo $2$ and we have:
$$3k + 1 \equiv 0 \pmod 2$$ $$k \equiv -1 \equiv 1 \pmod 2 \implies k = 2m + 1$$
Now substitute and we have:
$$x = 3k + 1 = 3(2m + 1) + 1 = 6m + 4 \implies x \equiv 4 \pmod 6$$
- 35,843
Hint $\, $ If $\,m\,$ is odd then $\,x\equiv a\pmod m\iff x \equiv a,\ a\!+\!m\pmod{2m}.\,$ Since $\,m\,$ is odd we see that $\,a\,$ and $\,a+m\,$ have opposite parity, so one of them has the desired parity $\equiv b\pmod{2}.$
Therefore, $ $ for example, $\ x\equiv 1\pmod{3}\iff x\equiv 1,\color{#c00}4\pmod 6,\,$ so $\ x\equiv \color{#c00}4\,$ if $\,x\,$ is even.
More generally one can use the Chinese Remainder Theorem.
- 272,048
In this case the number mod 6 must be 0, 2, or 4, because it's 0 mod 2. And mod 6 it must be 1 or 4 because it's 1 mod 3. Hence it's 4 when modded by 6.
- 2,817
$x = 3a + 1$ and $x = 2b + 0$. So $3a - 2b + 1 = 0$
Let $c = a - b$. So $a + 2c + 1 = 0$.
Let $d = a + c$. So $d + c + 1 = 0$.
Let $e = d + c$. So $e + 1 = 0$ and $e = -1$.
Since $e = d + c$, $d = -1 - c$.
Since $d = a + c$, $-1 - c = a + c$ and $a = -1 - 2c$.
$x = 3a + 1 = 3(-1 - 2c) + 1 = -3 - 6c + 1 = -6c - 2$. So $x \equiv 4 \mod 6$
- 4,216
- 15
- 23