Find solutions of linear congruences: $x\equiv 0 \pmod 2$ , $x\equiv 0 \pmod 3$, $x\equiv 1 \pmod5$, $x\equiv 6 \pmod7$ 
$x\equiv 0 \pmod 2$
  $x\equiv 0 \pmod 3$
  $x\equiv 1 \pmod5$
  $x\equiv 6 \pmod7$
  Find all the solutions of each of the following systems of linear congruences.

I know how to find solutions of three congruence equations, but
I don't know how to solve the 4 equations system...
I can't find it in my text book but it is in exercise sample... help me pls.

Hint: You can easily guess one solution. (What is the smallest positive integer which is both even and multiple of 3)?
If you know Chinese remainder theorem then you know that once you have one solution $x_0$ all other solutions will be
$$x\equiv x_0 \pmod{210}.$$ 
Of course, this can be solved also without guessing. (And for larger numbers it would be difficult to guess one solution.)
For a more systematic approach you can see the Wikipedia article I linked above, you can try the hint I have given in a comment or you can look on some other posts on this site tagged congruences+systems-of-equations or chinese-remainder-theorem.
