![]() Here 8 is the largest number, So, GCD (40, 30) = 10.Įxplanation: Integers 1, 2, 4, 5, 10 and 20 can divide both 60 and 40. If the smaller of the two numbers can divide the larger number then the GCD is the smaller number.Įxplanation: Integers 1, 2, 4, and 8 can divide both 40 and 30.When both m and n are 0, their GCD is undefined i.e.Similarly, if m != 0, n = 0, then GCD(m, n) = m. It means, if m = 0, n != 0, then GCD(m, n) = n. If any one of the integer is 0, then the GCD is the other number.It is the largest number which is a divisor of both m and n. Given two non-negative integers m and n, we have to find their greatest common divisor or GCD or HCF. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |