For a nonzero integer a, show that gcd(a,0)=mod a, gcd(a,a)=mod a, gcd(a,1)=1
Answers
Answered by
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
Science,
2 months ago
Accountancy,
2 months ago
Math,
2 months ago
Math,
5 months ago
English,
1 year ago
Accountancy,
1 year ago