Now suppose the RHS of equation (11) takes the value 5 then there are ten ways in which this number may be obtained on the LHS of the equation. We can have, modulo 10, 0+5, 1+4, 2+3, 3+2, 4+1, 5+0, 6+9, 7+8, 8+7 and 9+6. So if the RHS takes the value c then the 10 possibilities for the LHS are i+(c-i) where i runs through 0 to 9. Note that if c-i<0 then c-i is congruent to 10+c-i modulo 10.
So in essence our solutions for x and y boil down to two equations:-
ax≡i(mod 10)...(14)
and
by≡c−i(mod 10)...(15)
where i runs through 0 to 9. As a and b are coprime to 10, then a and b have an inverse a-1 and b-1 such that
aa−1≡1(mod 10)...(16)
and
bb−1≡1(mod 10)...(17)
Hence our solutions for x and y are
x≡a−1i(mod 10)...(18)
and
y≡b−1(c−i)(mod 10)...(19)
Previously, in equation (12) we considered the situation where a was 7, b was 3 and c was 4. Now the inverse of 7 modulo 10 is 3 (and vice versa since 3x7=21 which is congruent to 1 modulo 10) and so the 10 pairs of solutions are (3i,7(4-i)) modulo 10 where i runs from 0 to 9. This is congruent to (3i,8-7i) modulo 10. So we obtain the pairs (0,8), (3,1), (6,4), (9,7), (2,0), (5,3), (8,6), (1,9), (4,2) and (7,5) as before.
No comments:
Post a Comment