I have tried to solve the below congruence system but i don't succeed , such that i have wrote $3x+5y=6$ as $5y =-3x²\mod (6)$ then i can't write this equation as : $y= z \bmod 6$ in order to solve this system , Then my question here is
Question How to solve this system : $$ \begin{cases} 3x+5y=6 \\ y \equiv x² \pmod{5} \end{cases} $$
We have that
then one solution is given by
and therefore
Note that since $gdc(3,5)=1$, by Bezout's identity, the equation $3k+5j=-4$ has infinitely many solutions, notably $\forall m\in \mathbb{Z}$
$$3(2)+5(-2)=-4\implies 3(2+5m)+5(-2-3m)=-4 $$
thus all the pairs
leads to different solutions