find all integers x satisfying each of the following congruences mod n. if no such x exists, explain why not

please find the solution:

Step-by-step explanation:

please find the correct question:

Given value:  

should be divisible by 6  we are also given that  and start with x = 0  

=-2 which is not divisible by 6  

x= 1  

= 2 not divisilble by 6  

x= 2

= 6 which is divisible by 6  

x=3  

= 10 not divisible by 6

x=4  

 = 14 not divisible by 6  

x=5

 = 18 which is divisible by 6  

so such x are x = 2 and x = 5

he sells x mount because thats eqivilqant to the maz and then divided into quarters

step-by-step explanation: