Modular Arithmetic and non zero solutions

644 Views Asked by At

My question reads:

a. Give 3 examples of the form ax=b in (mod 12) that has no nonzero solutions

b) In each equations, does equation ax=0 have a nonzero solution?

My proposed answer:

a. 2x=6, 4x=8 and 6x=6.

I am not too sure if this works or if I am misreading what no nonzero solutions means.

2

There are 2 best solutions below

5
On BEST ANSWER

For section (a), if you pick a value for $a$ such that $d=\gcd(a,12)\ne 1$ - that is to say, $a$ and $12$ have a common factor $d$ - and then pick $b$ that is not a multiple of $d$, you will have an equation $ax\equiv b \bmod 12$ that does not have a solution. For example, $8x\equiv 10$, which has $d=4$, fulfills the requirements.

Then for section (b), for any equation $ax\equiv 0 \bmod 12$, where $a$ is chosen as above, then choosing $x=12/d$ will solve the equation.

In fact if you want to avoid non-zero solutions to $cx= 0$ in $\Bbb Z_{12}$, you need to have $\gcd(c,12)=1$. However then for any choice of $b$ there will be a solution for $cx=b$.

0
On

The reason for the existence of such equations is because $12$ is not a prime. Due to this fact the ring $\Bbb Z_{12}$ has zero-divisors, e.g. $3$ and $4$ are zero divisors since $3 \cdot 4 = 0 \mod(12)$. Elements that are no zero-divisors have no common divisors with $12$ and are invertible (have a multiplicative inverse), like $5$ which is its own inverse : $5 \cdot 5 = 1 \mod(12)$. $a$ is invertible $\iff$ the equation $ax = b$ has a solution $\forall b \neq 0$. This is because $a^{-1}b$ is such a solution.