← problem archive problem 25 hard number theory For which integers $c, 0 \leq c<30$, does the congruence $12 x \equiv c(\bmod 30)$ have solutions? When there are solutions, how many incongruent solutions are there?