For each of the following congruences if there is a solution, express the solution in the form x ≡ some_number (mod some_modulus), e. g. x ≡ 6 (mod 9). to standardize answers, some_number should always be a value in the range {0, 1, 2, some_modulus -1}. for example x ≡ 5 (mod 8) is ok but x ≡ 13 (mod 8) is not.

if there is no solution say "no solution". you don't have to show work for any of the problems. type your answers in the write submission box. for example

a) x ≡ 4 (mod 17)

b) x ≡ 5 (mod 21)

c) no solution

etc.



here are the problems.

a) 5x - 7 = 11 (mod 17)

b) 6x + 12 = 2 (mod 21)

c) 14x + 5 = 9 (mod 20)

d) 12x + 12 = 12 (mod 12)

e) (-7)x + 5 = 2 (mod 30)

f) 21x - 13 = 7 (mod 34)

g) 20x + 17 = 1 (mod 28)

h) -x + 13 = 28 (mod 2)

i) 1,000,000,000x + 82 = 5 (mod 9)

j) (544415)x + 7326 = 48867 (mod 17)