Solve the system of congruence relations:
$$5x+17y\equiv 1 \pmod{24}$$
$$6x+10y\equiv 2\pmod{24}$$
Can someone help me? I usually use Chinese theorem, but here that is not possible.
Solve the system of congruence relations:
$$5x+17y\equiv 1 \pmod{24}$$
$$6x+10y\equiv 2\pmod{24}$$
Can someone help me? I usually use Chinese theorem, but here that is not possible.
Subtract both equations to make $x$ appear.
$\begin{cases}5x+17y\equiv 1\pmod{24}\\6x+10y\equiv 2\pmod{24}\end{cases}\iff \begin{cases}5x+17y\equiv 1\pmod{24}\\x\equiv 7y+1\pmod{24}\end{cases}$
We can now substitute in the first equation to solve for $y$.
$5x+17y\equiv 35y+5+17y\equiv 4y+5\equiv 1\pmod{24}\iff 4y\equiv 20\pmod{24}$
Now all coefficients are divisible by $4$ including the modulo, therefore we can simplify it to $$y\equiv 5\pmod 6$$
Note: do not make the mistake to go $\, y\equiv 5\pmod{24}\, $, this is not true, you cannot divide by $4$ because $\gcd(24,4)\neq 1$, but you can reduce the equation to a lower modulo when this one is also divisible.
We continue by setting $\, y=6n+5\, $ for some integer $n$.
$\begin{cases}y\equiv 6n+5\pmod{24}\\x\equiv 7y+1\pmod{24}\end{cases}\iff \begin{cases}y\equiv 6n+5\pmod{24}\\x\equiv 42n+36\pmod{24}\end{cases}\iff \begin{cases}y\equiv 6n+5\pmod{24}\\x\equiv 18n+12\pmod{24}\end{cases}$
You can verify the the solutions are cycling for $n\ge4$, you get for $n=0,1,2,3$
$$\{(12,5),(6,11),(0,17),(18,23)\}$$