Find an integer when divided by $5$ and $13$ leaves residues $4$ and $7$ respectively. (Without Modular Arithmetic).
I don't know if it is right, but I got this $$n=5x+4=13y+7$$
$$n=5(x-11)+59=13(y-4)+59$$ The $\operatorname{lcd}(5,13)=65$
So our number is every number like $n=65k+59$
I'll be glad if you enlighten me it.
${\bf Brute\ force}:\ \ 5\,\Bbb Z+\color{green}4 = \{\ldots, \color{#c00}{-6},-1,\color{green}4,9,13,\ldots\}$
$\qquad\qquad\qquad\ \ 13\Bbb Z+\color{orange}7 = \{\ldots, \color{#c00}{-6},\color{orange}7,20,\ldots\}\,\ $ so $\,\ n\equiv \color{#c00}{-6}\pmod{65 = \rm{lcm}(5,13)}\ $
$\bf Algorithmically,$ using CRT
$\quad\,\ {\rm mod}\ 5\!:\,\ n \equiv 4\equiv 7\!+\!13y \equiv 2\!-\!2y\iff 2\equiv -2y\iff \color{#0a0}{y\equiv -1}$
$\quad$ so its true iff $\ n = 7\!+\!13y = 7 \!+\! 13(\color{#0a0}{-1\!+\!5k}) = -6+65k,\ k\in\Bbb Z$