Chinese remainder theorem, can't figure it out! x mod 5 = 3
x mod 7 = 5
x mod 11 = 7
How to determine x? I've been searching on YouTube, but they're giving examples in different ways, for example 
x  ≡  1(mod 3)
I don't understand it, is it the same as x mod 3 = 1?
Thanks, Im still new and quite slow at math, I'm trying to understand it still 

Chinese Reminder Theorem says that there exist one solution $\mod M= m_1 \cdot \dots m_n$ of the system
$$\cases{x \equiv b_1 \mod m_1 \\ x \equiv b_2 \mod m_2 \\ \dots \\ x \equiv b_n \mod m_n}$$
and the solution is of the form $$x=b_1M_1M_1'+ \dots + b_nM_nM_n'$$ where $$ M_i= \frac{m_1 \cdot \dots m_n}{m_i}$$ and $M_i$' is the inverse of $M$, so $$M_i'M_i \equiv 1 \mod m_i$$
