How do I solve this system of modular equations?
$2=(4+6a)k_1^{-1}\bmod19 $
$11=(3+6b)k_1^{-1}\bmod19$
$8=(5+5a)k_2^{-1}\bmod19$
$6=(18+5b)k_2^{-1}\bmod19$
I want to get the values for $a, b, k_1$, and $k_2$. Note that $k^{-1}$ denotes the modular inverse (mod $19$) of $k$.
How do I solve this? Or are there infinitely many solutions?
Multiply all congruences by $k_1$ or $k_2$ as appropriate. This gives a linear system: $$2k_1=4+6a\bmod19$$ $$11k_1=3+6b\bmod19$$ $$8k_2=5+5a\bmod19$$ $$6k_2=18+5b\bmod19$$ Now $19$ is a prime number, so we can solve this as if it were over $\mathbb Q$, treating all divisions as multiplications by inverses. We get the following set of solutions (modulo $19$ of course): $$(k_1,k_2,a,b)=(5,6,1,15)+(4,4,14,1)t\qquad t\in\mathbb Z;k_1,k_2\ne0$$