Math, asked by oakwood, 5 hours ago

prove that the linear congruence ax+by=c(mod n) has a solution if and only if gcd(a,b,n) | c

Answers

Answered by babidewal817
0

Answer:

history 9 ninth 2021 paper

Answered by kenvash02
0

Answer:

wat?

Step-by-step explanation:

Similar questions