Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

(a) $x≡5\pmod 7\;\;,\; x≡7\pmod{11}\;\;,\;\;x≡3\pmod{13}$

(b) $x≡3\pmod{10}\;\;,\;\; x≡8\pmod{15}\;\;,\;\;x≡5\pmod{84}$

for (a) I have a rough idea how to do it, its like:

$n_1=7,n_2=11,n_3=13$ then $n=7·11·13=1001$




Hence, $k_1=[5], k_2=[4], k_3=[12]$


the solution set is $x=x_0+k_n, k\leftarrow\mathbb{Z}, x=887+k(1001)$

Im not sure if im correct, but i just follow the standard procedure

(b) for this one, what should I do the the $n$'s are not coprime, or prime???

Thank you!!

share|cite|improve this question
up vote 2 down vote accepted

You've got the idea...

Apply prime factorization to each of the moduli $n$, omit common factors, proceed in much the way you did for (a), and transform each statement in the system into equivalent congruences for the prime powers: (i.e. to a prime residue system). E.g. $$x \equiv 3 \pmod{10} \iff x \equiv 3 \pmod 2 \;\text{and}\; x \equiv 3 \pmod 5\,.$$

And of course, you'll then want to use the Chinese Remainder Theorem and/or the extended CRT.

share|cite|improve this answer
Presumably the final $\iff$ should be "and". – Math Gems Feb 4 '13 at 6:32

Reduce all the statements to equivalent statements to a prime residue system And then use the chinese remainder theorem

share|cite|improve this answer
finding prime factorization of each $n$ then omit the common one? – Paul Feb 4 '13 at 1:51

Case (b) you'd apply the extended chinese remainder theorem. In this case, as $3 \equiv 8 \pmod{\gcd(10, 15)}$, there is a solution, and it will be unique modulo $\mathrm{lcd}(10, 15, 84)$.

Essentially you solve the system $x \equiv 3 \pmod{15}$ and $x \equiv 5 \pmod{84}$, and patch up the solution to agree with your equivalence modulo 10.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.