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
0
Answer:
history 9 ninth 2021 paper
Answered by
0
Answer:
wat?
Step-by-step explanation:
Similar questions