How do you find one and what is it exactly? For example, 2x is congruent to 3 (mod 5), what is a solution, what would it look like, how would you write it?
Notice that if and only if if and only if . That is it! We found the solution. When we write it means for some . Therefore, all solutions to have the form .[/quote]
So if I understand this correctly, in the case 6x is congruent to 10 (mod 15), then there is no solution since 6 never divides evenly into 10+15k, where k is an integer.
Once you understood what I wrote above try generalizing the result. Let be positive integers and consider . Let . Prove that if the congruence is solvable then divides .