Math, asked by dishathakur300999, 2 months ago

For a nonzero integer a, show that gcd(a,0)=mod a, gcd(a,a)=mod a, gcd(a,1)=1​

Answers

Answered by yashwarulkar25
9

Step-by-step explanation:

Let a and b be given integers with at least one of them different from zero. The greatest common divisor of a and b, denoted by gcd (a, ...

Similar questions