I know these things If $x$ is divided by $11$ it remainder of $7$. If $x$ is divided by $13$ it remainder of $7$. If $x$ is divide by $3$ it remainder $3$. $x$ is less than $500$.
I am trying to prove that $x$ even ...
I know these things If $x$ is divided by $11$ it remainder of $7$. If $x$ is divided by $13$ it remainder of $7$. If $x$ is divide by $3$ it remainder $3$. $x$ is less than $500$.
I am trying to prove that $x$ even ...
Hint $\ $ If $\,x\,$ is a solution so too is $\,x + 3\cdot 11\cdot 13,$ and they have opposite parity.
Maybe you seek to prove that the least nonegative solution is even. Then
coprime $\,11,13\mid x-7\,\Rightarrow\, 11\cdot 13= 143\mid x-7\ $ so $\,x = 7 + 143k$.
Thus ${\rm mod}\ 3\!:\,\ 3 \equiv x \equiv 7+143k\equiv 1+2k\ $ so $\,2k\equiv 2,\,$ so $\,k\equiv 1\ $ so $\, k = 1+3n$
Thus $\,x = 7+143(1+3n) = 150+ 429n$
If you are familiar with modular arithmetic, you can set up your information into modular equivalences: $$\begin{cases}x\equiv7\mod11\\x\equiv7\mod13\\x\equiv0\mod3\end{cases}$$ You can then use the Chinese Remainder Theorem to solve this. Note that $11,13,3$ are pairwise coprime, and the solution modulo $(3)(13)(11)=429$ is less than $500$. Also note that the last equivalence shows a remainder of $0$ when divided by three, which is equivalent to a remainder of $3$ when divided by $3$ (since the remainder should be less than the divisor).